AOA
- LCS
- String Matching (All)
- N-Queen, 8 Queen
- P, N-P Problems
- Sum of Subset, Job Sequencing
- Greedy Knapsack , 15 Puzzle
- 0/1 Knapsack
- Dijkstra , Multi Stage Graphs, Graph Colouring
- Merge , Quick , Min-Max Binary
- Asymptotic Notions, Master Theorem
- Travelling Salesman Problem
- Differences:
a. Greedy vs Dynamic
b. Branch and Backtracking
c. Bellman & Dijkstra
d. Prims and Kruskal
Important Note:
All materials available on Doubtly.in are contributed by students. While the platform may provide valuable insights and resources, it’s crucial not to rely solely on these for your preparation. The “important questions” featured on Doubtly.in are likely to be repeated in exams, but this repetition is not guaranteed. Therefore, it’s advisable to utilize a variety of study materials and strategies to ensure comprehensive preparation. Remember, success in examinations requires a well-rounded approach, including understanding concepts thoroughly and practicing a wide range of questions.
