S

Samsung

73 questions tracked71 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 73 of 73 questions

1
HardBurst Balloonsβœ“ Our Solution
100
ArrayDynamic Programming
2
MediumLongest Increasing Subsequenceβœ“ Our Solution
91
ArrayBinary SearchDynamic Programming
3
HardPartition Array Into Two Arrays to Minimize Sum Differenceβœ“ Our Solution
90
ArrayTwo PointersBinary SearchDynamic Programming+3
4
MediumNumber of Islandsβœ“ Our Solution
90
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
5
MediumLRU Cacheβœ“ Our Solution
88
Hash TableLinked ListDesignDoubly-Linked List
6
MediumMinimum Cost of a Path With Special Roadsβœ“ Our Solution
88
ArrayGraphHeap (Priority Queue)Shortest Path
7
HardMaximum Height by Stacking Cuboidsβœ“ Our Solution
86
ArrayDynamic ProgrammingSorting
8
HardTrapping Rain Waterβœ“ Our Solution
86
ArrayTwo PointersDynamic ProgrammingStack+1
9
HardVertical Order Traversal of a Binary Treeβœ“ Our Solution
86
Hash TableTreeDepth-First SearchBreadth-First Search+2
10
HardMinimize Deviation in Arrayβœ“ Our Solution
86
ArrayGreedyHeap (Priority Queue)Ordered Set
11
MediumLargest 1-Bordered Squareβœ“ Our Solution
83
ArrayDynamic ProgrammingMatrix
12
HardNumber of Paths with Max Scoreβœ“ Our Solution
83
ArrayDynamic ProgrammingMatrix
13
EasyMaximum Product of Two Elements in an Arrayβœ“ Our Solution
83
ArraySortingHeap (Priority Queue)
14
MediumNumber of Nodes in the Sub-Tree With the Same Labelβœ“ Our Solution
83
Hash TableTreeDepth-First SearchBreadth-First Search+1
15
EasyFind the Width of Columns of a Gridβœ“ Our Solution
83
ArrayMatrix
16
HardDesign Graph With Shortest Path Calculatorβœ“ Our Solution
83
GraphDesignHeap (Priority Queue)Shortest Path
17
MediumStone Game IXβœ“ Our Solution
83
ArrayMathGreedyCounting+1
18
EasyFaulty Keyboardβœ“ Our Solution
83
StringSimulation
19
HardMinimum Number of Operations to Make String Sortedβœ“ Our Solution
83
MathStringCombinatorics
20
HardCount Prefix and Suffix Pairs IIβœ“ Our Solution
83
ArrayStringTrieRolling Hash+2
21
MediumMark Elements on Array by Performing Queriesβœ“ Our Solution
83
ArrayHash TableSortingHeap (Priority Queue)+1
22
HardSubstring with Concatenation of All Wordsβœ“ Our Solution
83
Hash TableStringSliding Window
23
EasyGuess Number Higher or Lowerβœ“ Our Solution
83
Binary SearchInteractive
24
EasyTwo Sum IV - Input is a BSTβœ“ Our Solution
83
Hash TableTwo PointersTreeDepth-First Search+3
25
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
78
ArrayDynamic Programming
26
MediumIs Graph Bipartite?βœ“ Our Solution
75
Depth-First SearchBreadth-First SearchUnion FindGraph
27
MediumMaximize Distance to Closest Personβœ“ Our Solution
71
Array
28
71
ArrayHash Table
29
66
ArrayTwo PointersSorting
30
MediumRotting Orangesβœ“ Our Solution
66
ArrayBreadth-First SearchMatrix
31
MediumPossible Bipartitionβœ“ Our Solution
66
Depth-First SearchBreadth-First SearchUnion FindGraph
32
MediumMaximum Subarrayβœ“ Our Solution
66
ArrayDivide and ConquerDynamic Programming
33
EasyPalindrome Numberβœ“ Our Solution
61
Math
34
MediumMerge Intervalsβœ“ Our Solution
54
ArraySorting
35
MediumWord Searchβœ“ Our Solution
54
ArrayStringBacktrackingDepth-First Search+1
36
MediumCoin Changeβœ“ Our Solution
54
ArrayDynamic ProgrammingBreadth-First Search
37
MediumMake Sum Divisible by Pβœ“ Our Solution
54
ArrayHash TablePrefix Sum
38
EasyValid Parenthesesβœ“ Our Solution
54
StringStack
39
MediumAdd Two Numbersβœ“ Our Solution
54
Linked ListMathRecursion
40
MediumSubarray Product Less Than Kβœ“ Our Solution
54
ArrayBinary SearchSliding WindowPrefix Sum
41
MediumRotate Arrayβœ“ Our Solution
44
ArrayMathTwo Pointers
42
EasyLongest Common Prefixβœ“ Our Solution
44
StringTrie
43
MediumContainer With Most Waterβœ“ Our Solution
44
ArrayTwo PointersGreedy
44
44
ArrayTwo PointersSorting
45
HardWord Ladderβœ“ Our Solution
44
Hash TableStringBreadth-First Search
46
MediumLongest Palindromic Substringβœ“ Our Solution
44
Two PointersStringDynamic Programming
47
HardFind Median from Data Streamβœ“ Our Solution
44
Two PointersDesignSortingHeap (Priority Queue)+1
48
44
ArrayBacktracking
49
HardMerge k Sorted Listsβœ“ Our Solution
44
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
50
MediumJump Game IIβœ“ Our Solution
44
ArrayDynamic ProgrammingGreedy
51
HardBinary Tree Maximum Path Sumβœ“ Our Solution
44
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
52
MediumReverse Integerβœ“ Our Solution
44
Math
53
MediumMeeting Rooms II
44
ArrayTwo PointersGreedySorting+2
54
HardBest Meeting Point
44
ArrayMathSortingMatrix
55
EasyConvert Sorted Array to Binary Search Treeβœ“ Our Solution
44
ArrayDivide and ConquerTreeBinary Search Tree+1
56
MediumUnique Binary Search Treesβœ“ Our Solution
44
MathDynamic ProgrammingTreeBinary Search Tree+1
57
MediumLowest Common Ancestor of a Binary Search Treeβœ“ Our Solution
44
TreeDepth-First SearchBinary Search TreeBinary Tree
58
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
44
ArrayHash TableMathDesign+1
59
HardK-th Smallest in Lexicographical Orderβœ“ Our Solution
44
Trie
60
MediumKth Largest Element in an Arrayβœ“ Our Solution
44
ArrayDivide and ConquerSortingHeap (Priority Queue)+1
61
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
44
Hash TableStringDesignTrie
62
EasyReverse Linked Listβœ“ Our Solution
44
Linked ListRecursion
63
EasyLinked List Cycleβœ“ Our Solution
44
Hash TableLinked ListTwo Pointers
64
44
MathBinary Search
65
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
44
ArrayBinary Search
66
MediumLargest Submatrix With Rearrangementsβœ“ Our Solution
44
ArrayGreedySortingMatrix
67
MediumAll Nodes Distance K in Binary Treeβœ“ Our Solution
44
Hash TableTreeDepth-First SearchBreadth-First Search+1
68
HardFirst Missing Positiveβœ“ Our Solution
44
ArrayHash Table
69
MediumNearest Exit from Entrance in Mazeβœ“ Our Solution
44
ArrayBreadth-First SearchMatrix
70
MediumSort Colorsβœ“ Our Solution
44
ArrayTwo PointersSorting
71
HardRobot Collisionsβœ“ Our Solution
44
ArrayStackSortingSimulation
72
MediumRemove K Digitsβœ“ Our Solution
44
StringStackGreedyMonotonic Stack
73
MediumSubsetsβœ“ Our Solution
44
ArrayBacktrackingBit Manipulation