Arrays: 1D arrays, 2D arrays, Dynamic arrays, Array Foundation, Two Sum, Maximum Subarray Sum, Merge Intervals, Remove Duplicates, Contains Duplicate, Best Time To Buy Stock
Linked Lists: Singly Linked List, Doubly Linked List, Circular Linked List, Linked List Foundation, Reverse Linked List, Detect Cycle, Merge Sorted Lists, Remove Nth Node, Palindrome Linked List
Stacks: LIFO Data Structure, Stack Foundation, Valid Parentheses, Next Greater Element, Reverse Stack, Min Stack, Trapping Rain Water, Daily Temperatures, Largest Rectangle in Histogram
Queues: FIFO Data Structure, Queue Foundation, Sliding Window Maximum, Generate Numbers, First Negative Integer, Reveal Cards In Increasing Order, Dota2 Senate
Binary Trees: Tree Foundation, Binary Tree Inorder Traversal, Binary Tree Preorder Traversal, Binary Tree Postorder Traversal, Binary Tree Level Order Traversal, Binary Search Tree, Path Sum, Lowest Common Ancestor, Validate BST, Symmetric Tree
Graphs: Graph Foundation, Breadth-First Search (BFS), Depth-First Search (DFS), Dijkstra Algorithm, Bellman-Ford Algorithm, Floyd-Warshall Algorithm, Topological Sort, Cycle Detection, Number of Islands, Clone Graph, Course Schedule
Heaps: Min Heap, Max Heap, Heap Foundation, Kth Largest Element, Merge K Sorted Lists, Top K Frequent Elements, Find Median From Data Stream, Sliding Window Median, Connect Ropes Minimum Cost
Hash Tables: Hash Map, Hash Set, Hash Collision, Hash Function, Two Sum, Contains Duplicate, Valid Anagram, Group Anagrams, Isomorphic Strings, Happy Number
Dynamic Programming: DP Foundation, 0/1 Knapsack Problem, Fractional Knapsack, Rod Cutting, Longest Common Subsequence (LCS), Longest Increasing Subsequence (LIS), Matrix Chain Multiplication, Fibonacci, Coin Change, Edit Distance, Partition Equal Subset Sum
Greedy Algorithms: Activity Selection, Job Sequencing With Deadlines, Huffman Encoding, Prim Algorithm, Kruskal Algorithm, Fractional Knapsack, Jump Game, Gas Station, Candy, Meeting Rooms
Recursion: Recursion Foundation, Factorial, Fibonacci, Tower of Hanoi, Permutations, Combinations, Power Function, GCD Calculation, Backtracking Algorithms
Two Pointer Technique: Remove Duplicates, Container With Most Water, Two Sum II, Reverse String, Merge Sorted Array, Move Zeroes, Sort Colors, Partition List
Sliding Window: Longest Substring Without Repeating Characters, Sliding Window Maximum, Minimum Window Substring, Longest Substring With K Distinct Characters, Max Consecutive Ones, Permutation in String
String Algorithms: String Matching, Pattern Matching, Palindrome Check, KMP Algorithm, Z-Algorithm, Rabin-Karp Algorithm, Longest Palindromic Substring, Regular Expression Matching, Word Ladder
Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort, Counting Sort, Radix Sort, Bucket Sort, Shell Sort
Searching Algorithms: Linear Search, Binary Search, Ternary Search, Jump Search, Exponential Search, Interpolation Search, Fibonacci Search
Graph Traversal: BFS (Breadth-First Search), DFS (Depth-First Search), Topological Sorting, Cycle Detection, Strongly Connected Components, Bipartite Check, Graph Coloring
Shortest Path Algorithms: Dijkstra Algorithm, Bellman-Ford Algorithm, Floyd-Warshall Algorithm, BFS for Shortest Path, A* Algorithm, Johnson Algorithm
Minimum Spanning Tree: Prim Algorithm, Kruskal Algorithm, Borůvka Algorithm, Union Find Data Structure, Disjoint Set Union
Advanced Data Structures: Trie (Prefix Tree), Segment Tree, Fenwick Tree (Binary Indexed Tree), Suffix Array, Suffix Tree, Cartesian Tree, K-D Tree
LeetCode Easy Problems: Two Sum, Reverse String, Palindrome Number, Valid Parentheses, Merge Two Sorted Lists, Binary Tree Inorder Traversal, Majority Element, Best Time To Buy And Sell Stock, Happy Number
LeetCode Medium Problems: Container With Most Water, Longest Substring Without Repeating Characters, 3Sum, Merge Intervals, Group Anagrams, Kth Largest Element, Top K Frequent Elements, Course Schedule, Number of Islands
LeetCode Hard Problems: Merge K Sorted Lists, Median of Two Sorted Arrays, Trapping Rain Water, Minimum Window Substring, Skyline Problem, Word Ladder II, NQueens, Wildcard Matching, Largest Rectangle in Histogram
Algorithm Complexity: Time Complexity, Space Complexity, Big O Notation, Best Case, Worst Case, Average Case, Amortized Analysis
Interview Preparation: Coding Interview Tips, Problem-Solving Strategies, Time Management, Common Mistakes, Company Specific Problems