Course Content
Module 1
The whole course of 36 sessions (18 weeks) is broadly split into three modules. Module 1 (12 sessions) - Elementary
0/1
Module 2
(12 sessions) - Intermediate
0/1
Module 3
(12 sessions) - Advanced
0/1
Instructor-Led Online Live Training
About Lesson
  1. Backtracking – Generation of Subsets and Combinations
  2. Backtracking – Generation of Permutations
  3. Solving Optimization Problems using Dynamic Programming (DP)
  4. DP – Recurrence and Memoization
  5. DP – Optimal Subsets and Subarrays
  6. DP – Path Finding Problems
  7. DP – Counting Problems
  8. Greedy BFS and Dijkstra’s approach
  9. Greedy Two Pointers and Sliding Window
  10. Advanced Binary Search
Exercise Files
No Attachment Found
No Attachment Found
Open chat
Hello How can I help you?