FreeCodeCamp Bonfire Challenge Solutions

In order to help land that coding job I’ve been dreaming of, and since I’m currently unemployed, I thought I’d use spare time where I’m not coding on something cool, or applying for dev jobs to work on my craft.

Beginner Algorithm Scripting

Here are gists from the Bonfire Challenges:

Free Code Camp :: Bonfires

1. Bonfire: Meet Bonfire

2. Bonfire: Reverse a String

3. Bonfire: Factorialize a Number

4. Bonfire: Check for Palindromes

5. Bonfire: Find the Longest Word in a String

6. Bonfire: Title Case a Sentence

7. Bonfire: Return Largest Numbers in Arrays

8. Bonfire: Confirm the Ending

9. Bonfire: Repeat a string repeat a string

10. Bonfire: Truncate a string

11. Bonfire: Chunky Monkey

12. Bonfire: Slasher Flick

13. Bonfire: Mutations

14. Bonfire: Falsy Bouncer

15. Bonfire: Seek and Destroy

16. Bonfire: Where do I belong

Intermediate Algorithm Scripting

1. Bonfire: Sum All Numbers in a Range

2. Bonfire: Diff Two Arrays

3. Bonfire: Roman Numeral Converter

4. Bonfire: Where art thou

5. Bonfire: Search and Replace

6. Bonfire: Pig Latin

7. Bonfire: DNA Pairing

8. Bonfire: Missing letters

9. Bonfire: Boo Who

10. Bonfire: Sorted Union

11. Bonfire: Convert HTML Entities

12. Bonfire: SpinalTap Case

13. Bonfire: Sum All Odd Fibonacci Numbers

14. Bonfire: Sum All Primes

It's only fair to share...
Share on Facebook0Share on Google+0Tweet about this on TwitterShare on LinkedIn0Pin on Pinterest0Share on StumbleUpon0Share on Reddit0Buffer this pageShare on Tumblr0Flattr the author

Published by

Patrick Curl

Patrick Curl is a developer, coder, writer, blogger, affiliate marketer, and more. He lives and breathes apps/startups and has a permanent residency on HackerNews.

Leave a Reply

Your email address will not be published. Required fields are marked *