Algorithm Challenges

Algorithm Challenges

This is a collection of my answers to Martin Puryears Algorithim Challenges book. Although I have completed most solutions, I cannot guarantee that all cases will work since I can't test every single case. All my solutions are written in JavaScript

Contents

The table of contents for ease of navigation

Foundation and Fundamentals

Chapter 1 through 4 contain algorithms that can be solved using basic functional programming.

• Chapter - 1 Fundamentals 01
• Chapter - 2 Fundamentals 02
• Chapter - 3 Arrays 01
• Chapter - 4 Strings and Associative Arrays

Challenges

These chapters contain algorithms that can be solved using more conceptual ideas than pure functional programming.

• Chapter - 5 Linked Lists 01
• Chapter - 6 Queues and Stacks
• Chapter - 7 Arrays 02
• Chapter - 8 Linked Lists 02
• Chapter - 9 Recursion
• Chapter - 10 Strings 01
• Chapter - 11 Trees 01
• Chapter - 12 Sorts
• Chapter - 13 Sets and Priority Queues
• Chapter - 14 Hashes
• Chapter - 15 Trees 02
• Chapter - 16 Tries
• Chapter - 17 Graphs
• Chapter - 18 Bit Arithmetic
• Chapter - 19 Trees 03
• Chapter - 20 Spacial Logic (not added, this chapter contains no directly programmable challenges)
• Chapter - 21 Optimization (not added, this chapter repeats earlier challenges with more stringent time complexity. Implemented in those chapters)