Samsung Interview Questions — 73 DSA Problems 71 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Samsung LeetCode questions for software engineering interviews.
Burst Balloons (HARD) — Array, Dynamic Programming Longest Increasing Subsequence (MEDIUM) — Array, Binary Search, Dynamic Programming Partition Array Into Two Arrays to Minimize Sum Difference (HARD) — Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Ordered Set, Bitmask Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List Minimum Cost of a Path With Special Roads (MEDIUM) — Array, Graph, Heap (Priority Queue), Shortest Path Maximum Height by Stacking Cuboids (HARD) — Array, Dynamic Programming, Sorting Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack Vertical Order Traversal of a Binary Tree (HARD) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree Minimize Deviation in Array (HARD) — Array, Greedy, Heap (Priority Queue), Ordered Set Largest 1-Bordered Square (MEDIUM) — Array, Dynamic Programming, Matrix Number of Paths with Max Score (HARD) — Array, Dynamic Programming, Matrix Maximum Product of Two Elements in an Array (EASY) — Array, Sorting, Heap (Priority Queue) Number of Nodes in the Sub-Tree With the Same Label (MEDIUM) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Counting Find the Width of Columns of a Grid (EASY) — Array, Matrix Design Graph With Shortest Path Calculator (HARD) — Graph, Design, Heap (Priority Queue), Shortest Path Stone Game IX (MEDIUM) — Array, Math, Greedy, Counting, Game Theory Faulty Keyboard (EASY) — String, Simulation Minimum Number of Operations to Make String Sorted (HARD) — Math, String, Combinatorics Count Prefix and Suffix Pairs II (HARD) — Array, String, Trie, Rolling Hash, String Matching, Hash Function Mark Elements on Array by Performing Queries (MEDIUM) — Array, Hash Table, Sorting, Heap (Priority Queue), Simulation Substring with Concatenation of All Words (HARD) — Hash Table, String, Sliding Window Guess Number Higher or Lower (EASY) — Binary Search, Interactive Two Sum IV - Input is a BST (EASY) — Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming Is Graph Bipartite? (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph Maximize Distance to Closest Person (MEDIUM) — Array Two Sum (EASY) — Array, Hash Table 3Sum (MEDIUM) — Array, Two Pointers, Sorting Rotting Oranges (MEDIUM) — Array, Breadth-First Search, Matrix Possible Bipartition (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming Palindrome Number (EASY) — Math Merge Intervals (MEDIUM) — Array, Sorting Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search Make Sum Divisible by P (MEDIUM) — Array, Hash Table, Prefix Sum Valid Parentheses (EASY) — String, Stack Add Two Numbers (MEDIUM) — Linked List, Math, Recursion Subarray Product Less Than K (MEDIUM) — Array, Binary Search, Sliding Window, Prefix Sum Rotate Array (MEDIUM) — Array, Math, Two Pointers Longest Common Prefix (EASY) — String, Trie Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy 4Sum (MEDIUM) — Array, Two Pointers, Sorting Word Ladder (HARD) — Hash Table, String, Breadth-First Search Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming Find Median from Data Stream (HARD) — Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream N-Queens (HARD) — Array, Backtracking Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort Jump Game II (MEDIUM) — Array, Dynamic Programming, Greedy S
Samsung 73 questions tracked 71 with solutions
📊 All Time 73 📅 Last 6 Months 8 🔥 Last 3 Months 6 ⚡ Last 30 Days 1
Sorted highest → lowest frequency ✓ Our Solution = we have a detailed walkthrough
Showing 73 of 73 questions
2 Array Binary Search Dynamic Programming
3 Hard Partition Array Into Two Arrays to Minimize Sum Difference ✓ Our Solution Array Two Pointers Binary Search Dynamic Programming +3
4 Array Depth-First Search Breadth-First Search Union Find +1
5 Hash Table Linked List Design Doubly-Linked List
6 Array Graph Heap (Priority Queue) Shortest Path
7 Array Dynamic Programming Sorting
8 Array Two Pointers Dynamic Programming Stack +1
9 Hash Table Tree Depth-First Search Breadth-First Search +2
10 Array Greedy Heap (Priority Queue) Ordered Set
11 Array Dynamic Programming Matrix
12 Array Dynamic Programming Matrix
13 Array Sorting Heap (Priority Queue)
14 Medium Number of Nodes in the Sub-Tree With the Same Label ✓ Our Solution Hash Table Tree Depth-First Search Breadth-First Search +1
16 Graph Design Heap (Priority Queue) Shortest Path
17 Array Math Greedy Counting +1
20 Array String Trie Rolling Hash +2
21 Array Hash Table Sorting Heap (Priority Queue) +1
22 Hash Table String Sliding Window
24 Hash Table Two Pointers Tree Depth-First Search +3
26 Depth-First Search Breadth-First Search Union Find Graph
30 Array Breadth-First Search Matrix
31 Depth-First Search Breadth-First Search Union Find Graph
32 Array Divide and Conquer Dynamic Programming
35 Array String Backtracking Depth-First Search +1
36 Array Dynamic Programming Breadth-First Search
37 Array Hash Table Prefix Sum
40 Array Binary Search Sliding Window Prefix Sum
45 Hash Table String Breadth-First Search
46 Two Pointers String Dynamic Programming
47 Two Pointers Design Sorting Heap (Priority Queue) +1
49 Linked List Divide and Conquer Heap (Priority Queue) Merge Sort
50 Array Dynamic Programming Greedy
51 Dynamic Programming Tree Depth-First Search Binary Tree
53 Medium Meeting Rooms II
Array Two Pointers Greedy Sorting +2
54 Hard Best Meeting Point
Array Math Sorting Matrix
55 Array Divide and Conquer Tree Binary Search Tree +1
56 Math Dynamic Programming Tree Binary Search Tree +1
57 Tree Depth-First Search Binary Search Tree Binary Tree
58 Array Hash Table Math Design +1
60 Array Divide and Conquer Sorting Heap (Priority Queue) +1
61 Hash Table String Design Trie
63 Hash Table Linked List Two Pointers
67 Hash Table Tree Depth-First Search Breadth-First Search +1
69 Array Breadth-First Search Matrix
71 Array Stack Sorting Simulation
72 String Stack Greedy Monotonic Stack
73 Array Backtracking Bit Manipulation
