- Algorithms on (8h)
- Recursion
- Arrays
- Queue
- Stack
- Binary tree
- Binary search tree
- Heap
- Trie
- Hashing (2h)
- Overview
- Collisions
- Practical use
- Benefits of hashing
- Sorting (3h)
- Overview
- Bubble sort
- Selection sort
- Insertion sort
- Bucket sort
- Merge sort
- Quicksort
- Heapsort
- Comparisons
- Graph (5h)
- BFS, DFS
- Shortest path
- Topological sort
- Dijkstra
- Bellman ford
- Floyd Warshall
- Minimum spanning tree
- Disjoint sets
- Kruskal’s
- Prims
- Greedy algorithms (2h)
- Intro
- Activity selection
- coin change problem
- Fractional knapsack problem
- Divide & Conquer (4h)
- Intro
- Binary search, Quick & merge sort
- Fibonacci series
- Number factor
- House thief
- Convert one string to another (edit distance)
- Zero-one knapsack
- longest common subsequence length
- longest palindromic subsequence
- longest palindromic substring
- min cost to reach the end of the array
- Number of paths to reach the last cell with a given cost
- Dynamic programming (DP) (3h)
- Intro
- Top-down approach
- Bottom-up approach
- Merge sort dynamic programming
- Number factor problem
- House thief problem
- Convert one string to another
- Zero one knapsack problem
- Longest common subsequences
- Longest palindromic subsequences
- Longest palindromic substring
- Min cost to reach the end of the array.
- Interview Preparation (3h)
- Overview
- Difference companies interview styles
- Amazon
- Microsoft
- Salesforce
- Adobe
- Most commonly asked questions
- Behavioral preparation important?
- Work ethics
- Practicing interview before attend