💻 Coding Interview Questions

1️⃣ What is recursion?
Answer: When a function calls itself until a base condition is met.

2️⃣ What is iteration?
Answer: Repeating a set of instructions using loops (for, while).

3️⃣ Recursion vs Iteration?
Answer: Recursion uses function calls; iteration uses loops. Recursion may use more memory.

4️⃣ What is a base case?
Answer: The condition that stops recursion.

5️⃣ What is tail recursion?
Answer: A recursion where the recursive call is the last operation.

6️⃣ What is a divide-and-conquer algorithm?
Answer: Break problem into smaller sub-problems, solve recursively, combine results.

7️⃣ What is dynamic programming?
Answer: Solving problems by storing intermediate results to avoid recomputation.

8️⃣ What is memoization?
Answer: Storing function results to speed up future calls.

9️⃣ What is greedy algorithm?
Answer: Make the locally optimal choice at each step to find global optimum.

🔟 What is backtracking?
Answer: Trying all possibilities and discarding invalid paths to find a solution.