TS

Two Sigma

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

Showing 23 of 23 questions

1
MediumMinimum Operations to Reduce an Integer to 0βœ“ Our Solution
100
Dynamic ProgrammingGreedyBit Manipulation
2
MediumNumber of Provincesβœ“ Our Solution
100
Depth-First SearchBreadth-First SearchUnion FindGraph
3
MediumRandom Pick with Weightβœ“ Our Solution
98
ArrayMathBinary SearchPrefix Sum+1
4
MediumMaximum Subarray Sum with One Deletionβœ“ Our Solution
96
ArrayDynamic Programming
5
MediumMultiply Stringsβœ“ Our Solution
94
MathStringSimulation
6
HardWildcard Matchingβœ“ Our Solution
94
StringDynamic ProgrammingGreedyRecursion
7
MediumLongest String Chainβœ“ Our Solution
94
ArrayHash TableTwo PointersString+2
8
MediumGame of Lifeβœ“ Our Solution
94
ArrayMatrixSimulation
9
EasyPower of Fourβœ“ Our Solution
94
MathBit ManipulationRecursion
10
EasyIntersection of Two Arraysβœ“ Our Solution
94
ArrayHash TableTwo PointersBinary Search+1
11
MediumMaximum Sum Circular Subarrayβœ“ Our Solution
94
ArrayDivide and ConquerDynamic ProgrammingQueue+1
12
HardWord Search IIβœ“ Our Solution
91
ArrayStringBacktrackingTrie+1
13
HardMerge k Sorted Listsβœ“ Our Solution
72
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
14
HardParallel Courses IIIβœ“ Our Solution
72
ArrayDynamic ProgrammingGraphTopological Sort
15
MediumDesign Memory Allocatorβœ“ Our Solution
65
ArrayHash TableDesignSimulation
16
HardMinimum Space Wasted From Packagingβœ“ Our Solution
65
ArrayBinary SearchSortingPrefix Sum
17
EasyDesign HashMapβœ“ Our Solution
65
ArrayHash TableLinked ListDesign+1
18
MediumSearch Suggestions Systemβœ“ Our Solution
56
ArrayStringBinary SearchTrie+2
19
MediumDesign Tic-Tac-Toe
56
ArrayHash TableDesignMatrix+1
20
HardRobot Room Cleaner
56
BacktrackingInteractive
21
MediumSum of Square Numbersβœ“ Our Solution
56
MathTwo PointersBinary Search
22
MediumMeeting Rooms II
56
ArrayTwo PointersGreedySorting+2
23
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
56
ArrayDynamic Programming