Samsung LeetCode interview questions

Explore Samsung questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 55

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Longest Increasing Subsequence Array Binary Search Dynamic Programming +1 MEDIUM	Medium	100.0%	0.6%
Burst Balloons Array Dynamic Programming HARD	Hard	100.0%	0.6%
Substring with Concatenation of All Words Hash Table String Sliding Window HARD	Hard	95.1%	0.4%
Guess Number Higher or Lower Binary Search Interactive EASY	Easy	95.1%	0.6%
Trapping Rain Water Array Two Pointers Dynamic Programming +2 HARD	Hard	92.3%	0.7%
Vertical Order Traversal of a Binary Tree Hash Table Tree Depth-First Search +3 HARD	Hard	92.3%	0.5%
LRU Cache Hash Table Linked List Design +1 MEDIUM	Medium	92.3%	0.5%
Number of Paths with Max Score Array Dynamic Programming Matrix HARD	Hard	92.3%	0.6%
Minimum Cost of a Path With Special Roads Array Graph Theory Heap (Priority Queue) +1 MEDIUM	Medium	92.3%	0.4%
Minimize Deviation in Array Array Greedy Heap (Priority Queue) +1 HARD	Hard	92.3%	0.5%
Minimum Number of Operations to Make String Sorted Hash Table Math String +3 HARD	Hard	92.3%	0.5%
Find Maximum Value in a Constrained Sequence Array Greedy MEDIUM	Medium	92.3%	0.6%
Stone Game IX Array Math Greedy +5 MEDIUM	Medium	89.2%	0.6%
Partition Array Into Two Arrays to Minimize Sum Difference Array Two Pointers Binary Search +6 HARD	Hard	89.2%	0.2%
Largest 1-Bordered Square Array Dynamic Programming Matrix MEDIUM	Medium	89.2%	0.5%
Maximum Height by Stacking Cuboids Array Dynamic Programming Sorting HARD	Hard	89.2%	0.6%
Maximum Product of Two Elements in an Array Array Sorting Heap (Priority Queue) EASY	Easy	89.2%	0.8%
Number of Nodes in the Sub-Tree With the Same Label Hash Table Tree Depth-First Search +3 MEDIUM	Medium	89.2%	0.6%
Find the Width of Columns of a Grid Array Matrix EASY	Easy	89.2%	0.7%
Design Graph With Shortest Path Calculator Graph Theory Design Heap (Priority Queue) +1 HARD	Hard	89.2%	0.7%

Showing 1–20 of 55 matching problems · All Problems

Samsung LeetCode Interview Questions | Grind Practice