Question 1

Burst Balloons — Samsung Interview Question

Accepted Answer

"Burst Balloons" is a hard difficulty problem asked at Samsung interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/burst-balloons

Question 2

Longest Increasing Subsequence — Samsung Interview Question

Accepted Answer

"Longest Increasing Subsequence" is a medium difficulty problem asked at Samsung interviews. It covers the following topics: Array, Binary Search, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/longest-increasing-subsequence

Question 3

Partition Array Into Two Arrays to Minimize Sum Difference — Samsung Interview Question

Accepted Answer

"Partition Array Into Two Arrays to Minimize Sum Difference" is a hard difficulty problem asked at Samsung interviews. It covers the following topics: Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Ordered Set, Bitmask. You can practice it on LeetCode: https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference

Question 4

Number of Islands — Samsung Interview Question

Accepted Answer

"Number of Islands" is a medium difficulty problem asked at Samsung interviews. It covers the following topics: Array, Depth-First Search, Breadth-First Search, Union Find, Matrix. You can practice it on LeetCode: https://leetcode.com/problems/number-of-islands

Question 5

LRU Cache — Samsung Interview Question

Accepted Answer

"LRU Cache" is a medium difficulty problem asked at Samsung interviews. It covers the following topics: Hash Table, Linked List, Design, Doubly-Linked List. You can practice it on LeetCode: https://leetcode.com/problems/lru-cache

Question 6

Minimum Cost of a Path With Special Roads — Samsung Interview Question

Accepted Answer

"Minimum Cost of a Path With Special Roads" is a medium difficulty problem asked at Samsung interviews. It covers the following topics: Array, Graph, Heap (Priority Queue), Shortest Path. You can practice it on LeetCode: https://leetcode.com/problems/minimum-cost-of-a-path-with-special-roads

#	Question Title	Difficulty	Frequency	Topics
1	Burst Balloons	HARD	100.0	ArrayDynamic Programming
2	Longest Increasing Subsequence	MEDIUM	91.3	ArrayBinary SearchDynamic Programming
3	Partition Array Into Two Arrays to Minimize Sum Difference	HARD	89.5	ArrayTwo PointersBinary Search+4
4	Number of Islands	MEDIUM	89.5	ArrayDepth-First SearchBreadth-First Search+2
5	LRU Cache	MEDIUM	87.6	Hash TableLinked ListDesign+1
6	Minimum Cost of a Path With Special Roads	MEDIUM	87.6	ArrayGraphHeap (Priority Queue)+1
7	Maximum Height by Stacking Cuboids	HARD	85.5	ArrayDynamic ProgrammingSorting
8	Trapping Rain Water	HARD	85.5	ArrayTwo PointersDynamic Programming+2
9	Vertical Order Traversal of a Binary Tree	HARD	85.5	Hash TableTreeDepth-First Search+3
10	Minimize Deviation in Array	HARD	85.5	ArrayGreedyHeap (Priority Queue)+1

Explore 450+ Companies

Companies

Samsung

Want to see more?

Samsung Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Samsung

Want to see more?

Samsung Interview Questions

Ai Assistant Kas