Samsung Coding Interview Questions: 24 Tagged Problems
24 coding problems tagged Samsung — 6 easy · 15 medium · 3 hard — with solutions in 13 languages. Plus a 2-week study plan by topic.
- Problems: 24
- By difficulty: 6 easy · 15 medium · 3 hard
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
24 problems the CodeKairo catalogue tags as commonly asked in Samsung's coding rounds — 6 easy, 15 medium and 3 hard — each judged by hidden tests in 13 languages. The most common topics among them are Trees (8), Depth-First Search (7) and Breadth-First Search (5). The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Samsung, which CodeKairo is not affiliated with.
Samsung study plan by topic
All 24 problems tagged Samsung over 2 weeks, about 13 h 15 min of solving, grouped by technique in the order they build on each other — Counting, Two Pointers, Prefix Sum and Stack and 11 more.
Week 1: Counting, Two Pointers, Prefix Sum +6
12 problems on Counting, Two Pointers, Prefix Sum, Stack, Matrix, Enumeration, Recursion, Bit Manipulation and Number Theory, easiest first within each topic.
- Minimum Number of Frogs Croaking Medium
- Nth Node From End of Linked List Easy
- Count Triplets With Sum Smaller Than X Medium
- Longest Subarray With Sum Zero Medium
- Kth Largest Element in BST Easy
- Infix to Postfix Medium
- Largest 1-Bordered Square Medium
- Number of Paths with Max Score Hard
- Count Number of Maximum Bitwise-OR Subsets Medium
- Add 1 to a Number Represented as Linked List Medium
- Minimize XOR Medium
- Smallest Value After Replacing With Sum of Prime Factors Medium
Week 2: Trees, Graph, Breadth-First Search +3
12 problems on Trees, Graph, Breadth-First Search, Shortest Path, Minimum Spanning Tree and Dynamic Programming, easiest first within each topic.
- Left View of Binary Tree Easy
- Children Sum in a Binary Tree Easy
- Nodes at Distance K from Root Easy
- Level of a Node in Binary Tree Easy
- Top View of Binary Tree Medium
- Floor in BST Medium
- Largest BST in a Binary Tree Medium
- Articulation Points in a Graph Hard
- Knight Walk Medium
- Floyd Warshall Medium
- Minimum Spanning Tree Medium
- Boolean Parenthesization Hard
All problems tagged Samsung
Easy (6)
- Nth Node From End of Linked List Linked List, Two Pointers
- Level of a Node in Binary Tree Tree, Breadth-First Search, Depth-First Search
- Kth Largest Element in BST Tree, Depth-First Search, Stack
- Nodes at Distance K from Root Tree, Depth-First Search, Breadth-First Search
- Children Sum in a Binary Tree Tree, Depth-First Search
- Left View of Binary Tree Tree, Breadth-First Search, Depth-First Search
Medium (15)
- Add 1 to a Number Represented as Linked List Linked List, Math, Recursion
- Largest BST in a Binary Tree Tree, Depth-First Search, Dynamic Programming
- Floor in BST Tree, Binary Search
- Top View of Binary Tree Tree, Breadth-First Search, Hash Table
- Knight Walk Breadth-First Search, Matrix
- Minimum Spanning Tree Graph, Union Find, Minimum Spanning Tree
- Floyd Warshall Graph, Dynamic Programming, Shortest Path
- Largest 1-Bordered Square Array, Dynamic Programming, Matrix
- Infix to Postfix String, Stack
- Count Number of Maximum Bitwise-OR Subsets Bit Manipulation, Backtracking, Enumeration
- Minimize XOR Bit Manipulation, Greedy
- Smallest Value After Replacing With Sum of Prime Factors Math, Number Theory, Simulation
- Minimum Number of Frogs Croaking String, Greedy, Counting
- Count Triplets With Sum Smaller Than X Array, Two Pointers, Sorting
- Longest Subarray With Sum Zero Array, Hash Table, Prefix Sum
Hard (3)
- Articulation Points in a Graph Graph, Depth-First Search
- Boolean Parenthesization String, Dynamic Programming
- Number of Paths with Max Score Array, Dynamic Programming, Matrix
Topics Samsung asks most
- Trees 8 problems
- Depth-First Search 7 problems
- Breadth-First Search 5 problems
- Dynamic Programming 5 problems
- Arrays 4 problems
- Strings 3 problems
- Matrix 3 problems
- Greedy 3 problems
- Graph 3 problems
- Hash Table 2 problems
- Math 2 problems
- Two Pointers 2 problems