Stack Bash - Master data structures and algorithms


Recursion is a computing pattern where a function solves a problem by breaking it down into subproblems and calling itself repeatedly until it solves them.
A recursive function includes a base case that it eventually reaches to stop further recursive calls. Without a base case, the recursive calls would never end, and we'd run into a stack overflow.
For example, let's take a look at computing the factorial of a number.
6! = 6 * 5 * 4 * 3 * 2 * 1
Notice that 6! = 6 * 5!, and that the number 1 is the final number in the multiplication sequence.
Let's implement factorial in Python:
Each time we call factorial, we put the call on the stack. Eventually we hit our base case where num = 1, and each function call on the stack can return.

8 Essential Recursion & Dynamic Programming Coding Interview Problems

Master Recursion & Dynamic Programming by trying the coding challenges below.
  1. 1.FibonacciEasy
  2. 2.Unique pathsMedium
  3. 3.KnapsackMedium
  4. 4.Subset sumMedium
  5. 5.Power setMedium
  6. 6.Coin changeMedium
  7. 7.Word breakHard
  8. 8.Longest common subsequenceHard

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.