9️⃣8️⃣ What is Divide and Conquer?

Answer:

Divide and Conquer is an algorithm design technique that solves a problem by: 

1. Dividing it into smaller subproblems. 

2. Solving each subproblem recursively. 

3. Combining their solutions to solve the original problem. 

Examples: 

• Merge Sort 

• Quick Sort 

• Binary Search 

9️⃣9️⃣ What is a Greedy Algorithm?

Answer:

A Greedy Algorithm builds a solution step by step by always choosing the locally optimal option at each stage, hoping it leads to the global optimum.

Examples: 

• Kruskal's Algorithm 

• Prim's Algorithm 

• Dijkstra's Algorithm 

• Huffman Coding 

Advantages: 

• Fast and easy to implement 

Limitation: 

• Does not always produce the optimal solution.

1️⃣0️⃣0️⃣ What is Dynamic Programming?

Answer:

Dynamic Programming (DP) is an optimization technique used to solve problems by breaking them into smaller overlapping subproblems and storing their solutions to avoid repeated computations.

Two Approaches: 

• Memoization (Top-Down): Uses recursion with caching. 

• Tabulation (Bottom-Up): Solves subproblems iteratively using a table. 

Applications: 

• Fibonacci Sequence 

• Longest Common Subsequence 

• Knapsack Problem 

• Coin Change Problem 

• Matrix Chain Multiplication 

Benefits: 

• Reduces time complexity 

• Avoids redundant calculations 

• Improves performance for complex recursive problems 

🔥 Double Tap ❤️ For Part-11