• Patterns
  • Sliding Window
  • Two Pointer
    • Container with most water
    • Three Way Partioning
    • [ ]
  • Fast & Slow Pointers
  • Merge Intervals
    • Interview Scheduling
  • Cyclic Sort
  • In-place Reversal of a LinkedList
  • Tree BFS
  • Tree DFS
  • Two Heaps
  • Subsets
  • Modified Binary Search
  • Bitwise XOR
  • Top 'K' Elements
  • K-Way Merge
  • 0-1 Knapsack
  • Unbounded Knapsack
  • Fibonacci Numbers
  • Palindromic Subsequence
  • LCS
  • Topological Sort
  • Trie Traversal
  • Number of Island
  • Trial & Error (Backtracking)
  • Union Find
  • Unique Paths

TODO:

1. add note for each
2. with some examples from leetcode and intuitive examples

Flowchart

Reference: https://miro.com/app/live-embed/uXjVJ0O82Bs=/?embedMode=view_only_without_ui&moveToViewport=-1432%2C-402%2C1707%2C2282&embedId=298739679746

References

• https://interviewnoodle.com/grokking-leetcode-a-smarter-way-to-prepare-for-coding-interviews-e86d5c9fe4e1
• https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed
• https://medium.com/gitconnected/dont-just-leetcode-follow-the-coding-patterns-instead-4beb6a197fdb