coding_study_plan
coding_study_plan
1. Brute Force
- Concept: Test all possible solutions and pick the correct one.
- Problems:
2. Recursion
- Problems:
- Factorial of a number.
- Fibonacci sequence.
- Problems:
- Merge Sort.
- Quick Sort.
- Binary Search.
Practice Tasks: Solve problems involving Divide and Conquer on Leetcode/Codeforces.
1. Greedy Algorithms
- Problems:
- Activity Selection.
- Fractional Knapsack.
- Problems:
- Steps:
- Top-Down (Memoization)
- Bottom-Up (Tabulation)
- Problems:
- Coin Change.
1. Backtracking
- Problems:
- N-Queens.
- Sudoku Solver.
2. Graph Techniques
- Leetcode
- Codeforces
- GeeksforGeeks.