Goldman Sachs LeetCode Questions
261 questions all-time · 48 easy · 165 medium · 48 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 100 | 0.7% |
| 2 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 80 | 0.5% |
| 3 | First Unique Character in a String Hash Table, String, Queue, Counting | Easy | 78 | 0.7% |
| 4 | Fraction to Recurring Decimal Hash Table, Math, String | Medium | 77 | 0.3% |
| 5 | High Five Array, Hash Table, Sorting, Heap (Priority Queue) | Easy | 76 | 0.7% |
| 6 | Minimum Path Sum Array, Dynamic Programming, Matrix | Medium | 67 | 0.7% |
| 7 | Container With Most Water Array, Two Pointers, Greedy | Medium | 65 | 0.6% |
| 8 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 65 | 0.5% |
| 9 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 64 | 0.4% |
| 10 | String Compression Two Pointers, String | Medium | 62 | 0.6% |
| 11 | Merge Intervals Array, Sorting | Medium | 60 | 0.5% |
| 12 | Robot Bounded In Circle Math, String, Simulation | Medium | 60 | 0.6% |
| 13 | Find the Winner of the Circular Game Array, Math, Recursion, Queue, Simulation | Medium | 60 | 0.8% |
| 14 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 58 | 0.7% |
| 15 | Decode Ways String, Dynamic Programming | Medium | 58 | 0.4% |
| 16 | Search in Rotated Sorted Array Array, Binary Search | Medium | 57 | 0.5% |
| 17 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 57 | 0.6% |
| 18 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 55 | 0.6% |
| 19 | Find Minimum in Rotated Sorted Array Array, Binary Search | Medium | 55 | 0.5% |
| 20 | Knight Probability in Chessboard Dynamic Programming | Medium | 55 | 0.6% |
| 21 | Better Compression of String Hash Table, String, Sorting, Counting | Medium | 55 | 0.8% |
| 22 | Two Sum Array, Hash Table | Easy | 53 | 0.6% |
| 23 | Best Time to Buy and Sell Stock II Array, Dynamic Programming, Greedy | Medium | 53 | 0.7% |
| 24 | Pairs of Songs With Total Durations Divisible by 60 Array, Hash Table, Counting | Medium | 53 | 0.5% |
| 25 | Valid Arrangement of Pairs Array, Depth-First Search, Graph Theory, Eulerian Circuit | Hard | 52 | 0.7% |
| 26 | Robot Return to Origin String, Simulation | Easy | 52 | 0.8% |
| 27 | Design HashMap Array, Hash Table, Linked List, Design, Hash Function | Easy | 50 | 0.7% |
| 28 | Corporate Flight Bookings Array, Prefix Sum | Medium | 50 | 0.7% |
| 29 | Minimum Moves to Capture The Queen Math, Enumeration | Medium | 50 | 0.2% |
| 30 | Minimum Length of String After Deleting Similar Ends Two Pointers, String | Medium | 50 | 0.6% |
| 31 | Maximum Subarray Array, Divide and Conquer, Dynamic Programming | Medium | 49 | 0.5% |
| 32 | Minimum Cost Homecoming of a Robot in a Grid Array, Greedy | Medium | 49 | 0.5% |
| 33 | Range Product Queries of Powers Array, Bit Manipulation, Prefix Sum | Medium | 49 | 0.6% |
| 34 | Shortest Subarray with Sum at Least K Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue | Hard | 49 | 0.3% |
| 35 | Find the Minimum Amount of Time to Brew Potions Array, Simulation, Prefix Sum | Medium | 49 | 0.6% |
| 36 | Pascal's Triangle Array, Dynamic Programming | Easy | 47 | 0.8% |
| 37 | Kth Largest Element in an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 47 | 0.7% |
| 38 | Keep Multiplying Found Values by Two Array, Hash Table, Sorting, Simulation | Easy | 47 | 0.8% |
| 39 | Count Number of Texts Hash Table, Math, String, Dynamic Programming | Medium | 47 | 0.5% |
| 40 | Successful Pairs of Spells and Potions Array, Two Pointers, Binary Search, Sorting | Medium | 47 | 0.5% |
| 41 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 47 | 0.7% |
| 42 | Find All Good Indices Array, Dynamic Programming, Prefix Sum | Medium | 47 | 0.4% |
| 43 | Determine if Two Events Have Conflict Array, String | Easy | 47 | 0.5% |
| 44 | Count Palindromic Subsequences String, Dynamic Programming | Hard | 47 | 0.4% |
| 45 | Count Collisions of Monkeys on a Polygon Math, Recursion | Medium | 47 | 0.3% |
| 46 | Minimum Falling Path Sum Array, Dynamic Programming, Matrix | Medium | 47 | 0.6% |
| 47 | Print Zero Even Odd Concurrency | Medium | 47 | 0.7% |
| 48 | Sort the Jumbled Numbers Array, Sorting | Medium | 47 | 0.6% |
| 49 | Perform String Shifts Array, Math, String | Easy | 47 | 0.6% |
| 50 | Minimum Number of Chairs in a Waiting Room String, Simulation | Easy | 47 | 0.8% |
| 51 | Maximize Palindrome Length From Subsequences String, Dynamic Programming | Hard | 47 | 0.4% |
| 52 | Permutations III Array, Backtracking | Medium | 47 | 0.9% |
| 53 | Remove All Adjacent Duplicates in String II String, Stack | Medium | 45 | 0.6% |
| 54 | Optimal Account Balancing Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 45 | 0.5% |
| 55 | Car Pooling Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum | Medium | 45 | 0.6% |
| 56 | Jump Game Array, Dynamic Programming, Greedy | Medium | 43 | 0.4% |
| 57 | Product of Array Except Self Array, Prefix Sum | Medium | 43 | 0.7% |
| 58 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 43 | 0.5% |
| 59 | Construct Smallest Number From DI String String, Backtracking, Stack, Greedy | Medium | 43 | 0.9% |
| 60 | Palindromic Substrings Two Pointers, String, Dynamic Programming | Medium | 43 | 0.7% |
| 61 | Backspace String Compare Two Pointers, String, Stack, Simulation | Easy | 43 | 0.5% |
| 62 | Longest Repeating Character Replacement Hash Table, String, Sliding Window | Medium | 43 | 0.6% |
| 63 | Coin Change Array, Dynamic Programming, Breadth-First Search | Medium | 43 | 0.5% |
| 64 | Allocate Mailboxes Array, Math, Dynamic Programming, Sorting | Hard | 43 | 0.6% |
| 65 | Number of Perfect Pairs Array, Math, Two Pointers, Sorting | Medium | 43 | 0.3% |
| 66 | Design Event Manager Array, Hash Table, Design, Heap (Priority Queue), Ordered Set | Medium | 43 | 0.5% |
| 67 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 41 | 0.4% |
| 68 | 3Sum Array, Two Pointers, Sorting | Medium | 41 | 0.4% |
| 69 | N-Queens Array, Backtracking | Hard | 41 | 0.8% |
| 70 | Sqrt(x) Math, Binary Search | Easy | 41 | 0.4% |
| 71 | Subarray Sum Equals K Array, Hash Table, Prefix Sum | Medium | 41 | 0.5% |
| 72 | Check if the Sentence Is Pangram Hash Table, String | Easy | 41 | 0.8% |
| 73 | Integer to English Words Math, String, Recursion | Hard | 41 | 0.4% |
| 74 | String to Integer (atoi) String | Medium | 38 | 0.2% |
| 75 | Valid Parentheses String, Stack | Easy | 38 | 0.4% |
| 76 | Unique Paths Math, Dynamic Programming, Combinatorics | Medium | 38 | 0.7% |
| 77 | House Robber Array, Dynamic Programming | Medium | 38 | 0.5% |
| 78 | The Skyline Problem Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set | Hard | 38 | 0.5% |
| 79 | Asteroid Collision Array, Stack, Simulation | Medium | 38 | 0.5% |
| 80 | Daily Temperatures Array, Stack, Monotonic Stack | Medium | 38 | 0.7% |
| 81 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 38 | 0.5% |
| 82 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 38 | 0.8% |
| 83 | Open the Lock Array, Hash Table, String, Breadth-First Search | Medium | 38 | 0.6% |
| 84 | Consecutive Characters String | Easy | 38 | 0.6% |
| 85 | Move Zeroes Array, Two Pointers | Easy | 38 | 0.6% |
| 86 | Binary Tree Cameras Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 38 | 0.5% |
| 87 | Roman to Integer Hash Table, Math, String | Easy | 35 | 0.7% |
| 88 | Pow(x, n) Math, Recursion | Medium | 35 | 0.4% |
| 89 | Spiral Matrix Array, Matrix, Simulation | Medium | 35 | 0.6% |
| 90 | Candy Array, Greedy | Hard | 35 | 0.5% |
| 91 | Find Peak Element Array, Binary Search | Medium | 35 | 0.5% |
| 92 | Find Median from Data Stream Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream | Hard | 35 | 0.5% |
| 93 | Search a 2D Matrix Array, Binary Search, Matrix | Medium | 35 | 0.5% |
| 94 | Capacity To Ship Packages Within D Days Array, Binary Search | Medium | 35 | 0.7% |
| 95 | Minimum Value to Get Positive Step by Step Sum Array, Prefix Sum | Easy | 35 | 0.6% |
| 96 | Design Circular Deque Array, Linked List, Design, Queue | Medium | 35 | 0.6% |
| 97 | Reverse Linked List Linked List, Recursion | Easy | 35 | 0.8% |
| 98 | Circular Array Loop Array, Hash Table, Two Pointers | Medium | 35 | 0.4% |
| 99 | Longest Consecutive Sequence Array, Hash Table, Union-Find | Medium | 35 | 0.5% |
| 100 | Max Area of Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 35 | 0.7% |
| 101 | Course Schedule II Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 35 | 0.6% |
| 102 | Maximal Rectangle Array, Dynamic Programming, Stack, Matrix, Monotonic Stack | Hard | 35 | 0.6% |
| 103 | Minimum Initial Energy to Finish Tasks Array, Greedy, Sorting | Hard | 35 | 0.8% |
| 104 | Add Two Numbers Linked List, Math, Recursion | Medium | 32 | 0.5% |
| 105 | Climbing Stairs Math, Dynamic Programming, Memoization | Easy | 32 | 0.5% |
| 106 | Linked List Cycle Hash Table, Linked List, Two Pointers | Easy | 32 | 0.5% |
| 107 | Maximum Product Subarray Array, Dynamic Programming | Medium | 32 | 0.4% |
| 108 | Minimum Size Subarray Sum Array, Binary Search, Sliding Window, Prefix Sum | Medium | 32 | 0.5% |
| 109 | Power of Three Math, Recursion | Easy | 32 | 0.5% |
| 110 | Maximum XOR of Two Numbers in an Array Array, Hash Table, Bit Manipulation, Trie | Medium | 32 | 0.5% |
| 111 | Reaching Points Math | Hard | 32 | 0.3% |
| 112 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 32 | 0.6% |
| 113 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 32 | 0.6% |
| 114 | Third Maximum Number Array, Sorting | Easy | 32 | 0.4% |
| 115 | Identify the Largest Outlier in an Array Array, Hash Table, Counting, Enumeration | Medium | 32 | 0.4% |
| 116 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold Array, Sliding Window | Medium | 32 | 0.7% |
| 117 | Russian Doll Envelopes Array, Binary Search, Dynamic Programming, Sorting | Hard | 32 | 0.4% |
| 118 | Valid Triangle Number Array, Two Pointers, Binary Search, Greedy, Sorting | Medium | 32 | 0.6% |
| 119 | Task Scheduler Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 32 | 0.6% |
| 120 | Path with Maximum Gold Array, Backtracking, Matrix | Medium | 32 | 0.7% |
| 121 | Reverse Nodes in k-Group Linked List, Recursion | Hard | 32 | 0.7% |
| 122 | Koko Eating Bananas Array, Binary Search | Medium | 32 | 0.5% |
| 123 | Largest Rectangle in Histogram Array, Stack, Monotonic Stack | Hard | 32 | 0.5% |
| 124 | Merge Sorted Array Array, Two Pointers, Sorting | Easy | 32 | 0.6% |
| 125 | Gas Station Array, Greedy | Medium | 32 | 0.5% |
| 126 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 32 | 0.5% |
| 127 | Letter Combinations of a Phone Number Hash Table, String, Backtracking | Medium | 27 | 0.7% |
| 128 | Next Permutation Array, Two Pointers | Medium | 27 | 0.5% |
| 129 | First Missing Positive Array, Hash Table | Hard | 27 | 0.4% |
| 130 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 27 | 0.4% |
| 131 | Rotate Image Array, Math, Matrix | Medium | 27 | 0.8% |
| 132 | Set Matrix Zeroes Array, Hash Table, Matrix | Medium | 27 | 0.6% |
| 133 | Word Search Array, String, Backtracking, Depth-First Search, Matrix | Medium | 27 | 0.5% |
| 134 | Intersection of Two Linked Lists Hash Table, Linked List, Two Pointers | Easy | 27 | 0.6% |
| 135 | Best Time to Buy and Sell Stock IV Array, Dynamic Programming | Hard | 27 | 0.5% |
| 136 | Maximal Square Array, Dynamic Programming, Matrix | Medium | 27 | 0.5% |
| 137 | Reverse String Two Pointers, String | Easy | 27 | 0.8% |
| 138 | Decode String String, Stack, Recursion | Medium | 27 | 0.6% |
| 139 | Minimum Number of Arrows to Burst Balloons Array, Greedy, Sorting | Medium | 27 | 0.6% |
| 140 | Minimum Number of Refueling Stops Array, Dynamic Programming, Greedy, Heap (Priority Queue) | Hard | 27 | 0.4% |
| 141 | Count Number of Teams Array, Dynamic Programming, Binary Indexed Tree, Segment Tree | Medium | 27 | 0.7% |
| 142 | Design Underground System Hash Table, String, Design | Medium | 27 | 0.7% |
| 143 | Find the Closest Palindrome Math, String | Hard | 27 | 0.3% |
| 144 | Max Consecutive Ones III Array, Binary Search, Sliding Window, Prefix Sum | Medium | 27 | 0.7% |
| 145 | Validate Binary Search Tree Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | 27 | 0.4% |
| 146 | Single Element in a Sorted Array Array, Binary Search | Medium | 27 | 0.6% |
| 147 | Maximum Size Subarray Sum Equals k Array, Hash Table, Prefix Sum | Medium | 27 | 0.5% |
| 148 | Binary Tree Maximum Path Sum Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 27 | 0.4% |
| 149 | Snakes and Ladders Array, Breadth-First Search, Matrix | Medium | 27 | 0.5% |
| 150 | Game of Life Array, Matrix, Simulation | Medium | 27 | 0.7% |
| 151 | Spiral Matrix II Array, Matrix, Simulation | Medium | 27 | 0.8% |
| 152 | Palindrome Pairs Array, Hash Table, String, Trie, Hash Function | Hard | 27 | 0.4% |
| 153 | 132 Pattern Array, Binary Search, Stack, Monotonic Stack, Ordered Set | Medium | 27 | 0.3% |
| 154 | Frequency of the Most Frequent Element Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum | Medium | 27 | 0.4% |
| 155 | Path Sum Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 27 | 0.6% |
| 156 | Implement Stack using Queues Stack, Design, Queue | Easy | 27 | 0.7% |
| 157 | Find First and Last Position of Element in Sorted Array Array, Binary Search | Medium | 27 | 0.5% |
| 158 | Binary Tree Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 27 | 0.7% |
| 159 | Partition Equal Subset Sum Array, Dynamic Programming | Medium | 27 | 0.5% |
| 160 | Best Time to Buy and Sell Stock III Array, Dynamic Programming | Hard | 27 | 0.5% |
| 161 | Count Primes Array, Math, Enumeration, Number Theory | Medium | 27 | 0.4% |
| 162 | Distribute Coins in Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 27 | 0.8% |
| 163 | Greatest Sum Divisible by Three Array, Dynamic Programming, Greedy, Sorting | Medium | 27 | 0.6% |
| 164 | Magnetic Force Between Two Balls Array, Binary Search, Sorting | Medium | 27 | 0.7% |
| 165 | Shortest Subarray to be Removed to Make Array Sorted Array, Two Pointers, Binary Search, Stack, Monotonic Stack | Medium | 27 | 0.5% |
| 166 | Majority Element Array, Hash Table, Divide and Conquer, Sorting, Counting | Easy | 27 | 0.7% |
| 167 | Kth Largest Element in a Stream Tree, Design, Binary Search Tree, Heap (Priority Queue), Binary Tree, Data Stream | Easy | 27 | 0.6% |
| 168 | Valid Sudoku Array, Hash Table, Matrix | Medium | 27 | 0.6% |
| 169 | Sort Colors Array, Two Pointers, Sorting | Medium | 27 | 0.7% |
| 170 | Minimum Number of Moves to Make Palindrome Two Pointers, String, Greedy, Binary Indexed Tree | Hard | 27 | 0.5% |
| 171 | Minimum Increment to Make Array Unique Array, Greedy, Sorting, Counting | Medium | 27 | 0.6% |
| 172 | Valid Parenthesis String String, Dynamic Programming, Stack, Greedy | Medium | 27 | 0.4% |
| 173 | Integer to Roman Hash Table, Math, String | Medium | 20 | 0.7% |
| 174 | Merge Two Sorted Lists Linked List, Recursion | Easy | 20 | 0.7% |
| 175 | Pascal's Triangle II Array, Dynamic Programming | Easy | 20 | 0.7% |
| 176 | Reorder List Linked List, Two Pointers, Stack, Recursion | Medium | 20 | 0.7% |
| 177 | Missing Number Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting | Easy | 20 | 0.7% |
| 178 | Find the Duplicate Number Array, Two Pointers, Binary Search, Bit Manipulation | Medium | 20 | 0.6% |
| 179 | Longest Increasing Subsequence Array, Binary Search, Dynamic Programming | Medium | 20 | 0.6% |
| 180 | Longest Substring with At Most K Distinct Characters Hash Table, String, Sliding Window | Medium | 20 | 0.5% |
| 181 | Next Greater Element I Array, Hash Table, Stack, Monotonic Stack | Easy | 20 | 0.8% |
| 182 | Count of Integers Math, String, Dynamic Programming | Hard | 20 | 0.4% |
| 183 | Reorganize String Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 20 | 0.6% |
| 184 | Isomorphic Strings Hash Table, String | Easy | 20 | 0.5% |
| 185 | Word Break Array, Hash Table, String, Dynamic Programming, Trie, Memoization | Medium | 20 | 0.5% |
| 186 | Sudoku Solver Array, Hash Table, Backtracking, Matrix | Hard | 20 | 0.7% |
| 187 | Ugly Number II Hash Table, Math, Dynamic Programming, Heap (Priority Queue) | Medium | 20 | 0.5% |
| 188 | Fizz Buzz Math, String, Simulation | Easy | 20 | 0.8% |
| 189 | Restore IP Addresses String, Backtracking | Medium | 20 | 0.6% |
| 190 | Flood Fill Array, Depth-First Search, Breadth-First Search, Matrix | Easy | 20 | 0.7% |
| 191 | Subsets Array, Backtracking, Bit Manipulation | Medium | 20 | 0.8% |
| 192 | Excel Sheet Column Number Math, String | Easy | 20 | 0.7% |
| 193 | Maximum Sum Circular Subarray Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queue | Medium | 20 | 0.5% |
| 194 | Remove One Element to Make the Array Strictly Increasing Array | Easy | 20 | 0.3% |
| 195 | LFU Cache Hash Table, Linked List, Design, Doubly-Linked List | Hard | 20 | 0.5% |
| 196 | Simple Bank System Array, Hash Table, Design, Simulation | Medium | 20 | 0.7% |
| 197 | Basic Calculator II Math, String, Stack | Medium | 20 | 0.5% |
| 198 | Remove All Occurrences of a Substring String, Stack, Simulation | Medium | 20 | 0.8% |
| 199 | Count Good Nodes in Binary Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 20 | 0.7% |
| 200 | Two Sum IV - Input is a BST Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree | Easy | 20 | 0.6% |
| 201 | Next Greater Element II Array, Stack, Monotonic Stack | Medium | 20 | 0.7% |
| 202 | K-th Symbol in Grammar Math, Bit Manipulation, Recursion | Medium | 20 | 0.5% |
| 203 | Implement Trie (Prefix Tree) Hash Table, String, Design, Trie | Medium | 20 | 0.7% |
| 204 | Meeting Rooms III Array, Hash Table, Sorting, Heap (Priority Queue), Simulation | Hard | 20 | 0.5% |
| 205 | Design Circular Queue Array, Linked List, Design, Queue | Medium | 20 | 0.5% |
| 206 | Lexicographically Smallest String After Substring Operation String, Greedy | Medium | 20 | 0.4% |
| 207 | Find the Celebrity Two Pointers, Graph Theory, Interactive | Medium | 20 | 0.5% |
| 208 | Triangle Array, Dynamic Programming | Medium | 20 | 0.6% |
| 209 | Shortest Path in Binary Matrix Array, Breadth-First Search, Matrix | Medium | 20 | 0.5% |
| 210 | Bus Routes Array, Hash Table, Breadth-First Search | Hard | 20 | 0.5% |
| 211 | Evaluate Reverse Polish Notation Array, Math, Stack | Medium | 20 | 0.6% |
| 212 | Symmetric Tree Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy | 20 | 0.6% |
| 213 | Non-overlapping Intervals Array, Dynamic Programming, Greedy, Sorting | Medium | 20 | 0.6% |
| 214 | Text Justification Array, String, Simulation | Hard | 20 | 0.5% |
| 215 | Burst Balloons Array, Dynamic Programming | Hard | 20 | 0.6% |
| 216 | Length of Longest Fibonacci Subsequence Array, Hash Table, Dynamic Programming | Medium | 20 | 0.6% |
| 217 | Search a 2D Matrix II Array, Binary Search, Divide and Conquer, Matrix | Medium | 20 | 0.6% |
| 218 | Word Ladder Hash Table, String, Breadth-First Search | Hard | 20 | 0.5% |
| 219 | Find Original Array From Doubled Array Array, Hash Table, Greedy, Sorting | Medium | 20 | 0.4% |
| 220 | Find Pivot Index Array, Prefix Sum | Easy | 20 | 0.6% |
| 221 | Cherry Pickup Array, Dynamic Programming, Matrix | Hard | 20 | 0.4% |
| 222 | Snapshot Array Array, Hash Table, Binary Search, Design | Medium | 20 | 0.4% |
| 223 | Maximum Average Subarray I Array, Sliding Window | Easy | 20 | 0.5% |
| 224 | Permutations II Array, Backtracking, Sorting | Medium | 20 | 0.6% |
| 225 | Longest Palindromic Subsequence String, Dynamic Programming | Medium | 20 | 0.7% |
| 226 | Perfect Squares Math, Dynamic Programming, Breadth-First Search | Medium | 20 | 0.6% |
| 227 | Longest Duplicate Substring String, Binary Search, Sliding Window, Rolling Hash, Suffix Array, Hash Function | Hard | 20 | 0.3% |
| 228 | Amount of Time for Binary Tree to Be Infected Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium | 20 | 0.7% |
| 229 | Binary Tree Zigzag Level Order Traversal Tree, Breadth-First Search, Binary Tree | Medium | 20 | 0.6% |
| 230 | Power of Two Math, Bit Manipulation, Recursion | Easy | 20 | 0.5% |
| 231 | Unique Paths III Array, Backtracking, Bit Manipulation, Matrix | Hard | 20 | 0.8% |
| 232 | Delete the Middle Node of a Linked List Linked List, Two Pointers | Medium | 20 | 0.6% |
| 233 | Parsing A Boolean Expression String, Stack, Recursion | Hard | 20 | 0.7% |
| 234 | Find Shortest Path with K Hops Graph Theory, Heap (Priority Queue), Shortest Path | Hard | 20 | 0.7% |
| 235 | Tree Diameter Tree, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 20 | 0.6% |
| 236 | Minimum Swaps to Make Strings Equal Math, String, Greedy | Medium | 20 | 0.7% |
| 237 | Odd Even Linked List Linked List | Medium | 20 | 0.6% |
| 238 | Evaluate Division Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Path | Medium | 20 | 0.6% |
| 239 | Minimum Cost to Reach City With Discounts Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 20 | 0.6% |
| 240 | Single-Threaded CPU Array, Sorting, Heap (Priority Queue) | Medium | 20 | 0.5% |
| 241 | Permutations Array, Backtracking | Medium | 20 | 0.8% |
| 242 | Diameter of N-Ary Tree Tree, Depth-First Search | Medium | 20 | 0.8% |
| 243 | K Closest Points to Origin Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect | Medium | 20 | 0.7% |
| 244 | Car Fleet Array, Stack, Sorting, Monotonic Stack | Medium | 20 | 0.6% |
| 245 | Count Square Submatrices with All Ones Array, Dynamic Programming, Matrix | Medium | 20 | 0.8% |
| 246 | Reverse Words in a String Two Pointers, String | Medium | 20 | 0.6% |
| 247 | Remove Duplicates from Sorted Array Array, Two Pointers | Easy | 20 | 0.6% |
| 248 | Find the Longest Substring Containing Vowels in Even Counts Hash Table, String, Bit Manipulation, Prefix Sum | Medium | 20 | 0.8% |
| 249 | Minimum Insertion Steps to Make a String Palindrome String, Dynamic Programming | Hard | 20 | 0.7% |
| 250 | Shortest Bridge Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 20 | 0.6% |
| 251 | Design Browser History Array, Linked List, Stack, Design, Doubly-Linked List, Data Stream | Medium | 20 | 0.8% |
| 252 | Lowest Common Ancestor of a Binary Tree Tree, Depth-First Search, Binary Tree | Medium | 20 | 0.7% |
| 253 | Valid Anagram Hash Table, String, Sorting | Easy | 20 | 0.7% |
| 254 | Top K Frequent Words Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting | Medium | 20 | 0.6% |
| 255 | Is Subsequence Two Pointers, String, Dynamic Programming | Easy | 20 | 0.5% |
| 256 | Accounts Merge Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting | Medium | 20 | 0.6% |
| 257 | Largest Number Array, String, Greedy, Sorting | Medium | 20 | 0.4% |
| 258 | Kth Ancestor of a Tree Node Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Design | Hard | 20 | 0.4% |
| 259 | Split Array Largest Sum Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum | Hard | 20 | 0.6% |
| 260 | Maximum Number of Events That Can Be Attended Array, Greedy, Sorting, Heap (Priority Queue) | Medium | 20 | 0.4% |
| 261 | Find the Winner of an Array Game Array, Simulation | Medium | 20 | 0.6% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.