Several Coding Patterns for Solving Data Structures and Algorithms Problems during Interviews

These are my JavaScript notes from a course that categorizes coding interview problems into a set of 16 patterns.


Pattern 1: Sliding Window	Pattern 9: Two Heaps
Pattern 2: Two Pointer	Pattern 10: Subsets
Pattern 3: Fast & Slow pointers	Pattern 11: Modified Binary Search
Pattern 4: Merge Intervals	Pattern 12: Bitwise XOR
Pattern 5: Cyclic Sort	Pattern 13: Top 'K' Elements
Pattern 6: In-place Reversal of a LinkedList	Pattern 14: K-way merge
Pattern 7: Tree Breadth First Search	Pattern 15: 0/1 Knapsack (Dynamic Programming)
Pattern 8: Depth First Search (DFS)	Pattern 16: Topological Sort (Graph)

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
images		images
Pattern 13: Top 'K' Elements.md		Pattern 13: Top 'K' Elements.md
Pattern 14: K-way merge.md		Pattern 14: K-way merge.md
README.md		README.md
✅ Pattern 01 : Sliding Window.md		✅ Pattern 01 : Sliding Window.md
✅ Pattern 02: Two Pointers.md		✅ Pattern 02: Two Pointers.md
✅ Pattern 03: Fast & Slow pointers.md		✅ Pattern 03: Fast & Slow pointers.md
✅ Pattern 04 : Merge Intervals.md		✅ Pattern 04 : Merge Intervals.md
✅ Pattern 05: Cyclic Sort.md		✅ Pattern 05: Cyclic Sort.md
✅ Pattern 06: In-place Reversal of a LinkedList.md		✅ Pattern 06: In-place Reversal of a LinkedList.md
✅ Pattern 07: Tree Breadth First Search.md		✅ Pattern 07: Tree Breadth First Search.md
✅ Pattern 08:Tree Depth First Search.md		✅ Pattern 08:Tree Depth First Search.md
✅ Pattern 10: Subsets.md		✅ Pattern 10: Subsets.md
✅ Pattern 11: Modified Binary Search.md		✅ Pattern 11: Modified Binary Search.md
✅ Pattern 12: Bitwise XOR.md		✅ Pattern 12: Bitwise XOR.md
✅ Pattern 15: 0-1 Knapsack (Dynamic Programming).md		✅ Pattern 15: 0-1 Knapsack (Dynamic Programming).md
✅ Pattern 16: 🔍 Topological Sort (Graph).md		✅ Pattern 16: 🔍 Topological Sort (Graph).md
✅ 🙃 Pattern 09: Two Heaps.md		✅ 🙃 Pattern 09: Two Heaps.md

Provide feedback