DSA Doctor
Verified Company Vault
De Shaw DSA Interview Questions
110 curated coding interview questions directly asked in De Shaw technical rounds, sorted by frequency with recency and difficulty diagnostics.
110
Total Questions
11 (10%)
Easy Problems
66 (60%)
Medium Problems
33 (30%)
Hard Problems
🔥 Most Tested Topics:
Arrays (50)Core DSA (30)Strings (17)Trees (6)Graphs (6)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 968 | Binary Tree Cameras | Hard | Trees | DFS / BFS | 47.9% | 100.0% | 3m |
| 1642 | Furthest Building You Can Reach | Medium | Core DSA | Implementation / Reasoning | 50.9% | 100.0% | 3m |
| 3469 | Find Minimum Cost to Remove Array Elements | Medium | Arrays | Sorting / Prefix / Scan | 21.7% | 87.5% | all |
| 316 | Remove Duplicate Letters | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 53.2% | 75.0% | 6m |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 75.0% | all |
| 2920 | Maximum Points After Collecting Coins From All Nodes | Hard | Arrays; Trees; Dynamic Programming | Sorting / Prefix / Scan; DFS / BFS; State Transition | 36.6% | 75.0% | all |
| 1122 | Relative Sort Array | Easy | Arrays | Sorting / Prefix / Scan | 75.2% | 75.0% | all |
| 3077 | Maximum Strength of K Disjoint Subarrays | Hard | Arrays | Sorting / Prefix / Scan | 27.8% | 75.0% | all |
| 2171 | Removing Minimum Number of Magic Beans | Medium | Arrays | Sorting / Prefix / Scan | 44.6% | 75.0% | all |
| 3082 | Find the Sum of the Power of All Subsequences | Hard | Arrays | Sorting / Prefix / Scan | 38.4% | 75.0% | all |
| 3108 | Minimum Cost Walk in Weighted Graph | Hard | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 68.2% | 75.0% | all |
| 3085 | Minimum Deletions to Make String K-Special | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 67.1% | 75.0% | all |
| 1262 | Greatest Sum Divisible by Three | Medium | Arrays | Sorting / Prefix / Scan | 57.0% | 75.0% | all |
| 2343 | Query Kth Smallest Trimmed Number | Medium | Heap | Priority Queue | 47.6% | 75.0% | all |
| 2352 | Equal Row and Column Pairs | Medium | Core DSA | Implementation / Reasoning | 70.9% | 75.0% | all |
| 3209 | Number of Subarrays With AND Value of K | Hard | Arrays | Sorting / Prefix / Scan | 35.3% | 75.0% | all |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | Arrays | Sorting / Prefix / Scan | 51.0% | 75.0% | all |
| 1358 | Number of Substrings Containing All Three Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 73.7% | 75.0% | all |
| 2875 | Minimum Size Subarray in Infinite Array | Medium | Arrays | Sorting / Prefix / Scan | 32.2% | 75.0% | all |
| 2430 | Maximum Deletions on a String | Hard | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 35.9% | 75.0% | all |
| 2387 | Median of a Row Wise Sorted Matrix | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 71.0% | 75.0% | all |
| 2542 | Maximum Subsequence Score | Medium | Arrays | Sorting / Prefix / Scan | 54.7% | 75.0% | all |
| 2660 | Determine the Winner of a Bowling Game | Easy | Core DSA | Implementation / Reasoning | 37.6% | 75.0% | all |
| 2558 | Take Gifts From the Richest Pile | Easy | Core DSA | Implementation / Reasoning | 75.5% | 75.0% | all |
| 2644 | Find the Maximum Divisibility Score | Easy | Arrays | Sorting / Prefix / Scan | 51.9% | 75.0% | all |
| 1679 | Max Number of K-Sum Pairs | Medium | Arrays | Sorting / Prefix / Scan | 57.1% | 75.0% | all |
| 2800 | Shortest String That Contains Three Strings | Medium | Strings | Hashing / Sliding Window | 31.8% | 75.0% | all |
| 1927 | Sum Game | Medium | Arrays | Sorting / Prefix / Scan | 49.3% | 75.0% | all |
| 2972 | Count the Number of Incremovable Subarrays II | Hard | Arrays | Sorting / Prefix / Scan | 40.2% | 75.0% | all |
| 2984 | Find Peak Calling Hours for Each City | Medium | Binary Search | Binary Search | 61.9% | 75.0% | all |
| 3323 | Minimize Connected Groups by Inserting Interval | Medium | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 50.5% | 75.0% | all |
| 3332 | Maximum Points Tourist Can Earn | Medium | Arrays | Sorting / Prefix / Scan | 47.6% | 75.0% | all |
| 3383 | Minimum Runes to Add to Cast Spell | Hard | Arrays | Sorting / Prefix / Scan | 44.6% | 75.0% | all |
| 3628 | Maximum Number of Subsequences After One Inserting | Medium | Arrays | Sorting / Prefix / Scan | 31.9% | 75.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 62.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | all |
| 440 | K-th Smallest in Lexicographical Order | Hard | Graphs | BFS / DFS / Topological Sort | 46.3% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 62.5% | all |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 62.5% | all |
| 871 | Minimum Number of Refueling Stops | Hard | Arrays | Sorting / Prefix / Scan | 41.4% | 62.5% | all |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | Medium | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 62.3% | 62.5% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | all |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 50.0% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 50.0% | all |
| 2551 | Put Marbles in Bags | Hard | Core DSA | Implementation / Reasoning | 72.1% | 50.0% | all |
| 2742 | Painting the Walls | Hard | Core DSA | Implementation / Reasoning | 49.1% | 50.0% | all |
| 1701 | Average Waiting Time | Medium | Core DSA | Implementation / Reasoning | 73.1% | 50.0% | all |
| 778 | Swim in Rising Water | Hard | Core DSA | Implementation / Reasoning | 67.8% | 50.0% | all |
| 752 | Open the Lock | Medium | Core DSA | Implementation / Reasoning | 61.3% | 50.0% | all |
| 3016 | Minimum Number of Pushes to Type Word II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 80.0% | 50.0% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 50.0% | all |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | Core DSA | Implementation / Reasoning | 65.9% | 50.0% | all |
| 475 | Heaters | Medium | Core DSA | Implementation / Reasoning | 41.9% | 50.0% | all |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium | Arrays | Sorting / Prefix / Scan | 51.3% | 50.0% | all |
| 668 | Kth Smallest Number in Multiplication Table | Hard | Heap | Priority Queue | 54.1% | 50.0% | all |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 50.0% | all |
| 829 | Consecutive Numbers Sum | Hard | Arrays | Sorting / Prefix / Scan | 42.7% | 50.0% | all |
| 518 | Coin Change II | Medium | Dynamic Programming | State Transition | 60.0% | 50.0% | all |
| 779 | K-th Symbol in Grammar | Medium | Core DSA | Implementation / Reasoning | 48.3% | 50.0% | all |
| 470 | Implement Rand10() Using Rand7() | Medium | Core DSA | Implementation / Reasoning | 46.4% | 50.0% | all |
| 168 | Excel Sheet Column Title | Easy | Core DSA | Implementation / Reasoning | 46.5% | 50.0% | all |
| 1048 | Longest String Chain | Medium | Strings | Hashing / Sliding Window | 63.0% | 50.0% | all |
| 3281 | Maximize Score of Numbers in Ranges | Medium | Core DSA | Implementation / Reasoning | 35.7% | 50.0% | all |
| 2104 | Sum of Subarray Ranges | Medium | Arrays | Sorting / Prefix / Scan | 61.1% | 50.0% | all |
| 2221 | Find Triangular Sum of an Array | Medium | Arrays | Sorting / Prefix / Scan | 82.0% | 50.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 50.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 50.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | all |
| 1000 | Minimum Cost to Merge Stones | Hard | Arrays | Sorting / Prefix / Scan | 46.1% | 50.0% | all |
| 767 | Reorganize String | Medium | Strings | Hashing / Sliding Window | 57.1% | 50.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 37.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 37.5% | all |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 37.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 37.5% | all |
| 1383 | Maximum Performance of a Team | Hard | Arrays | Sorting / Prefix / Scan | 47.8% | 37.5% | all |
| 852 | Peak Index in a Mountain Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 66.8% | 37.5% | all |
| 122 | Best Time to Buy and Sell Stock II | Medium | Core DSA | Implementation / Reasoning | 71.1% | 37.5% | all |
| 787 | Cheapest Flights Within K Stops | Medium | Heap | Priority Queue | 41.8% | 37.5% | all |
| 1569 | Number of Ways to Reorder Array to Get Same BST | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 54.1% | 37.5% | all |
| 2617 | Minimum Number of Visited Cells in a Grid | Hard | Arrays | Sorting / Prefix / Scan | 23.9% | 37.5% | all |
| 2680 | Maximum OR | Medium | Arrays | Sorting / Prefix / Scan | 43.0% | 37.5% | all |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 37.5% | all |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 37.5% | all |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 37.5% | all |
| 943 | Find the Shortest Superstring | Hard | Strings | Hashing / Sliding Window | 45.4% | 37.5% | all |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 37.5% | all |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | Graphs | BFS / DFS / Topological Sort | 70.2% | 37.5% | all |
| 341 | Flatten Nested List Iterator | Medium | Linked List; Design | Two Pointers; Data Structure Design | 65.7% | 37.5% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 37.5% | all |
| 1244 | Design A Leaderboard | Medium | Design | Data Structure Design | 68.1% | 37.5% | all |
| 91 | Decode Ways | Medium | Dynamic Programming | State Transition | 38.0% | 37.5% | all |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 37.5% | all |
| 1434 | Number of Ways to Wear Different Hats to Each Other | Hard | Core DSA | Implementation / Reasoning | 46.0% | 37.5% | all |
| 212 | Word Search II | Hard | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 38.5% | 37.5% | all |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 37.5% | all |
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | Arrays | Sorting / Prefix / Scan | 65.4% | 37.5% | all |
| 44 | Wildcard Matching | Hard | Core DSA | Implementation / Reasoning | 32.0% | 37.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 37.5% | all |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 71.0% | 37.5% | all |
| 2222 | Number of Ways to Select Buildings | Medium | Core DSA | Implementation / Reasoning | 50.9% | 37.5% | all |
| 962 | Maximum Width Ramp | Medium | Arrays | Sorting / Prefix / Scan | 55.9% | 37.5% | all |
| 851 | Loud and Rich | Medium | Core DSA | Implementation / Reasoning | 63.5% | 37.5% | all |
| 696 | Count Binary Substrings | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 70.4% | 37.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 37.5% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 37.5% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 37.5% | all |
| 213 | House Robber II | Medium | Dynamic Programming | State Transition | 44.9% | 37.5% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 37.5% | all |