Pinterest LeetCode Questions
49 questions all-time · 1 easy · 29 medium · 19 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Count and Say String | Medium | 100 | 60.5% |
| 2 | Reconstruct Itinerary Depth-First Search, Graph, Eulerian Circuit | Hard | 95 | 43.6% |
| 3 | Shortest Path in a Grid with Obstacles Elimination Array, Breadth-First Search, Matrix | Hard | 93 | 45.6% |
| 4 | Optimal Account Balancing Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 92 | 49.9% |
| 5 | Count Subarrays With Score Less Than K Array, Binary Search, Sliding Window, Prefix Sum | Hard | 91 | 62.4% |
| 6 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 90 | 54.4% |
| 7 | Bus Routes Array, Hash Table, Breadth-First Search | Hard | 86 | 47.0% |
| 8 | Expression Add Operators Math, String, Backtracking | Hard | 85 | 41.7% |
| 9 | Find Median from Data Stream Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream | Hard | 79 | 53.3% |
| 10 | Shortest Way to Form String Two Pointers, String, Binary Search, Greedy | Medium | 77 | 61.3% |
| 11 | Is Subsequence Two Pointers, String, Dynamic Programming | Easy | 74 | 48.4% |
| 12 | Reorganize String Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting | Medium | 73 | 56.2% |
| 13 | Longest Word in Dictionary Array, Hash Table, String, Trie, Sorting | Medium | 70 | 53.5% |
| 14 | Design Search Autocomplete System String, Depth-First Search, Design, Trie, Sorting, Heap (Priority Queue), Data Stream | Hard | 70 | 49.4% |
| 15 | Find Median Given Frequency of Numbers Database | Hard | 66 | 42.5% |
| 16 | Jump Game III Array, Depth-First Search, Breadth-First Search | Medium | 64 | 66.0% |
| 17 | Find K-th Smallest Pair Distance Array, Two Pointers, Binary Search, Sorting | Hard | 62 | 45.8% |
| 18 | Coin Change Array, Dynamic Programming, Breadth-First Search | Medium | 62 | 46.5% |
| 19 | String Compression Two Pointers, String | Medium | 59 | 58.1% |
| 20 | Sparse Matrix Multiplication Array, Hash Table, Matrix | Medium | 59 | 68.9% |
| 21 | Meeting Rooms III Array, Hash Table, Sorting, Heap (Priority Queue), Simulation | Hard | 59 | 43.9% |
| 22 | Target Sum Array, Dynamic Programming, Backtracking | Medium | 56 | 50.8% |
| 23 | Unique Paths II Array, Dynamic Programming, Matrix | Medium | 56 | 43.2% |
| 24 | Minimize Result by Adding Parentheses to Expression String, Enumeration | Medium | 53 | 67.5% |
| 25 | The Number of Weak Characters in the Game Array, Stack, Greedy, Sorting, Monotonic Stack | Medium | 48 | 44.2% |
| 26 | Is Graph Bipartite? Depth-First Search, Breadth-First Search, Union Find, Graph | Medium | 48 | 57.7% |
| 27 | Employee Free Time Array, Line Sweep, Sorting, Heap (Priority Queue) | Hard | 48 | 72.6% |
| 28 | Unique Paths III Array, Backtracking, Bit Manipulation, Matrix | Hard | 48 | 82.3% |
| 29 | Top K Frequent Elements Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect | Medium | 43 | 64.6% |
| 30 | Accounts Merge Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting | Medium | 43 | 59.6% |
| 31 | Combination Sum Array, Backtracking | Medium | 43 | 74.7% |
| 32 | Split Array Largest Sum Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum | Hard | 43 | 58.1% |
| 33 | Multiply Strings Math, String, Simulation | Medium | 43 | 42.3% |
| 34 | Letter Combinations of a Phone Number Hash Table, String, Backtracking | Medium | 43 | 63.9% |
| 35 | Possible Bipartition Depth-First Search, Breadth-First Search, Union Find, Graph | Medium | 43 | 51.5% |
| 36 | Single Element in a Sorted Array Array, Binary Search | Medium | 43 | 59.2% |
| 37 | Meeting Rooms II Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum | Medium | 43 | 52.1% |
| 38 | Snakes and Ladders Array, Breadth-First Search, Matrix | Medium | 35 | 47.8% |
| 39 | The Maze Array, Depth-First Search, Breadth-First Search, Matrix | Medium | 35 | 59.5% |
| 40 | Find the Celebrity Two Pointers, Graph, Interactive | Medium | 35 | 48.4% |
| 41 | Find First and Last Position of Element in Sorted Array Array, Binary Search | Medium | 35 | 46.8% |
| 42 | Shortest Path to Get All Keys Array, Bit Manipulation, Breadth-First Search, Matrix | Hard | 35 | 53.7% |
| 43 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union Find, Matrix | Medium | 35 | 62.3% |
| 44 | Candy Crush Array, Two Pointers, Matrix, Simulation | Medium | 35 | 77.4% |
| 45 | Dot Product of Two Sparse Vectors Array, Hash Table, Two Pointers, Design | Medium | 35 | 89.9% |
| 46 | Implement Trie (Prefix Tree) Hash Table, String, Design, Trie | Medium | 35 | 67.9% |
| 47 | Sudoku Solver Array, Hash Table, Backtracking, Matrix | Hard | 35 | 63.9% |
| 48 | Find Minimum Time to Finish All Jobs Array, Dynamic Programming, Backtracking, Bit Manipulation, Bitmask | Hard | 35 | 43.5% |
| 49 | Smallest Range Covering Elements from K Lists Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue) | Hard | 35 | 69.7% |
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.