Samsung LeetCode Questions
65 questions all-time · 12 easy · 36 medium · 17 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 100 | 0.5% |
| 2 | Burst Balloons Array, Dynamic Programming | Hard | 98 | 0.6% |
| 3 | Vertical Order Traversal of a Binary Tree Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree | Hard | 96 | 0.5% |
| 4 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 96 | 0.6% |
| 5 | Longest Increasing Subsequence Array, Binary Search, Dynamic Programming | Medium | 96 | 0.6% |
| 6 | Partition Array Into Two Arrays to Minimize Sum Difference Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Sorting, Ordered Set, Bitmask | Hard | 94 | 0.2% |
| 7 | Number of Paths with Max Score Array, Dynamic Programming, Matrix | Hard | 94 | 0.4% |
| 8 | Minimum Cost of a Path With Special Roads Array, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 94 | 0.4% |
| 9 | Minimize Deviation in Array Array, Greedy, Heap (Priority Queue), Ordered Set | Hard | 94 | 0.5% |
| 10 | Stone Game IX Array, Math, Greedy, Counting, Game Theory | Medium | 91 | 0.3% |
| 11 | Largest 1-Bordered Square Array, Dynamic Programming, Matrix | Medium | 91 | 0.5% |
| 12 | Maximum Height by Stacking Cuboids Array, Dynamic Programming, Sorting | Hard | 91 | 0.6% |
| 13 | Maximum Product of Two Elements in an Array Array, Sorting, Heap (Priority Queue) | Easy | 91 | 0.8% |
| 14 | Number of Nodes in the Sub-Tree With the Same Label Hash Table, Tree, Depth-First Search, Breadth-First Search, Counting | Medium | 91 | 0.6% |
| 15 | Find the Width of Columns of a Grid Array, Matrix | Easy | 91 | 0.7% |
| 16 | Design Graph With Shortest Path Calculator Graph Theory, Design, Heap (Priority Queue), Shortest Path | Hard | 91 | 0.7% |
| 17 | Two Sum IV - Input is a BST Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree | Easy | 91 | 0.6% |
| 18 | Faulty Keyboard String, Simulation | Easy | 91 | 0.8% |
| 19 | Minimum Number of Operations to Make String Sorted Hash Table, Math, String, Combinatorics, Counting | Hard | 91 | 0.5% |
| 20 | Count Prefix and Suffix Pairs II Array, String, Trie, Rolling Hash, String Matching, Hash Function | Hard | 91 | 0.3% |
| 21 | Mark Elements on Array by Performing Queries Array, Hash Table, Sorting, Heap (Priority Queue), Simulation | Medium | 91 | 0.5% |
| 22 | Substring with Concatenation of All Words Hash Table, String, Sliding Window | Hard | 91 | 0.3% |
| 23 | Guess Number Higher or Lower Binary Search, Interactive | Easy | 91 | 0.6% |
| 24 | Trapping Rain Water Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack | Hard | 88 | 0.7% |
| 25 | Find Maximum Value in a Constrained Sequence Array, Greedy | Medium | 88 | 0.6% |
| 26 | Two Sum Array, Hash Table | Easy | 82 | 0.6% |
| 27 | Maximize Distance to Closest Person Array | Medium | 82 | 0.5% |
| 28 | Is Graph Bipartite? Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 78 | 0.6% |
| 29 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 73 | 0.6% |
| 30 | Possible Bipartition Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Medium | 73 | 0.5% |
| 31 | Find Peak Element Array, Binary Search | Medium | 73 | 0.5% |
| 32 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 67 | 0.6% |
| 33 | Subarray Product Less Than K Array, Binary Search, Sliding Window, Prefix Sum | Medium | 67 | 0.5% |
| 34 | 3Sum Array, Two Pointers, Sorting | Medium | 60 | 0.4% |
| 35 | Rotate Array Array, Math, Two Pointers | Medium | 60 | 0.5% |
| 36 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 60 | 0.6% |
| 37 | Sort Colors Array, Two Pointers, Sorting | Medium | 60 | 0.7% |
| 38 | Divide Two Integers Math, Bit Manipulation | Medium | 60 | 0.2% |
| 39 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 60 | 0.8% |
| 40 | Valid Parentheses String, Stack | Easy | 49 | 0.4% |
| 41 | Search in Rotated Sorted Array Array, Binary Search | Medium | 49 | 0.5% |
| 42 | Maximum Subarray Array, Divide and Conquer, Dynamic Programming | Medium | 49 | 0.5% |
| 43 | Merge Intervals Array, Sorting | Medium | 49 | 0.5% |
| 44 | Coin Change Array, Dynamic Programming, Breadth-First Search | Medium | 49 | 0.5% |
| 45 | Make Sum Divisible by P Array, Hash Table, Prefix Sum | Medium | 49 | 0.4% |
| 46 | Remove K Digits String, Stack, Greedy, Monotonic Stack | Medium | 49 | 0.4% |
| 47 | Word Search Array, String, Backtracking, Depth-First Search, Matrix | Medium | 49 | 0.5% |
| 48 | Word Ladder Hash Table, String, Breadth-First Search | Hard | 49 | 0.5% |
| 49 | Longest Common Prefix Array, String, Trie | Easy | 49 | 0.5% |
| 50 | Permutations Array, Backtracking | Medium | 49 | 0.8% |
| 51 | Trapping Rain Water II Array, Breadth-First Search, Heap (Priority Queue), Matrix | Hard | 49 | 0.6% |
| 52 | Intersection of Two Linked Lists Hash Table, Linked List, Two Pointers | Easy | 49 | 0.6% |
| 53 | Path with Maximum Probability Array, Graph Theory, Heap (Priority Queue), Shortest Path | Medium | 49 | 0.7% |
| 54 | Merge Sorted Array Array, Two Pointers, Sorting | Easy | 49 | 0.6% |
| 55 | Move Zeroes Array, Two Pointers | Easy | 49 | 0.6% |
| 56 | Next Permutation Array, Two Pointers | Medium | 49 | 0.5% |
| 57 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 49 | 0.4% |
| 58 | Split Array Largest Sum Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum | Hard | 49 | 0.6% |
| 59 | Median of Two Sorted Arrays Array, Binary Search, Divide and Conquer | Hard | 49 | 0.5% |
| 60 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 49 | 0.4% |
| 61 | Rotate Image Array, Math, Matrix | Medium | 49 | 0.8% |
| 62 | Edit Distance String, Dynamic Programming | Medium | 49 | 0.6% |
| 63 | Exam Room Design, Heap (Priority Queue), Ordered Set | Medium | 49 | 0.4% |
| 64 | IPO Array, Greedy, Sorting, Heap (Priority Queue) | Hard | 49 | 0.5% |
| 65 | Check if There is a Valid Path in a Grid Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 49 | 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.