Coding Interview Patterns
Last updated
Was this helpful?
Last updated
Was this helpful?
Introduction
Pair with Target Sum (easy)
Remove Duplicates (easy)
Squaring a Sorted Array (easy)
Triplet Sum to Zero (medium)
Triplet Sum Close to Target (medium)
Triplets with Smaller Sum (medium)
Subarrays with Product Less than a Target (medium)
Dutch National Flag Problem (medium)
Problem Challenge 1: Quadruple Sum to Target (medium)
Problem Challenge 2: Comparing Strings containing Backspaces (medium)
Problem Challenge 3: Minimum Window Sort (medium)
Introduction
Maximum Sum Subarray of Size K (easy)
Introduction to Stack (Operations, Implementation, Applications)
Reverse a String
Decimal to Binary Conversion
Sorting a Stack
Introduction to Monotonic Stack
Introduction (Hashing, Hash Tables, Issues)
Introduction
Introduction
Introduction to Graph (Representations, Abstract Data Type (ADT))
Graph Traversal: Depth First Search(DFS)
Graph Traversal: Breadth First Search (BFS)
Introduction to Island Pattern
Biggest Island (easy)
Problem Challenge 1 (easy)
Problem Challenge 2 (medium)
Problem Challenge 3 (medium)
Introduction
String Permutations by changing case (medium)
Balanced Parentheses (hard)
Minimum Difference Element (medium): Find the floor & ceil take the difference, minimum would be the ans
Introduction
Single Number (easy)
Two Single Numbers (medium)
Complement of Base 10 Number (medium)
Problem Challenge 1: Flip and Invert an Image (hard)
Kth Smallest Number (easy)
Connect Ropes (easy)
Top 'K' Frequent Numbers (medium)
Frequency Sort (medium)
'K' Closest Numbers (medium)
Maximum Distinct Elements (medium)
Sum of Elements (medium)
Rearrange String (hard)
Problem Challenge 1: Rearrange String K Distance Apart (hard)
Problem Challenge 2: Scheduling Tasks (hard)
Problem Challenge 3: Frequency Stack (hard)
Introduction
Problem Challenge 1: K Pairs with Largest Sums (hard)
Introduction to Greedy Algorithm
Introduction
Problem Challenge 1: Count of Subset Sum (hard)
Problem Challenge 2: Target Sum (hard)
Introduction to Backtracking Pattern
Introduction to Trie
Introduction
Introduction to Union Find Pattern
Introduction to Ordered Set Pattern
Longest Continuous Subarray (medium)
Introduction to Multi-threaded Pattern
Same Tree (medium)
Invert Binary Tree (medium)
Binary Search Tree Iterator (medium)
Kth Smallest Number (hard)
Note: Problems marked with
*
are added as per my recommendations.
Introduction
LinkedList Cycle (easy)
Start of LinkedList Cycle (medium)
Happy Number (medium)
Middle of the LinkedList (easy)
Problem Challenge 1: Palindrome LinkedList (medium)
Problem Challenge 2: Rearrange a LinkedList (medium)
Problem Challenge 3: Cycle in a Circular Array (hard)
Smallest Subarray with a given sum (easy)
Longest Substring with K Distinct Characters (medium)
Fruits into Baskets (medium)
No-repeat Substring (hard)
Longest Substring with Same Letters after Replacement (hard)
Longest Subarray with Ones after Replacement (hard)
Problem Challenge 1: Permutation in a String (hard)
Problem Challenge 2: String Anagrams (hard)
Problem Challenge 3: Smallest Window containing Substring (hard)
Problem Challenge 4: Words Concatenation (hard)
Introduction
Merge Intervals (medium)
Insert Interval (medium)
Intervals Intersection (medium)
Conflicting Appointments (medium)
Problem Challenge 1: Minimum Meeting Rooms (hard)
Problem Challenge 2: Maximum CPU Load (hard)
Problem Challenge 3: Employee Free Time (hard)
Introduction
Cyclic Sort (easy)
Find the Missing Number (easy)
Find all Missing Numbers (easy)
Find the Duplicate Number (easy)
Find all Duplicate Numbers (easy)
Problem Challenge 1: Find the Corrupt Pair (easy)
Problem Challenge 2: Find the Smallest Missing Positive Number (medium)
Problem Challenge 3: Find the First K Missing Positive Numbers (hard)
Introduction
Reverse a LinkedList (easy)
Reverse a Sub-list (medium)
Reverse every K-element Sub-list (medium)
Problem Challenge 1: Reverse alternating K-element Sub-list (medium)
Problem Challenge 2: Rotate a LinkedList (medium)
Balanced Parentheses
Next Greater Element
Simplify Path
Next Greater Element (easy)
Daily Temperatures (easy)
Remove Nodes From Linked List (easy)
Remove All Adjacent Duplicates In String (easy)
Remove All Adjacent Duplicates in String II (medium)
Remove K Digits (hard)
First Non-repeating Character (easy)
Largest Unique Number (easy)
Maximum Number of Balloons (easy)
Longest Palindrome(easy)
Ransom Note (easy)
Binary Tree Level Order Traversal (easy)
Reverse Level Order Traversal (easy)
Zigzag Traversal (medium)
Level Averages in a Binary Tree (easy)
Minimum Depth of a Binary Tree (easy)
Maximum Depth of a Binary Tree (easy)
Level Order Successor (easy)
Connect Level Order Siblings (medium)
Problem Challenge 1: Connect All Level Order Siblings (medium)
Problem Challenge 2: Right View of a Binary Tree (easy)
Binary Tree Path Sum (easy)
All Paths for a Sum (medium)
Sum of Path Numbers (medium)
Path With Given Sequence (medium)
Count Paths for a Sum (medium)
Problem Challenge 1: Tree Diameter (medium)
Problem Challenge 2: Path with Maximum Sum (hard)
Find if Path Exists in Graph(easy)
Number of Provinces (medium)
Minimum Number of Vertices to Reach All Nodes(medium)
Number of Islands (easy)
Flood Fill (easy)
Number of Closed Islands (easy)
Find the Median of a Number Stream (medium)
Sliding Window Median (hard)
Maximize Capital (hard)
*Maximum Sum Combinations (medium)
Introduction
Subsets (easy)
Subsets With Duplicates (easy)
Permutations (medium)
Unique Generalized Abbreviations (hard)
Introduction
Order-agnostic Binary Search (easy)
Ceiling of a Number (medium)
Next Letter (medium)
Number Range (medium)
Search in a Sorted Infinite Array (medium)
Bitonic Array Maximum (easy)
Problem Challenge 1: Search Bitonic Array (medium)
Problem Challenge 2: Search in Rotated Array (medium)
Problem Challenge 3: Rotation Count (medium)
*Search a 2D Matrix (medium)
*Minimum Number of Days to Make m Bouquets (medium)
*Koko Eating Bananas (medium)
*Capacity To Ship Packages Within D Days (medium)
*Median of Two Sorted Arrays (hard)
Top 'K' Numbers (easy)
'K' Closest Points to the Origin (easy)
Kth Largest Number in a Stream (medium)
*
Merge K Sorted Lists (medium)
Kth Smallest Number in M Sorted Lists (Medium)
Kth Smallest Number in a Sorted Matrix (Hard)
Smallest Number Range (Hard)
Valid Palindrome II (easy)
Maximum Length of Pair Chain (medium)
Minimum Add to Make Parentheses Valid (medium)
Remove Duplicate Letters (medium)
Largest Palindromic Number (Medium)
Removing Minimum and Maximum From Array (medium)
0/1 Knapsack (medium)
Equal Subset Sum Partition (medium)
Subset Sum (medium)
Minimum Subset Sum Difference (hard)
Combination Sum (medium)
Word Search (medium)
Sudoku Solver (hard)
Factor Combinations (medium)
Split a String Into the Max Number of Unique Substrings (medium)
Implement Trie (Prefix Tree) (medium)
Index Pairs of a String (easy)
Design Add and Search Words Data Structure (medium)
Extra Characters in a String (medium)
Search Suggestions System (medium)
Topological Sort (medium)
Tasks Scheduling (medium)
Tasks Scheduling Order (medium)
All Tasks Scheduling Orders (hard)
Alien Dictionary (hard)
Problem Challenge 1: Reconstructing a Sequence (hard)
Problem Challenge 2: Minimum Height Trees (hard)
Redundant Connection (medium)
Number of Provinces (medium)
Is Graph Bipartite? (medium)
Path With Minimum Effort (medium)
Merge Similar Items (easy)
132 Pattern (medium)
My Calendar I (medium)