DSA Doctor
Verified Company Vault
30d Active
Pinterest DSA Interview Questions
44 curated coding interview questions directly asked in Pinterest technical rounds, sorted by frequency with recency and difficulty diagnostics.
44
Total Questions
1 (2%)
Easy Problems
27 (61%)
Medium Problems
16 (36%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (14)Arrays (11)Strings (8)Heap (4)Trees (2)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1055 | Shortest Way to Form String | Medium | Strings | Hashing / Sliding Window | 61.7% | 100.0% | 30d |
| 282 | Expression Add Operators | Hard | Core DSA | Implementation / Reasoning | 43.2% | 100.0% | 30d |
| 1564 | Put Boxes Into the Warehouse I | Medium | Core DSA | Implementation / Reasoning | 67.5% | 100.0% | 30d |
| 332 | Reconstruct Itinerary | Hard | Core DSA | Implementation / Reasoning | 44.6% | 100.0% | 3m |
| 815 | Bus Routes | Hard | Core DSA | Implementation / Reasoning | 47.3% | 87.5% | 3m |
| 465 | Optimal Account Balancing | Hard | Core DSA | Implementation / Reasoning | 50.5% | 87.5% | 3m |
| 1110 | Delete Nodes And Return Forest | Medium | Trees | DFS / BFS | 72.5% | 87.5% | 3m |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 87.5% | 3m |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 87.5% | 3m |
| 642 | Design Search Autocomplete System | Hard | Binary Search; Design | Binary Search; Data Structure Design | 50.0% | 87.5% | 3m |
| 43 | Multiply Strings | Medium | Strings | Hashing / Sliding Window | 44.2% | 87.5% | 3m |
| 1244 | Design A Leaderboard | Medium | Design | Data Structure Design | 68.1% | 87.5% | 6m |
| 38 | Count and Say | Medium | Core DSA | Implementation / Reasoning | 62.9% | 87.5% | all |
| 2302 | Count Subarrays With Score Less Than K | Hard | Arrays | Sorting / Prefix / Scan | 62.2% | 87.5% | all |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | Trees | DFS / BFS | 46.3% | 87.5% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 75.0% | all |
| 392 | Is Subsequence | Easy | Core DSA | Implementation / Reasoning | 49.0% | 75.0% | all |
| 720 | Longest Word in Dictionary | Medium | Strings | Hashing / Sliding Window | 54.8% | 75.0% | all |
| 311 | Sparse Matrix Multiplication | Medium | Arrays | Sorting / Prefix / Scan | 69.3% | 62.5% | 6m |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | 6m |
| 1580 | Put Boxes Into the Warehouse II | Medium | Core DSA | Implementation / Reasoning | 66.0% | 62.5% | 6m |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 62.5% | all |
| 571 | Find Median Given Frequency of Numbers | Hard | Heap | Priority Queue | 42.3% | 62.5% | all |
| 2402 | Meeting Rooms III | Hard | Greedy | Greedy | 51.5% | 62.5% | all |
| 494 | Target Sum | Medium | Arrays | Sorting / Prefix / Scan | 52.2% | 62.5% | all |
| 767 | Reorganize String | Medium | Strings | Hashing / Sliding Window | 57.1% | 50.0% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 50.0% | all |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 50.0% | all |
| 723 | Candy Crush | Medium | Core DSA | Implementation / Reasoning | 77.4% | 50.0% | all |
| 721 | Accounts Merge | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 50.0% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 50.0% | all |
| 1723 | Find Minimum Time to Finish All Jobs | Hard | Arrays | Sorting / Prefix / Scan | 45.8% | 50.0% | all |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 37.5% | all |
| 63 | Unique Paths II | Medium | Core DSA | Implementation / Reasoning | 44.5% | 37.5% | all |
| 1996 | The Number of Weak Characters in the Game | Medium | Strings | Hashing / Sliding Window | 44.6% | 37.5% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 37.5% | all |
| 2232 | Minimize Result by Adding Parentheses to Expression | Medium | Strings | Hashing / Sliding Window | 68.1% | 37.5% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 37.5% | all |
| 490 | The Maze | Medium | Core DSA | Implementation / Reasoning | 60.4% | 37.5% | all |
| 759 | Employee Free Time | Hard | Core DSA | Implementation / Reasoning | 72.9% | 37.5% | all |
| 1570 | Dot Product of Two Sparse Vectors | Medium | Arrays | Sorting / Prefix / Scan | 89.9% | 37.5% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 37.5% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 37.5% | all |
| 547 | Number of Provinces | Medium | Core DSA | Implementation / Reasoning | 70.4% | 37.5% | all |