
Coding Patterns



21 Coding Patterns to Master Tech Interviews 🔥Coding patterns improve our:"ability to connect a new problem to an existing one"
"ability to connect a new problem to an existing one"

0/125
0%
0%
1. Two Pointers
0/8
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
2 Sum | easy | ![]() | ||
Merge 2 sorted List | easy | ![]() | ||
Squares of a Sorted Array | easy | ![]() | ||
3 Sum | medium | ![]() | ||
Dutch National Flag or Sort Colors | medium | ![]() | ||
Container With Most Water | medium | ![]() | ||
Minimum window Sort | medium | ![]() | ||
Trapping Rain Water | hard | ![]() |
2. Sliding Window
0/6
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Minimum Size Subarray Sum | medium | ![]() | ||
Permutation in String | medium | ![]() | ||
Longest Substring Without Repeating Characters | medium | ![]() | ||
Fruit Into Baskets | medium | ![]() | ||
Minimum Window Substring | hard | ![]() | ||
Sliding Window Maximum | hard | Coming Soon | Coming Soon |
3. Fast and Slow Pointers
0/8
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Happy Number | easy | Coming Soon | Coming Soon | |
Linked List Cycle | easy | Coming Soon | Coming Soon | |
Middle of the Linked List | easy | Coming Soon | Coming Soon | |
Palindrome Linked List | easy | Coming Soon | Coming Soon | |
Circular Array Loop | medium | Coming Soon | Coming Soon | |
Add Two Numbers | medium | Coming Soon | Coming Soon | |
Remove Nth Node From End of List | medium | Coming Soon | Coming Soon | |
Reorder List | medium | Coming Soon | Coming Soon |
4. Intervals
0/6
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Meeting Rooms | easy | Coming Soon | Coming Soon | |
Meeting Rooms II | medium | Coming Soon | Coming Soon | |
Merge Intervals | medium | Coming Soon | Coming Soon | |
Interval List Intersections | medium | Coming Soon | Coming Soon | |
Non-overlapping Intervals | medium | Coming Soon | Coming Soon | |
Insert Interval | medium | Coming Soon | Coming Soon |
5. Greedy & Geometry
0/8
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Product of Array Except Self | medium | Coming Soon | Coming Soon | |
Set Matrix Zeroes | medium | Coming Soon | Coming Soon | |
Spiral Matrix | medium | Coming Soon | Coming Soon | |
Rotate Image | medium | Coming Soon | Coming Soon | |
Maximum Subarray Sum | medium | Coming Soon | Coming Soon | |
Jump Game | medium | Coming Soon | Coming Soon | |
Jump Game II | medium | Coming Soon | Coming Soon | |
Gas Station | medium | Coming Soon | Coming Soon |
6. Cyclic Sort
0/6
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Missing Number | easy | Coming Soon | Coming Soon | |
Set Mismatch | easy | Coming Soon | Coming Soon | |
Contains Duplicate | easy | Coming Soon | Coming Soon | |
Find All Duplicates in an Array | medium | Coming Soon | Coming Soon | |
Find All Numbers Disappeared in an Array | medium | Coming Soon | Coming Soon | |
First Missing Positive | hard | Coming Soon | Coming Soon |
7. Binary Search
0/8
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Binary Search | easy | Coming Soon | Coming Soon | |
Find Minimum in Rotated Sorted Array | medium | Coming Soon | Coming Soon | |
Find Peak Element | medium | Coming Soon | Coming Soon | |
Search in Rotated Sorted Array | medium | Coming Soon | Coming Soon | |
Search a 2D Matrix | medium | Coming Soon | Coming Soon | |
Search a 2D Matrix II | medium | Coming Soon | Coming Soon | |
Find K Closest Elements | medium | Coming Soon | Coming Soon | |
Median of Two Sorted Arrays | hard | Coming Soon | Coming Soon |
8. In-place Reversal of a Linked List
0/3
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Reverse Linked List | easy | Coming Soon | Coming Soon | |
Reverse Linked List II | medium | Coming Soon | Coming Soon | |
Reverse Nodes in k-Group | hard | Coming Soon | Coming Soon |
9. Backtracking
0/9
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Subsets | medium | Coming Soon | Coming Soon | |
Subsets II | medium | Coming Soon | Coming Soon | |
Permutations | medium | Coming Soon | Coming Soon | |
Combination Sum | medium | Coming Soon | Coming Soon | |
Combination Sum II | medium | Coming Soon | Coming Soon | |
Generate Parentheses | medium | Coming Soon | Coming Soon | |
Letter Combinations of a Phone Number | medium | Coming Soon | Coming Soon | |
Sudoku Solver | hard | Coming Soon | Coming Soon | |
N-Queens Problem | hard | Coming Soon | Coming Soon |
10. BFS
0/10
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Average of Levels | easy | Coming Soon | Coming Soon | |
Binary Tree Level Order Traversal | medium | Coming Soon | Coming Soon | |
Binary Tree Zigzag Level Order Traversal | medium | Coming Soon | Coming Soon | |
Binary Tree Level Order Traversal II | medium | Coming Soon | Coming Soon | |
Minimum Depth of Binary Tree | medium | Coming Soon | Coming Soon | |
Rotting Oranges | medium | Coming Soon | Coming Soon | |
Populating Next Right Pointers in Each Node | medium | Coming Soon | Coming Soon | |
Binary Tree Right Side View | medium | Coming Soon | Coming Soon | |
All Nodes Distance K in Binary Tree | medium | Coming Soon | Coming Soon | |
Minimum Knight Moves | hard | Coming Soon | Coming Soon |
11. DFS
0/13
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Path Sum | easy | Coming Soon | Coming Soon | |
Balanced Binary Tree | easy | Coming Soon | Coming Soon | |
Maximum Depth of Binary Tree | easy | Coming Soon | Coming Soon | |
Invert Binary Tree | easy | Coming Soon | Coming Soon | |
Path Sum II | medium | Coming Soon | Coming Soon | |
Path Sum III | medium | Coming Soon | Coming Soon | |
Number of Islands | medium | Coming Soon | Coming Soon | |
Kth Smallest Element in a BST | medium | Coming Soon | Coming Soon | |
Lowest Common Ancestor of a Binary Search Tree | medium | Coming Soon | Coming Soon | |
Lowest Common Ancestor of a Binary Tree | medium | Coming Soon | Coming Soon | |
Validate Binary Search Tree | medium | Coming Soon | Coming Soon | |
Word Search I | medium | Coming Soon | Coming Soon | |
Binary Tree Maximum Path Sum | hard | Coming Soon | Coming Soon |
12. Two Heaps
0/3
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Find Right Interval | medium | Coming Soon | Coming Soon | |
Find Median from Data Stream | hard | Coming Soon | Coming Soon | |
Sliding Window Median | hard | Coming Soon | Coming Soon |
13. Top K Numbers
0/3
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Kth Largest Element in an Array | medium | Coming Soon | Coming Soon | |
K Closest Points to Origin | medium | Coming Soon | Coming Soon | |
Top K Frequent Elements | medium | Coming Soon | Coming Soon |
14. K-way Merge
0/3
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Kth Smallest Element in a Sorted Matrix | medium | Coming Soon | Coming Soon | |
Merge k Sorted Lists | hard | Coming Soon | Coming Soon | |
Median of Two Sorted Arrays | hard | Coming Soon | Coming Soon |
15. Topological Sort
0/4
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Course Schedule | medium | Coming Soon | Coming Soon | |
Course Schedule II | medium | Coming Soon | Coming Soon | |
Minimum Height Trees | medium | Coming Soon | Coming Soon | |
Alien Dictionary | hard | Coming Soon | Coming Soon |
16. DP: 0/1 Knapsack
0/5
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
0-1 Knapsack Problem | medium | Coming Soon | Coming Soon | |
Partition Equal Subset Sum | medium | Coming Soon | Coming Soon | |
Ones and Zeroes | medium | Coming Soon | Coming Soon | |
Target Sum | medium | Coming Soon | Coming Soon | |
Minimum Sum Partition | hard | Coming Soon | Coming Soon |
17. DP: Unbounded Knapsack
0/2
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Coin Change | medium | Coming Soon | Coming Soon | |
Coin Change II | medium | Coming Soon | Coming Soon |
18. DP: Staircase
0/7
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Climbing Stairs | easy | Coming Soon | Coming Soon | |
Min Cost Climbing Stairs | easy | Coming Soon | Coming Soon | |
Fibonacci Number | easy | Coming Soon | Coming Soon | |
House Robber | medium | Coming Soon | Coming Soon | |
Unique Paths | medium | Coming Soon | Coming Soon | |
Decode Ways | medium | Coming Soon | Coming Soon | |
Number of Dice Rolls With Target Sum | medium | Coming Soon | Coming Soon |
19. DP: Palindromic Substring/Subsequence
0/5
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Longest Palindromic Subsequence | medium | Coming Soon | Coming Soon | |
Longest Palindromic Substring | medium | Coming Soon | Coming Soon | |
Palindrome Partitioning | medium | Coming Soon | Coming Soon | |
Palindromic Substrings | medium | Coming Soon | Coming Soon | |
Minimum deletions to make a string palindrome | medium | Coming Soon | Coming Soon |
20. DP: Longest Common Substring/Subsequence
0/5
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Longest Common Subsequence | medium | Coming Soon | Coming Soon | |
Longest Increasing Subsequence | medium | Coming Soon | Coming Soon | |
Maximum sum increasing subsequence | medium | Coming Soon | Coming Soon | |
Edit Distance | hard | Coming Soon | Coming Soon | |
Interleaving String | hard | Coming Soon | Coming Soon |
21. Tries
0/3
0%
Solved | Problem | Difficulty | Video Solution | Code |
---|---|---|---|---|
Implement Trie (Prefix Tree) | medium | Coming Soon | Coming Soon | |
Search Query Auto complete | hard | Coming Soon | Coming Soon | |
Word Search II | hard | Coming Soon | Coming Soon |
Designed with ❤️ by Saurav Gupta