All problems

Search, filter by difficulty or pattern, and sort. Deep-linkable.

#1 Two Sum — Easy

#121 Best Time to Buy and Sell Stock — Easy

#53 Maximum Subarray — Medium

#485 Max Consecutive Ones — Easy

#169 Majority Element — Medium

#229 Majority Element II — Medium

#128 Longest Consecutive Sequence — Medium

#118 Pascal's Triangle — Easy

#287 Find the Duplicate Number — Medium

#13 Roman to Integer — Easy

#151 Reverse Words in a String — Medium

#15 3Sum — Medium

#75 Sort Colors — Medium

#26 Remove Duplicates from Sorted Array — Easy

#88 Merge Sorted Array — Medium

#31 Next Permutation — Medium

#242 Valid Anagram — Easy

#3 Longest Substring Without Repeating Characters — Medium

#930 Binary Subarrays With Sum — Medium

#20 Valid Parentheses — Easy

#74 Search a 2D Matrix — Medium

#206 Reverse Linked List — Easy

#876 Middle of the Linked List — Easy

#141 Linked List Cycle — Easy

#21 Merge Two Sorted Lists — Easy

#237 Delete Node in a Linked List — Medium

#56 Merge Intervals — Medium

#48 Rotate Image — Medium

#73 Set Matrix Zeroes — Medium

#2 Add Two Numbers — Medium

#19 Remove Nth Node From End of List — Medium

#160 Intersection of Two Linked Lists — Medium

#39 Combination Sum — Medium

#40 Combination Sum II — Medium

#62 Unique Paths — Medium

#50 Pow(x, n) — Medium

#234 Palindrome Linked List — Medium

#46 Permutations — Medium

#90 Subsets II — Medium

#94 Binary Tree Inorder Traversal — Easy

#144 Binary Tree Preorder Traversal — Easy

#145 Binary Tree Postorder Traversal — Easy

#104 Maximum Depth of Binary Tree — Easy

#540 Single Element in a Sorted Array — Medium

#14 Longest Common Prefix — Easy

#142 Linked List Cycle II — Medium

#455 Assign Cookies — Easy

GFG Longest Subarray with Sum K — Medium

#18 4Sum — Medium

GFG Count Subarrays with XOR K — Hard

#493 Reverse Pairs — Hard

#42 Trapping Rain Water — Hard

GFG Find Missing and Repeating Number — Hard

GFG Count Inversions — Hard

#61 Rotate List — Medium

#138 Copy List with Random Pointer — Medium

#25 Reverse Nodes in k-Group — Hard

#430 Flatten a Multilevel Doubly Linked List — Hard

GFG N Meetings in One Room — Medium

GFG Minimum Number of Platforms — Medium

GFG Fractional Knapsack — Medium

#322 Coin Change (Minimum Coins) — Medium

GFG Job Sequencing Problem — Hard

#131 Palindrome Partitioning — Medium

GFG Subset Sums — Medium

#60 Permutation Sequence — Hard

GFG Rat in a Maze — Medium

GFG M-Coloring Problem — Medium

#139 Word Break — Medium

#51 N-Queens — Hard

#37 Sudoku Solver — Hard

#33 Search in Rotated Sorted Array — Medium

GFG N-th Root of an Integer — Medium

GFG Matrix Median — Medium

GFG Allocate Minimum Pages — Medium

GFG Aggressive Cows — Medium

GFG Kth Element of Two Sorted Arrays — Hard

#4 Median of Two Sorted Arrays — Hard

#215 Kth Largest Element in an Array — Medium

#347 Top K Frequent Elements — Medium

GFG Maximum Sum Combination — Medium

GFG Implement Max Heap — Medium

#295 Find Median from Data Stream — Hard

#23 Merge K Sorted Lists — Hard

GFG Implement Stack using Arrays — Easy

GFG Implement Queue using Arrays — Easy

#994 Rotten Oranges — Medium

GFG Next Greater Element — Medium

#225 Implement Stack using Queue — Medium

#232 Implement Queue using Stack — Medium

#901 Online Stock Span — Medium

GFG Next Smaller Element — Medium

GFG Maximum of Minimums for Every Window Size — Medium

#155 Min Stack — Medium

GFG Sort a Stack — Medium

#277 Find the Celebrity — Medium

#146 LRU Cache — Medium

#239 Sliding Window Maximum — Hard

#84 Largest Rectangle in Histogram — Hard

#460 LFU Cache — Hard

#38 Count and Say — Medium

#5 Longest Palindromic Substring — Medium

#8 String to Integer (atoi) — Medium

#165 Compare Version Numbers — Medium

GFG Rabin-Karp Algorithm — Medium

GFG Z Function — Medium

#28 KMP Algorithm / LPS Array — Medium

#1312 Minimum Insertions to Make String Palindrome — Hard

#543 Diameter of Binary Tree — Easy

#100 Same Tree — Easy

#101 Symmetric Tree — Easy

#112 Path Sum — Easy

#404 Sum of Left Leaves — Easy

GFG Pre + Post + Inorder in One Traversal — Easy

#102 Binary Tree Level Order Traversal — Medium

#199 Binary Tree Right Side View — Medium

#110 Balanced Binary Tree — Medium

#236 Lowest Common Ancestor of Binary Tree — Medium

#103 Zigzag Level Order Traversal — Medium

#257 Binary Tree Paths — Medium

#662 Maximum Width of Binary Tree — Medium

#987 Vertical Order Traversal — Medium

GFG Bottom View of Binary Tree — Medium

GFG Top View of Binary Tree — Medium

#105 Construct BT from Preorder and Inorder — Medium

#106 Construct BT from Postorder and Inorder — Medium

#114 Flatten Binary Tree to Linked List — Medium

GFG Morris Inorder Traversal — Hard

GFG Morris Preorder Traversal — Hard

#124 Binary Tree Maximum Path Sum — Hard

#545 Boundary of Binary Tree — Hard

#700 Search in a BST — Easy

GFG Floor in BST — Easy

GFG Ceil in BST — Easy

#235 Lowest Common Ancestor of BST — Easy

GFG Construct BST from Given Keys (Preorder) — Easy

#653 Two Sum IV — Input is BST — Easy

#733 Flood Fill — Easy

#230 Kth Smallest Element in BST — Medium

#285 Inorder Successor in BST — Medium

#98 Validate Binary Search Tree — Medium

#116 Populating Next Right Pointers — Medium

#1008 Construct BST from Preorder Traversal — Medium

GFG Kth Smallest and Largest in BST — Medium

#109 Convert Sorted List to BST — Medium

#703 Kth Largest in Stream — Medium

#173 BST Iterator — Hard

#1373 Maximum Sum BST in Binary Tree — Hard

#297 Serialize and Deserialize Binary Tree — Hard

#133 Clone Graph — Medium

#200 Number of Islands — Medium

#785 Is Graph Bipartite? — Medium

#300 Longest Increasing Subsequence — Medium

#1143 Longest Common Subsequence — Medium

#64 Minimum Path Sum — Medium

#518 Coin Change II — Medium

#72 Edit Distance — Hard

#1235 Maximum Profit in Job Scheduling — Hard

#152 Maximum Product Subarray — Hard

#887 Super Egg Drop — Hard

#132 Palindrome Partitioning II — Hard

#78 Subsets (Power Set) — Easy

#208 Implement Trie (Prefix Tree) — Medium

#421 Maximum XOR of Two Numbers in an Array — Hard

#212 Word Search II — Hard

#1707 Maximum XOR With an Element From Array — Hard

GFG DFS of Graph — Easy

GFG BFS of Graph — Easy

GFG Topological Sort (Kahn's BFS) — Medium

GFG Topological Sort (DFS) — Medium

GFG Detect Cycle in Undirected Graph (BFS) — Medium

GFG Detect Cycle in Undirected Graph (DFS) — Medium

GFG Detect Cycle in Directed Graph (DFS) — Medium

GFG Detect Cycle in Directed Graph (BFS) — Medium

GFG Strongly Connected Components (Kosaraju) — Hard

GFG Dijkstra's Algorithm — Medium

GFG Bellman–Ford Algorithm — Medium

GFG Floyd–Warshall Algorithm — Medium

GFG MST — Prim's Algorithm — Medium

GFG MST — Kruskal's Algorithm — Medium

GFG Subset Sum Equals Target — Medium

GFG 0/1 Knapsack — Medium

GFG Rod Cutting Problem — Medium

GFG Matrix Chain Multiplication — Hard

GFG Maximum Sum Increasing Subsequence — Medium

GFG Longest Word with All Prefixes — Medium

GFG Number of Distinct Substrings — Hard