Mastering Leet Code Algorithms - Learning Roadmap | Nemorize

✅ Foundation: Arrays & Strings

• ✅ Two Pointer Techniques
  • ⚪ Palindrome Validation
  • ⚪ Container With Most Water
  • ⚪ Remove Duplicates
• ✅ Sliding Window Patterns
  • ⚪ Maximum Subarray Sum
  • ⚪ Longest Substring Without Repeats
  • ⚪ Minimum Window Substring
• ✅ Hash Maps & Sets
  • ⚪ Two Sum Variations
  • ⚪ Group Anagrams

✅ Advanced Recursion & Backtracking

• ✅ Permutations & Combinations
  • ✅ String Permutations
  • ⚪ Subsets and Power Sets
  • ⚪ Letter Combinations
• ⚪ Constraint Satisfaction
  • ⚪ N-Queens Problem
  • ⚪ Sudoku Solver
  • ⚪ Word Search in Grid

✅ Dynamic Programming Mastery

• ✅ 1D DP Problems
  • ⚪ Climbing Stairs
  • ⚪ House Robber Series
  • ⚪ Longest Increasing Subsequence
• ✅ 2D DP & Grid Problems
  • ⚪ Unique Paths
  • ⚪ Edit Distance
  • ⚪ Longest Common Subsequence

✅ Graph Algorithms & Search

• ⚪ Graph Traversal
  • ⚪ Number of Islands
  • ⚪ Clone Graph
  • ⚪ Course Schedule
• ✅ Shortest Path Algorithms
  • ⚪ Network Delay Time
  • ⚪ Word Ladder

✅ Trees & Advanced Structures

• ✅ Binary Tree Patterns
  • ⚪ Maximum Depth
  • ⚪ Validate BST
  • ⚪ Lowest Common Ancestor
• ✅ Heaps & Priority Queues
  • ⚪ Kth Largest Element
  • ⚪ Merge K Sorted Lists
  • ⚪ Top K Frequent Elements