DSA Doctor
Verified Company Vault
Samsung DSA Interview Questions
66 curated coding interview questions directly asked in Samsung technical rounds, sorted by frequency with recency and difficulty diagnostics.
66
Total Questions
13 (20%)
Easy Problems
36 (55%)
Medium Problems
17 (26%)
Hard Problems
🔥 Most Tested Topics:
Arrays (24)Core DSA (19)Strings (8)Trees (5)Dynamic Programming (5)
📂 Sourced Datasets:
Last 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | 6m |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 100.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 87.5% | all |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 87.5% | all |
| 2029 | Stone Game IX | Medium | Core DSA | Implementation / Reasoning | 30.3% | 87.5% | all |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 23.4% | 87.5% | all |
| 1301 | Number of Paths with Max Score | Hard | Core DSA | Implementation / Reasoning | 42.5% | 87.5% | all |
| 1139 | Largest 1-Bordered Square | Medium | Core DSA | Implementation / Reasoning | 52.1% | 87.5% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 87.5% | all |
| 312 | Burst Balloons | Hard | Core DSA | Implementation / Reasoning | 63.5% | 87.5% | all |
| 1691 | Maximum Height by Stacking Cuboids | Hard | Arrays; Stack / Queue | Sorting / Prefix / Scan; Monotonic Stack / Simulation | 62.0% | 87.5% | all |
| 1464 | Maximum Product of Two Elements in an Array | Easy | Arrays | Sorting / Prefix / Scan | 83.6% | 87.5% | all |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | Medium | Trees | DFS / BFS | 55.4% | 87.5% | all |
| 2639 | Find the Width of Columns of a Grid | Easy | Core DSA | Implementation / Reasoning | 70.5% | 87.5% | all |
| 2642 | Design Graph With Shortest Path Calculator | Hard | Graphs; Stack / Queue; Design | BFS / DFS / Topological Sort; Monotonic Stack / Simulation; Data Structure Design | 65.2% | 87.5% | all |
| 2662 | Minimum Cost of a Path With Special Roads | Medium | Arrays | Sorting / Prefix / Scan | 43.2% | 87.5% | all |
| 653 | Two Sum IV - Input is a BST | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS; Two Pointers | 63.3% | 87.5% | all |
| 1675 | Minimize Deviation in Array | Hard | Arrays | Sorting / Prefix / Scan | 54.0% | 87.5% | all |
| 2810 | Faulty Keyboard | Easy | Core DSA | Implementation / Reasoning | 80.2% | 87.5% | all |
| 1830 | Minimum Number of Operations to Make String Sorted | Hard | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 50.2% | 87.5% | all |
| 3045 | Count Prefix and Suffix Pairs II | Hard | Core DSA | Implementation / Reasoning | 28.4% | 87.5% | all |
| 3080 | Mark Elements on Array by Performing Queries | Medium | Arrays | Sorting / Prefix / Scan | 49.3% | 87.5% | all |
| 30 | Substring with Concatenation of All Words | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 34.4% | 87.5% | all |
| 374 | Guess Number Higher or Lower | Easy | Core DSA | Implementation / Reasoning | 57.6% | 87.5% | all |
| 3796 | Find Maximum Value in a Constrained Sequence | Medium | Arrays | Sorting / Prefix / Scan | 62.2% | 87.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 75.0% | all |
| 785 | Is Graph Bipartite? | Medium | Graphs | BFS / DFS / Topological Sort | 59.3% | 75.0% | all |
| 849 | Maximize Distance to Closest Person | Medium | Core DSA | Implementation / Reasoning | 49.8% | 75.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 75.0% | all |
| 886 | Possible Bipartition | Medium | Dynamic Programming | State Transition | 52.6% | 75.0% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 75.0% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 62.5% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |
| 189 | Rotate Array | Medium | Arrays | Sorting / Prefix / Scan | 44.9% | 62.5% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 62.5% | all |
| 713 | Subarray Product Less Than K | Medium | Arrays | Sorting / Prefix / Scan | 54.3% | 62.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 62.5% | all |
| 29 | Divide Two Integers | Medium | Core DSA | Implementation / Reasoning | 19.8% | 62.5% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 50.0% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 50.0% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 50.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 50.0% | all |
| 1590 | Make Sum Divisible by P | Medium | Arrays | Sorting / Prefix / Scan | 42.6% | 50.0% | all |
| 402 | Remove K Digits | Medium | Core DSA | Implementation / Reasoning | 36.9% | 50.0% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 50.0% | all |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 50.0% | all |
| 407 | Trapping Rain Water II | Hard | Core DSA | Two Pointers | 64.1% | 50.0% | all |
| 160 | Intersection of Two Linked Lists | Easy | Linked List | Two Pointers | 63.7% | 50.0% | all |
| 1514 | Path with Maximum Probability | Medium | Arrays | Sorting / Prefix / Scan | 65.5% | 50.0% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 50.0% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 50.0% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 50.0% | all |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 50.0% | all |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 50.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 50.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 50.0% | all |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 50.0% | all |
| 855 | Exam Room | Medium | Core DSA | Implementation / Reasoning | 43.5% | 50.0% | all |
| 502 | IPO | Hard | Core DSA | Implementation / Reasoning | 53.5% | 50.0% | all |
| 1391 | Check if There is a Valid Path in a Grid | Medium | Strings | Hashing / Sliding Window | 64.5% | 50.0% | all |