Arrays & Strings Construction of BST
Basic Array & Strings Implementation Conversion Based Problems
Kadane’s Algorithm (Max sum of Modification in BST
continuous sub-array) Standard Problems
Dutch national Flag Algorithm Priority Queue and Heaps
Sliding Window Implementation Based Problem
Two Pointers Conversion Based Problem
Traversal Based problems K based Problem
Rotational Bases Problems Graphs
Graph Traversal - BFS and DFS
Recursion & Backtracking MST
Understanding Recursions Shortest Path Algorithm
Basic Recursion Questions Topological Sort
Understanding Backtracking Graphs in Matrix
Divide & Conquer Algorithm
Dynamic programming
Sorting Algorithms DP with Arrays
Insertion Sort DP with Strings
Binary Insertion Sort DP with Maths
Selection Sort DP with Trees
Bubble Sort Breaking and Partition Problem
Merge Sort Counting Based problem
Quick Sort Hard Recursion and Backtracking
Radix Sort Questions
Binary Search Applications
Binary Search Algorithm Other Topics
Binary Search on Arrays Hashmaps
Binary Search on Matrix Tries
Linked Lists Bit Manipulation
Linked List Implementation Greedy
Reversal problems Circular Queues
Sorting Linked List Deques – Hot Topic
Slow and Fast Pointers Doubly and Circular Linked List
Modifying Linked List String Algorithm like KMP and Z
Stacks (LIFO)
Implementation
Prefix, Postfix, Infix Problems
Application/Problems
Queues (FIFO)
Implementation
Priority Queue
Circular Queue
Application/Problem
Binary Trees
Tree Traversals
Construction of Trees
Trees views
Standard Problem
BST