Introduction
This comprehensive guide contains 500 curated LeetCode problems organized for efficient interview preparation. Each problem includes:
- β Interactive checkboxes for progress tracking
- π₯ Priority markers for must-solve problems
- π’π‘π΄ Difficulty indicators (Easy/Medium/Hard)
- Pattern tags for systematic learning
Study Recommendations
Beginner Path (3-4 months):
- Start with Easy problems in Array & Hash Table
- Master Two Pointers and Sliding Window patterns
- Build foundation with Trees and Linked Lists
- Practice 2-3 problems daily
Intermediate Path (2-3 months):
- Focus on Medium difficulty across all patterns
- Deep dive into Dynamic Programming
- Master Graph algorithms (DFS/BFS)
- Solve 3-4 problems daily
Advanced Path (1-2 months):
- Tackle Hard problems and system design
- Practice under timed conditions
- Review company-specific patterns
- Aim for 4-5 problems daily
Table of Contents
Problems by Number
Pattern-Based Study Guide
- Array & Hashing
- Two Pointers
- Sliding Window
- Binary Search
- Linked List
- Trees
- Heap / Priority Queue
- Backtracking
- Dynamic Programming
- Graph Algorithms
- Advanced Patterns
Problems List
1β50
- Two Sum - Medium π‘ π₯
Two Pointers - Add Two Numbers - Medium π‘
Two Pointers - Longest Substring Without Repeating Characters - Medium π‘
Array - Median Of Two Sorted Arrays - Medium π‘
Two Pointers - Longest Palindromic Substring - Medium π‘
Array - Zigzag Conversion - Medium π‘
Array - Reverse Integer - Medium π‘
Array - String To Integer atoi - Medium π‘
Array - Palindrome Number - Medium π‘
Array - Regular Expression Matching - Medium π‘
Array - Container With Most Water - Medium π‘ π₯
Array - Integer To Roman - Medium π‘
Array - Roman To Integer - Medium π‘
Array - Longest Common Prefix - Medium π‘
Array - 3sum - Medium π‘ π₯
Array - 3sum Closest - Medium π‘
Array - Letter Combinations Of A Phone Number - Medium π‘
Backtracking - 4sum - Medium π‘
Array - Remove Nth Node From End Of List - Medium π‘
Linked List - Valid Parentheses - Medium π‘ π₯
Array - Merge Two Sorted Lists - Medium π‘
Linked ListTwo Pointers - Generate Parentheses - Medium π‘
Array - Merge K Sorted Lists - Medium π‘ π₯
Linked List - Swap Nodes In Pairs - Medium π‘
Array - Reverse Nodes In K Group - Medium π‘
Array - Remove Duplicates From Sorted Array - Medium π‘
Array - Remove Element - Medium π‘
Array - Find The Index Of The First Occurrence In A String - Medium π‘
Array - Divide Two Integers - Medium π‘
Two Pointers - Substring With Concatenation Of All Words - Medium π‘
Array - Next Permutation - Medium π‘
Backtracking - Longest Valid Parentheses - Medium π‘
Array - Search In Rotated Sorted Array - Medium π‘ π₯
Binary Search - Find First And Last Position Of Element In Sorted Array - Medium π‘
Array - Search Insert Position - Medium π‘
Binary Search - Valid Sudoku - Medium π‘
Array - Sudoku Solver - Medium π‘
Array - Count And Say - Medium π‘
Array - Combination Sum - Medium π‘ π₯
Backtracking - Combination Sum II - Medium π‘
Backtracking - First Missing Positive - Medium π‘
Array - Trapping Rain Water - Medium π‘ π₯
Array - Multiply Strings - Medium π‘
Array - Wildcard Matching - Medium π‘
Array - Jump Game II - Medium π‘
Array - Permutations - Medium π‘ π₯
Backtracking - Permutations II - Medium π‘
Backtracking - Rotate Image - Medium π‘
Array - Group Anagrams - Medium π‘ π₯
Array - Powx N - Medium π‘
Array
51β100
- Maximum Subarray - Medium π‘ π₯
Array - Spiral Matrix - Medium π‘
Array - Jump Game - Medium π‘ π₯
Array - Merge Intervals - Medium π‘ π₯
Array - Insert Interval - Medium π‘
Array - Length Of Last Word - Medium π‘
Array - Spiral Matrix II - Medium π‘
Array - Unique Paths - Medium π‘ π₯
DP - Unique Paths II - Medium π‘
DP - Minimum Path Sum - Medium π‘
DP - Climbing Stairs - Medium π‘ π₯
DP - Edit Distance - Medium π‘ π₯
DP - Set Matrix Zeroes - Medium π‘
Array - Search A 2D Matrix - Medium π‘
Binary Search - Sort Colors - Medium π‘
Array - Minimum Window Substring - Medium π‘ π₯
Sliding Window - Combinations - Medium π‘
Backtracking - Subsets - Medium π‘
Array - Word Search - Medium π‘ π₯
Binary Search - Largest Rectangle In Histogram - Medium π‘ π₯
Array - Maximal Rectangle - Medium π‘
Array - Partition List - Medium π‘
Linked List - Scramble String - Medium π‘
Array - Merge Sorted Array - Medium π‘
Array - Gray Code - Medium π‘
Array - Subsets II - Medium π‘
Array - Decode Ways - Medium π‘
Array - Validate Binary Search Tree - Medium π‘ π₯
Tree - Recover Binary Search Tree - Medium π‘
Tree - Same Tree - Medium π‘
Tree - Symmetric Tree - Medium π‘
Tree - Binary Tree Level Order Traversal - Medium π‘ π₯
Tree - Binary Tree Zigzag Level Order Traversal - Medium π‘
Tree - Maximum Depth Of Binary Tree - Medium π‘ π₯
Tree - Construct Binary Tree From Preorder And Inorder Traversal - Medium π‘
Tree - Construct Binary Tree From Inorder And Postorder Traversal - Medium π‘
Tree - Flatten Binary Tree To Linked List - Medium π‘
TreeLinked List - Path Sum - Medium π‘
DP - Path Sum II - Medium π‘
DP - Populating Next Right Pointers In Each Node - Medium π‘
Two Pointers - Sum Root To Leaf Numbers - Medium π‘
Array - Longest Consecutive Sequence - Medium π‘ π₯
Array - Surrounded Regions - Medium π‘
Array - Palindrome Partitioning - Medium π‘
Array - Copy List With Random Pointer - Medium π‘
Linked ListTwo Pointers - Word Break - Medium π‘ π₯
Array - Linked List Cycle - Medium π‘ π₯
Linked List - Linked List Cycle II - Medium π‘
Linked List - Reorder List - Medium π‘
Linked List - Binary Tree Maximum Path Sum - Medium π‘ π₯
TreeDP
101β150
- Symmetric Tree - Easy π’
Tree - Binary Tree Level Order Traversal - Medium π‘ π₯
Tree - Binary Tree Zigzag Level Order Traversal - Medium π‘
Tree - Maximum Depth of Binary Tree - Easy π’ π₯
Tree - Construct Binary Tree from Preorder and Inorder Traversal - Medium π‘ π₯
Tree - Construct Binary Tree from Inorder and Postorder Traversal - Medium π‘
Tree - Binary Tree Level Order Traversal II - Medium π‘
Tree - Convert Sorted Array to Binary Search Tree - Easy π’
Tree - Convert Sorted List to Binary Search Tree - Medium π‘
TreeLinked List - Balanced Binary Tree - Easy π’
Tree - Minimum Depth of Binary Tree - Easy π’
Tree - Path Sum - Easy π’
Tree - Path Sum II - Medium π‘
Tree - Flatten Binary Tree to Linked List - Medium π‘ π₯
Tree - Distinct Subsequences - Hard π΄
DPString - Populating Next Right Pointers in Each Node - Medium π‘ π₯
Tree - Populating Next Right Pointers in Each Node II - Medium π‘
Tree - Pascal’s Triangle - Easy π’
Array - Pascal’s Triangle II - Easy π’
Array - Triangle - Medium π‘
DP - Best Time to Buy and Sell Stock - Easy π’ π₯
ArrayDP - Best Time to Buy and Sell Stock II - Medium π‘
Array - Best Time to Buy and Sell Stock III - Hard π΄
DP - Binary Tree Maximum Path Sum - Hard π΄ π₯
TreeDP - Valid Palindrome - Easy π’
Two Pointers - Word Ladder II - Hard π΄
GraphBFS - Word Ladder - Hard π΄ π₯
GraphBFS - Longest Consecutive Sequence - Medium π‘ π₯
Hash Table - Sum Root to Leaf Numbers - Medium π‘
Tree - Surrounded Regions - Medium π‘ π₯
GraphDFS - Palindrome Partitioning - Medium π‘
Backtracking - Palindrome Partitioning II - Hard π΄
DP - Clone Graph - Medium π‘ π₯
Graph - Gas Station - Medium π‘
Greedy - Candy - Hard π΄
Greedy - Single Number - Easy π’ π₯
Bit Manipulation - Single Number II - Medium π‘
Bit Manipulation - Copy List with Random Pointer - Medium π‘ π₯
Linked List - Word Break - Medium π‘ π₯
DPString - Word Break II - Hard π΄
DPBacktracking - Linked List Cycle - Easy π’ π₯
Linked List - Linked List Cycle II - Medium π‘ π₯
Linked List - Reorder List - Medium π‘ π₯
Linked List - LRU Cache - Medium π‘ π₯
DesignHash Table - Binary Tree Postorder Traversal - Easy π’
Tree - Binary Tree Preorder Traversal - Easy π’
Tree - Insertion Sort List - Medium π‘
Linked List - Sort List - Medium π‘ π₯
Linked List - Max Points on a Line - Hard π΄
Math - Evaluate Reverse Polish Notation - Medium π‘ π₯
Stack
151β200
- Find Minimum In Rotated Sorted Array - Medium π‘
Array - Find Minimum In Rotated Sorted Array II - Medium π‘
Array - Minimum Size Subarray Sum - Medium π‘
Array - Compare Version Numbers - Medium π‘
Array - Excel Sheet Column Title - Medium π‘
Array - Excel Sheet Column Number - Medium π‘
Array - Factorial Trailing Zeroes - Medium π‘
Array - Binary Search Tree Iterator - Medium π‘
Tree - Majority Element - Medium π‘
Array - Majority Element II - Medium π‘
Array - Reverse Bits - Medium π‘
Array - Number Of 1 Bits - Medium π‘
Array - Happy Number - Medium π‘
Array - Remove Linked List Elements - Medium π‘
Linked List - Isomorphic Strings - Medium π‘
Array - Count Primes - Medium π‘
Array - House Robber - Medium π‘
Array - House Robber II - Medium π‘
Array - Rotate Array - Medium π‘
Array - Reverse Linked List - Medium π‘ π₯
Linked List - Course Schedule - Medium π‘ π₯
Graph - Course Schedule II - Medium π‘
Graph - Implement Trie Prefix Tree - Medium π‘
TreeTrie - Add And Search Word Data Structure Design - Medium π‘
Binary Search - Word Search II - Medium π‘
Binary Search - Summary Ranges - Medium π‘
Array - Number Of Islands - Medium π‘ π₯
Graph - Bitwise And Of Numbers Range - Medium π‘
Array - Power Of Two - Medium π‘
Two Pointers - Implement Queue Using Stacks - Medium π‘
Stack - Implement Stack Using Queues - Medium π‘
Stack - Invert Binary Tree - Medium π‘ π₯
Tree - Kth Smallest Element In A BST - Medium π‘
Array - Lowest Common Ancestor Of A Binary Search Tree - Medium π‘
Tree - Lowest Common Ancestor Of A Binary Tree - Medium π‘
Tree - Product Of Array Except Self - Medium π‘ π₯
Array - Sliding Window Maximum - Medium π‘ π₯
Sliding Window - Search A 2D Matrix II - Medium π‘
Binary Search - Different Ways To Add Parentheses - Medium π‘
Array - Valid Anagram - Medium π‘
Array - Shortest Word Distance - Medium π‘
Array - Meeting Rooms - Medium π‘
Array - Meeting Rooms II - Medium π‘
Array - Factor Combinations - Medium π‘
Backtracking - Flatten 2D Vector - Medium π‘
Array - Move Zeroes - Medium π‘
Array - Peeking Iterator - Medium π‘
Array - Maximum Product Subarray - Medium π‘
Array - Search A 2D Matrix - Medium π‘
Binary Search - Count Complete Tree Nodes - Medium π‘
Tree
201β250
- Bitwise And Of Numbers Range - Medium π‘
Array - Happy Number - Medium π‘
Array - Remove Linked List Elements - Medium π‘
Linked List - Count Primes - Medium π‘
Array - Isomorphic Strings - Medium π‘
Array - Reverse Linked List - Medium π‘ π₯
Linked List - Course Schedule - Medium π‘ π₯
Graph - Implement Trie Prefix Tree - Medium π‘
TreeTrie - Minimum Size Subarray Sum - Medium π‘
Array - Course Schedule II - Medium π‘
Graph - Add And Search Word Data Structure Design - Medium π‘
Binary Search - Word Search II - Medium π‘
Binary Search - House Robber II - Medium π‘
Array - Shortest Palindrome - Medium π‘
Array - Kth Largest Element In An Array - Medium π‘
Array - Combination Sum III - Medium π‘
Backtracking - Contains Duplicate - Medium π‘
Array - The Skyline Problem - Medium π‘
Array - Contains Duplicate II - Medium π‘
Array - Contains Duplicate III - Medium π‘
Array - Maximal Square - Medium π‘
Array - Count Complete Tree Nodes - Medium π‘
Tree - Rectangle Area - Medium π‘
Array - Basic Calculator - Medium π‘
Array - Implement Stack Using Queues - Medium π‘
Stack - Invert Binary Tree - Medium π‘ π₯
Tree - Basic Calculator II - Medium π‘
Array - Summary Ranges - Medium π‘
Array - Majority Element II - Medium π‘
Array - Kth Smallest Element In A BST - Medium π‘
Array - Power Of Two - Medium π‘
Two Pointers - Implement Queue Using Stacks - Medium π‘
Stack - Number Of Digit One - Medium π‘
Array - Palindrome Linked List - Medium π‘
Linked List - Lowest Common Ancestor Of A Binary Search Tree - Medium π‘
Tree - Lowest Common Ancestor Of A Binary Tree - Medium π‘
Tree - Delete Node In A Linked List - Medium π‘
Linked List - Product Of Array Except Self - Medium π‘ π₯
Array - Sliding Window Maximum - Medium π‘ π₯
Sliding Window - Search A 2D Matrix II - Medium π‘
Binary Search - Different Ways To Add Parentheses - Medium π‘
Array - Valid Anagram - Medium π‘
Array - Shortest Word Distance - Medium π‘
Array - Shortest Word Distance II - Medium π‘
Array - Shortest Word Distance III - Medium π‘
Array - Strobogrammatic Number - Medium π‘
Array - Strobogrammatic Number II - Medium π‘
Array - Strobogrammatic Number III - Medium π‘
Array - Group Shifted Strings - Medium π‘
Array - Count Univalue Subtrees - Medium π‘
Tree
251β300
- Flatten 2D Vector - Medium π‘
Array - Meeting Rooms - Medium π‘
Array - Meeting Rooms II - Medium π‘
Array - Factor Combinations - Medium π‘
Backtracking - Verify Preorder Sequence In Binary Search Tree - Medium π‘
Tree - Paint House - Medium π‘
Array - Binary Tree Paths - Medium π‘
TreeDP - Add Digits - Medium π‘
Array - 3sum Smaller - Medium π‘
Array - Single Number III - Medium π‘
Array - Graph Valid Tree - Medium π‘
TreeGraph - Trips And Users - Medium π‘
Array - Ugly Number - Medium π‘
Array - Ugly Number II - Medium π‘
Array - Paint House II - Medium π‘
Array - Palindrome Permutation - Medium π‘
Backtracking - Palindrome Permutation II - Medium π‘
Backtracking - Missing Number - Medium π‘
Array - Alien Dictionary - Medium π‘
Array - Closest Binary Search Tree Value - Medium π‘
Tree - Encode And Decode Strings - Medium π‘
Array - Closest Binary Search Tree Value II - Medium π‘
Tree - Integer To English Words - Medium π‘
Array - H Index - Medium π‘
Array - H Index II - Medium π‘
Array - Paint Fence - Medium π‘
Array - Find The Celebrity - Medium π‘
Array - First Bad Version - Medium π‘
Array - Perfect Squares - Medium π‘
Array - Wiggle Sort - Medium π‘
Array - Zigzag Iterator - Medium π‘
Array - Expression Add Operators - Medium π‘
Array - Move Zeroes - Medium π‘
Array - Peeking Iterator - Medium π‘
Array - Inorder Successor In BST - Medium π‘
Array - Walls And Gates - Medium π‘
Array - Find The Duplicate Number - Medium π‘
Array - Unique Word Abbreviation - Medium π‘
Array - Game Of Life - Medium π‘
Array - Word Pattern - Medium π‘
Array - Word Pattern II - Medium π‘
Array - Nim Game - Medium π‘
Array - Flip Game - Medium π‘
Array - Flip Game II - Medium π‘
Array - Find Median From Data Stream - Medium π‘
Array - Best Meeting Point - Medium π‘
Array - Serialize And Deserialize Binary Tree - Medium π‘ π₯
Tree - Binary Tree Longest Consecutive Sequence - Medium π‘
Tree - Bulls And Cows - Medium π‘
Array - Longest Increasing Subsequence - Medium π‘
Array
301β350
- Remove Invalid Parentheses - Medium π‘
Array - Smallest Rectangle Enclosing Black Pixels - Medium π‘
Array - Range Sum Query Immutable - Medium π‘
Array - Range Sum Query 2D Immutable - Medium π‘
Array - Number Of Islands II - Medium π‘
Graph - Additive Number - Medium π‘
Array - Range Sum Query Mutable - Medium π‘
Array - Range Sum Query 2D Mutable - Medium π‘
Array - Best Time To Buy And Sell Stock With Cooldown - Medium π‘
Array - Minimum Height Trees - Medium π‘
Tree - Sparse Matrix Multiplication - Medium π‘
Array - Burst Balloons - Medium π‘
Array - Super Ugly Number - Medium π‘
Array - Binary Tree Vertical Order Traversal - Medium π‘
Tree - Count Of Smaller Numbers After Self - Medium π‘
Array - Remove Duplicate Letters - Medium π‘
Array - Shortest Distance From All Buildings - Medium π‘
Array - Maximum Product Of Word Lengths - Medium π‘
Array - Bulb Switcher - Medium π‘
Array - Generalized Abbreviation - Medium π‘
Array - Create Maximum Number - Medium π‘
Array - Coin Change - Medium π‘
Array - Number Of Connected Components In An Undirected Graph - Medium π‘
Graph - Wiggle Sort II - Medium π‘
Array - Maximum Size Subarray Sum Equals K - Medium π‘
Array - Power Of Three - Medium π‘
Array - Count Of Range Sum - Medium π‘
Array - Odd Even Linked List - Medium π‘
Linked List - Longest Increasing Path In A Matrix - Medium π‘
DP - Patching Array - Medium π‘
Array - Verify Preorder Serialization Of A Binary Tree - Medium π‘
Tree - Reconstruct Itinerary - Medium π‘
Array - Largest BST Subtree - Medium π‘
Tree - Increasing Triplet Subsequence - Medium π‘
Array - Self Crossing - Medium π‘
Array - Palindrome Pairs - Medium π‘
Array - House Robber III - Medium π‘
Array - Counting Bits - Medium π‘
Array - Nested List Weight Sum - Medium π‘
Linked List - Longest Substring With At Most K Distinct Characters - Medium π‘
Array - Flatten Nested List Iterator - Medium π‘
Linked List - Power Of Four - Medium π‘
Array - Integer Break - Medium π‘
Array - Reverse String - Medium π‘
Array - Reverse Vowels Of A String - Medium π‘
Array - Moving Average From Data Stream - Medium π‘
Array - Top K Frequent Elements - Medium π‘
Array - Design Tic Tac Toe - Medium π‘
Array - Intersection Of Two Arrays - Medium π‘
Two Pointers - Intersection Of Two Arrays II - Medium π‘
Two Pointers
351β400
- Android Unlock Patterns - Medium π‘
Array - Data Stream As Disjoint Intervals - Medium π‘
Array - Design Snake Game - Medium π‘
Array - Russian Doll Envelopes - Medium π‘
Array - Design Twitter - Medium π‘
Array - Line Reflection - Medium π‘
Array - Count Numbers With Unique Digits - Medium π‘
Array - Rearrange String K Distance Apart - Medium π‘
Array - Logger Rate Limiter - Medium π‘
Array - Sort Transformed Array - Medium π‘
Array - Bomb Enemy - Medium π‘
Array - Design Hit Counter - Medium π‘
Array - Max Sum Of Rectangle No Larger Than K - Medium π‘
Array - Nested List Weight Sum II - Medium π‘
Linked List - Water And Jug Problem - Medium π‘
Array - Find Leaves Of Binary Tree - Medium π‘
Tree - Valid Perfect Square - Medium π‘
Array - Largest Divisible Subset - Medium π‘
Array - Plus One Linked List - Medium π‘
Linked List - Range Addition - Medium π‘
Array - Sum Of Two Integers - Medium π‘
Two Pointers - Super Pow - Medium π‘
Array - Find K Pairs With Smallest Sums - Medium π‘
Array - Guess Number Higher Or Lower - Medium π‘
Array - Guess Number Higher Or Lower II - Medium π‘
Array - Wiggle Subsequence - Medium π‘
Array - Combination Sum IV - Medium π‘
Backtracking - Kth Smallest Element In A Sorted Matrix - Medium π‘
Array - Design Phone Directory - Medium π‘
Array - Insert Delete Getrandom O(1) - Medium π‘
Array - Insert Delete Getrandom O(1) Duplicates Allowed - Medium π‘
Array - Linked List Random Node - Medium π‘
Linked List - Ransom Note - Medium π‘
Array - Shuffle An Array - Medium π‘
Array - Mini Parser - Medium π‘
Array - Lexicographical Numbers - Medium π‘
Graph - First Unique Character In A String - Medium π‘
Array - Longest Absolute File Path - Medium π‘
DP - Find The Difference - Medium π‘
Array - Elimination Game - Medium π‘
Array - Perfect Rectangle - Medium π‘
Array - Is Subsequence - Medium π‘
Array - Utf 8 Validation - Medium π‘
Array - Decode String - Medium π‘
Array - Longest Substring With At Least K Repeating Characters - Medium π‘
Array - Rotate Function - Medium π‘
Array - Integer Replacement - Medium π‘
Array - Random Pick Index - Medium π‘
Array - Evaluate Division - Medium π‘
Array - Nth Digit - Medium π‘
Array
401β450
- Binary Watch - Medium π‘
TreeBinary Search - Remove K Digits - Medium π‘
Array - Frog Jump - Medium π‘
Array - Sum Of Left Leaves - Medium π‘
Array - Convert A Number To Hexadecimal - Medium π‘
Array - Queue Reconstruction By Height - Medium π‘
Stack - Trapping Rain Water II - Medium π‘
Array - Valid Word Abbreviation - Medium π‘
Array - Longest Palindrome - Medium π‘
Array - Split Array Largest Sum - Medium π‘
Array - Minimum Unique Word Abbreviation - Medium π‘
Array - Fizz Buzz - Medium π‘
Array - Arithmetic Slices - Medium π‘
Array - Third Maximum Number - Medium π‘
Array - Add Strings - Medium π‘
Array - Partition Equal Subset Sum - Medium π‘
Array - Pacific Atlantic Water Flow - Medium π‘
Array - Sentence Screen Fitting - Medium π‘
Array - Battleships In A Board - Medium π‘
Array - Strong Password Checker - Medium π‘
Array - Maximum Xor Of Two Numbers In An Array - Medium π‘
Two Pointers - Valid Word Square - Medium π‘
Array - Reconstruct Original Digits From English - Medium π‘
Array - Longest Repeating Character Replacement - Medium π‘
Array - Word Squares - Medium π‘
Array - Convert Binary Search Tree To Sorted Doubly Linked List - Medium π‘
TreeLinked List - Construct Quad Tree - Medium π‘
Tree - Serialize And Deserialize N Ary Tree - Medium π‘
Tree - N Ary Tree Level Order Traversal - Medium π‘
Tree - Flatten A Multilevel Doubly Linked List - Medium π‘
Linked List - Encode N Ary Tree To Binary Tree - Medium π‘
Tree - All Oone Data Structure - Medium π‘
Array - Minimum Genetic Mutation - Medium π‘
Array - Number Of Segments In A String - Medium π‘
Array - Non Overlapping Intervals - Medium π‘
Array - Find Right Interval - Medium π‘
Array - Path Sum III - Medium π‘
DP - Find All Anagrams In A String - Medium π‘
Array - Ternary Expression Parser - Medium π‘
Array - K Th Smallest In Lexicographical Order - Medium π‘
Graph - Arranging Coins - Medium π‘
Array - Find All Duplicates In An Array - Medium π‘
Array - String Compression - Medium π‘
Array - Sequence Reconstruction - Medium π‘
Array - Add Two Numbers II - Medium π‘
Two Pointers - Arithmetic Slices II Subsequence - Medium π‘
Array - Number Of Boomerangs - Medium π‘
Array - Find All Numbers Disappeared In An Array - Medium π‘
Array - Serialize And Deserialize BST - Medium π‘
Array - Delete Node In A BST - Medium π‘
Array
451β500
- Sort Characters By Frequency - Medium π‘
Array - Minimum Number Of Arrows To Burst Balloons - Medium π‘
Array - Minimum Moves To Equal Array Elements - Medium π‘
Array - 4sum II - Medium π‘
Array - Assign Cookies - Medium π‘
Array - 132 Pattern - Medium π‘
Array - Circular Array Loop - Medium π‘
Array - Poor Pigs - Medium π‘
Array - Repeated Substring Pattern - Medium π‘
Array - LFU Cache - Medium π‘
Array - Hamming Distance - Medium π‘
Array - Minimum Moves To Equal Array Elements II - Medium π‘
Array - Island Perimeter - Medium π‘
Graph - Can I Win - Medium π‘
Array - Optimal Account Balancing - Medium π‘
Array - Count The Repetitions - Medium π‘
Array - Unique Substrings In Wraparound String - Medium π‘
Array - Validate Ip Address - Medium π‘
Array - Convex Polygon - Medium π‘
Array - Implement Rand10 Using Rand7 - Medium π‘
Array - Encode String With Shortest Length - Medium π‘
Array - Concatenated Words - Medium π‘
Array - Matchsticks To Square - Medium π‘
Array - Ones And Zeroes - Medium π‘
Array - Heaters - Medium π‘
Array - Number Complement - Medium π‘
Array - Total Hamming Distance - Medium π‘
Array - Generate Random Point In A Circle - Medium π‘
Array - Largest Palindrome Product - Medium π‘
Array - Sliding Window Median - Medium π‘
Sliding Window - Magical String - Medium π‘
Array - License Key Formatting - Medium π‘
Array - Smallest Good Base - Medium π‘
Array - Find Permutation - Medium π‘
Backtracking - Max Consecutive Ones - Medium π‘
Array - Predict The Winner - Medium π‘
Array - Max Consecutive Ones II - Medium π‘
Array - Zuma Game - Medium π‘
Array - Robot Room Cleaner - Medium π‘
Array - The Maze - Medium π‘
Array - Non Decreasing Subsequences - Medium π‘
Array - Construct The Rectangle - Medium π‘
Array - Reverse Pairs - Medium π‘
Array - Target Sum - Medium π‘
Array - Teemo Attacking - Medium π‘
Array - Next Greater Element I - Medium π‘
Array - Random Point In Non Overlapping Rectangles - Medium π‘
Array - Diagonal Traverse - Medium π‘
Array - The Maze III - Medium π‘
Array - Keyboard Row - Medium π‘
Array
Pattern-Based Study Guide
TIER 1: FOUNDATION PATTERNS
Learn these patterns first - they form the foundation for 70% of interview problems.
Array & Hashing
When to use: Problems involving frequency counting, lookups, or duplicate detection. Key techniques: Hash maps, hash sets, prefix sums.
- Two Sum - Easy π’ π₯
- Group Anagrams - Medium π‘ π₯
- Top K Frequent Elements - Medium π‘ π₯
- Product of Array Except Self - Medium π‘ π₯
- Valid Sudoku - Medium π‘
- Longest Consecutive Sequence - Medium π‘ π₯
- Subarray Sum Equals K - Medium π‘
- Insert Delete GetRandom O(1) - Medium π‘
####Two Pointers When to use: Problems involving pairs, triplets, or palindromes in sorted/unsorted arrays. Key techniques: Left-right pointers, fast-slow pointers.
Remove Nth Node From End of List
Move Zeroes Sliding Window (0/7)
Longest Substring Without Repeating Characters
Longest Repeating Character Replacement
Fruit Into Baskets Binary Search (0/6)
Binary Search
Search in Rotated Sorted Array
Find Minimum in Rotated Sorted Array
Time Based Key-Value Store Linked List (0/6)
Remove Nth Node From End of List
LRU Cache Trees β Core (0/9)
Lowest Common Ancestor of a BST
Binary Tree Level Order Traversal
Serialize and Deserialize Binary Tree
Binary Tree Maximum Path Sum Heap / Priority Queue (0/4)
Top K Frequent Elements (Heap approach) Backtracking (0/4)
Word Search TIER 2: PATTERN MASTERY (0/70) Advanced Array (0/8)
Spiral Matrix String Manipulation (0/8)
Multiply Strings Stack (0/5)
Evaluate Reverse Polish Notation
Largest Rectangle in Histogram Graph β BFS/DFS (0/12)
Shortest Path in Binary Matrix
Number of Provinces Graph β Advanced (0/7)
Cheapest Flights Within K Stops
Min Cost to Connect All Points
Find the City With the Smallest Number of Neighbors
Reconstruct Itinerary Dynamic Programming β 1D (0/10)
Longest Increasing Subsequence
Longest Decreasing Subsequence (custom variant)
Palindrome Partitioning II Dynamic Programming β 2D (0/10)
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock IV
Maximal Square Trees β Advanced (0/10)
Construct Binary Tree from Preorder and Inorder Traversal
Count Good Nodes in Binary Tree
Lowest Common Ancestor of Binary Tree
Binary Tree Zigzag Level Order Traversal
Flatten Binary Tree to Linked List
Binary Tree Vertical Order Traversal
Populating Next Right Pointers in Each Node TIER 3: COMPANY-SPECIFIC PATTERNS (0/80) Trie (0/5)
Design Add and Search Words Data Structure
Replace Words Advanced DP (0/10)
Minimum Difficulty of a Job Schedule
Distinct Subsequences Intervals (0/8)
Minimum Number of Arrows to Burst Balloons
Employee Free Time Greedy (0/8)
Candy Math & Bit Manipulation (0/8)
Sum of Two Integers Design (0/8)
Design In-Memory File System Union Find (0/7)
Number of Connected Components
Satisfiability of Equality Equations
Longest Consecutive Sequence (Union Find approach)
Most Stones Removed with Same Row or Column Advanced Sliding Window (0/5)
Longest Substring with At Most K Distinct Characters
Subarrays with K Different Integers
Count Number of Nice Subarrays
Replace the Substring for Balanced String Monotonic Stack / Queue (0/5)
Shortest Subarray with Sum at Least K Binary Search - Advanced (0/8)
Capacity To Ship Packages Within D Days
Search in Rotated Sorted Array II
Find First and Last Position of Element
Minimum Number of Days to Make m Bouquets
Aggressive Cows Linked List - Advanced (0/8)