DS

DE Shaw

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

Showing 100 of 100 questions

1
HardBinary Tree Camerasβœ“ Our Solution
100
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
2
MediumMinimum Size Subarray in Infinite Arrayβœ“ Our Solution
87
ArrayHash TableSliding WindowPrefix Sum
3
MediumMaximum Subsequence Scoreβœ“ Our Solution
82
ArrayGreedySortingHeap (Priority Queue)
4
MediumRemoving Minimum Number of Magic Beansβœ“ Our Solution
82
ArrayGreedySortingEnumeration+1
5
MediumMaximum Points Tourist Can Earnβœ“ Our Solution
80
ArrayDynamic ProgrammingMatrix
6
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
80
Hash TableStringBacktracking
7
EasyRelative Sort Arrayβœ“ Our Solution
80
ArrayHash TableSortingCounting Sort
8
HardMinimum Cost Walk in Weighted Graphβœ“ Our Solution
80
ArrayBit ManipulationUnion FindGraph
9
MediumSum Gameβœ“ Our Solution
80
MathStringGreedyGame Theory
10
MediumMax Number of K-Sum Pairsβœ“ Our Solution
80
ArrayHash TableTwo PointersSorting
11
HardMaximum Points After Collecting Coins From All Nodesβœ“ Our Solution
80
ArrayDynamic ProgrammingBit ManipulationTree+2
12
HardMaximum Strength of K Disjoint Subarraysβœ“ Our Solution
77
ArrayDynamic ProgrammingPrefix Sum
13
HardFind the Sum of the Power of All Subsequencesβœ“ Our Solution
77
ArrayDynamic Programming
14
MediumMinimum Deletions to Make String K-Specialβœ“ Our Solution
77
Hash TableStringGreedySorting+1
15
MediumGreatest Sum Divisible by Threeβœ“ Our Solution
77
ArrayDynamic ProgrammingGreedySorting
16
EasyDetermine the Winner of a Bowling Gameβœ“ Our Solution
77
ArraySimulation
17
EasyFind the Maximum Divisibility Scoreβœ“ Our Solution
77
Array
18
MediumQuery Kth Smallest Trimmed Numberβœ“ Our Solution
77
ArrayStringDivide and ConquerSorting+3
19
MediumEqual Row and Column Pairsβœ“ Our Solution
77
ArrayHash TableMatrixSimulation
20
HardNumber of Subarrays With AND Value of Kβœ“ Our Solution
77
ArrayBinary SearchBit ManipulationSegment Tree
21
MediumNumber of Substrings Containing All Three Charactersβœ“ Our Solution
77
Hash TableStringSliding Window
22
HardMaximum Deletions on a Stringβœ“ Our Solution
77
StringDynamic ProgrammingRolling HashString Matching+1
23
MediumMedian of a Row Wise Sorted Matrix
77
ArrayBinary SearchMatrix
24
EasyTake Gifts From the Richest Pileβœ“ Our Solution
77
ArrayHeap (Priority Queue)Simulation
25
MediumFind Peak Calling Hours for Each City
77
Database
26
MediumShortest String That Contains Three Stringsβœ“ Our Solution
77
StringGreedyEnumeration
27
HardMinimum Runes to Add to Cast Spell
77
ArrayDepth-First SearchBreadth-First SearchUnion Find+2
28
MediumMinimize Connected Groups by Inserting Interval
77
ArrayBinary SearchSliding WindowSorting
29
HardCount the Number of Incremovable Subarrays IIβœ“ Our Solution
72
ArrayTwo PointersBinary Search
30
HardK-th Smallest in Lexicographical Orderβœ“ Our Solution
69
Trie
31
EasyMajority Elementβœ“ Our Solution
65
ArrayHash TableDivide and ConquerSorting+1
32
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
65
ArrayDynamic Programming
33
HardMinimum Number of Taps to Open to Water a Gardenβœ“ Our Solution
65
ArrayDynamic ProgrammingGreedy
34
HardMinimum Number of Refueling Stopsβœ“ Our Solution
65
ArrayDynamic ProgrammingGreedyHeap (Priority Queue)
35
HardPainting the Wallsβœ“ Our Solution
65
ArrayDynamic Programming
36
MediumMaximum Product Subarrayβœ“ Our Solution
61
ArrayDynamic Programming
37
HardPut Marbles in Bagsβœ“ Our Solution
61
ArrayGreedySortingHeap (Priority Queue)
38
MediumHouse Robberβœ“ Our Solution
61
ArrayDynamic Programming
39
HardSliding Window Maximumβœ“ Our Solution
61
ArrayQueueSliding WindowHeap (Priority Queue)+1
40
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
61
ArrayDynamic ProgrammingGreedy
41
MediumLongest Consecutive Sequenceβœ“ Our Solution
56
ArrayHash TableUnion Find
42
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
56
ArrayHash TableMathDesign+1
43
MediumMaximum Subarrayβœ“ Our Solution
56
ArrayDivide and ConquerDynamic Programming
44
MediumRemove K Digitsβœ“ Our Solution
56
StringStackGreedyMonotonic Stack
45
MediumMaximal Squareβœ“ Our Solution
56
ArrayDynamic ProgrammingMatrix
46
MediumMinimum Number of Pushes to Type Word IIβœ“ Our Solution
49
Hash TableStringGreedySorting+1
47
HardSwim in Rising Waterβœ“ Our Solution
49
ArrayBinary SearchDepth-First SearchBreadth-First Search+3
48
MediumNumber of Wonderful Substringsβœ“ Our Solution
49
Hash TableStringBit ManipulationPrefix Sum
49
MediumTask Schedulerβœ“ Our Solution
49
ArrayHash TableGreedySorting+2
50
MediumAverage Waiting Timeβœ“ Our Solution
49
ArraySimulation
51
MediumFurthest Building You Can Reachβœ“ Our Solution
49
ArrayGreedyHeap (Priority Queue)
52
MediumMin Cost to Connect All Pointsβœ“ Our Solution
49
ArrayUnion FindGraphMinimum Spanning Tree
53
HardMaximum Performance of a Teamβœ“ Our Solution
49
ArrayGreedySortingHeap (Priority Queue)
54
MediumUnique Pathsβœ“ Our Solution
49
MathDynamic ProgrammingCombinatorics
55
MediumHeatersβœ“ Our Solution
49
ArrayTwo PointersBinary SearchSorting
56
MediumGenerate Parenthesesβœ“ Our Solution
49
StringDynamic ProgrammingBacktracking
57
HardSplit Array Largest Sumβœ“ Our Solution
49
ArrayBinary SearchDynamic ProgrammingGreedy+1
58
HardTrapping Rain Waterβœ“ Our Solution
49
ArrayTwo PointersDynamic ProgrammingStack+1
59
MediumJump Game IIβœ“ Our Solution
49
ArrayDynamic ProgrammingGreedy
60
MediumFind First and Last Position of Element in Sorted Arrayβœ“ Our Solution
49
ArrayBinary Search
61
MediumShortest Subarray to be Removed to Make Array Sortedβœ“ Our Solution
49
ArrayTwo PointersBinary SearchStack+1
62
MediumKoko Eating Bananasβœ“ Our Solution
49
ArrayBinary Search
63
MediumFind the Smallest Divisor Given a Thresholdβœ“ Our Solution
49
ArrayBinary Search
64
MediumBasic Calculator IIβœ“ Our Solution
49
MathStringStack
65
HardFind the Shortest Superstringβœ“ Our Solution
40
ArrayStringDynamic ProgrammingBit Manipulation+1
66
HardLongest Valid Parenthesesβœ“ Our Solution
40
StringDynamic ProgrammingStack
67
MediumMaximum ORβœ“ Our Solution
40
ArrayGreedyBit ManipulationPrefix Sum
68
MediumInterleaving Stringβœ“ Our Solution
40
StringDynamic Programming
69
MediumCombination Sumβœ“ Our Solution
40
ArrayBacktracking
70
HardKth Smallest Number in Multiplication Tableβœ“ Our Solution
40
MathBinary Search
71
MediumMaximum Points You Can Obtain from Cardsβœ“ Our Solution
40
ArraySliding WindowPrefix Sum
72
HardNumber of Ways to Reorder Array to Get Same BSTβœ“ Our Solution
40
ArrayMathDivide and ConquerDynamic Programming+6
73
40
ArrayTwo PointersSorting
74
MediumMinimum Size Subarray Sumβœ“ Our Solution
40
ArrayBinary SearchSliding WindowPrefix Sum
75
HardMinimum Number of Visited Cells in a Gridβœ“ Our Solution
40
ArrayDynamic ProgrammingStackBreadth-First Search+4
76
HardMedian of Two Sorted Arraysβœ“ Our Solution
40
ArrayBinary SearchDivide and Conquer
77
MediumCheapest Flights Within K Stopsβœ“ Our Solution
40
Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraph+2
78
EasyValid Parenthesesβœ“ Our Solution
40
StringStack
79
HardReverse Nodes in k-Groupβœ“ Our Solution
40
Linked ListRecursion
80
MediumNext Permutationβœ“ Our Solution
40
ArrayTwo Pointers
81
MediumRotate Imageβœ“ Our Solution
40
ArrayMathMatrix
82
MediumSpiral Matrixβœ“ Our Solution
40
ArrayMatrixSimulation
83
MediumMerge Intervalsβœ“ Our Solution
40
ArraySorting
84
MediumSort Colorsβœ“ Our Solution
40
ArrayTwo PointersSorting
85
MediumEdit Distanceβœ“ Our Solution
40
StringDynamic Programming
86
HardLargest Rectangle in Histogramβœ“ Our Solution
40
ArrayStackMonotonic Stack
87
HardMaximal Rectangleβœ“ Our Solution
40
ArrayDynamic ProgrammingStackMatrix+1
88
MediumTriangleβœ“ Our Solution
40
ArrayDynamic Programming
89
MediumLargest 1-Bordered Squareβœ“ Our Solution
40
ArrayDynamic ProgrammingMatrix
90
EasyContains Duplicateβœ“ Our Solution
40
ArrayHash TableSorting
91
HardBasic Calculatorβœ“ Our Solution
40
MathStringStackRecursion
92
EasyImplement Stack using Queuesβœ“ Our Solution
40
StackDesignQueue
93
HardMaximum Profit in Job Schedulingβœ“ Our Solution
40
ArrayBinary SearchDynamic ProgrammingSorting
94
HardLongest Increasing Path in a Matrixβœ“ Our Solution
40
ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4
95
HardMax Sum of Rectangle No Larger Than Kβœ“ Our Solution
40
ArrayBinary SearchMatrixPrefix Sum+1
96
MediumMake Costs of Paths Equal in a Binary Treeβœ“ Our Solution
40
ArrayDynamic ProgrammingGreedyTree+1
97
MediumPeak Index in a Mountain Arrayβœ“ Our Solution
40
ArrayBinary Search
98
MediumAll Nodes Distance K in Binary Treeβœ“ Our Solution
40
Hash TableTreeDepth-First SearchBreadth-First Search+1
99
MediumOpen the Lockβœ“ Our Solution
40
ArrayHash TableStringBreadth-First Search
100
EasyLinked List Cycleβœ“ Our Solution
40
Hash TableLinked ListTwo Pointers