
🧭 Master Roadmap to Problem Identification
🔹 1. Recursion Problems (Foundation) Use recursion when a problem can be defined in terms of smaller self-similar subproblems with a clear base case. A. Mathematical Recurrence Factorial of n Fibonacci numbers (naïve recursion) Power of n (x^n) using recursion Greatest Common Divisor (Euclidean algorithm) B. Divide & Conquer Binary Search Merge Sort Quick Sort…