C

Citadel

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

Showing 100 of 100 questions

1
MediumLongest Non-decreasing Subarray From Two Arraysβœ“ Our Solution
100
ArrayDynamic Programming
2
HardBinary Tree Maximum Path Sumβœ“ Our Solution
99
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
3
MediumDelete and Earnβœ“ Our Solution
93
ArrayHash TableDynamic Programming
4
MediumMinimum Knight Moves
93
Breadth-First Search
5
MediumPalindromic Substringsβœ“ Our Solution
87
Two PointersStringDynamic Programming
6
HardSliding Window Maximumβœ“ Our Solution
85
ArrayQueueSliding WindowHeap (Priority Queue)+1
7
HardCount Palindromic Subsequencesβœ“ Our Solution
81
StringDynamic Programming
8
MediumMinimum Equal Sum of Two Arrays After Replacing Zerosβœ“ Our Solution
80
ArrayGreedy
9
HardLFU Cacheβœ“ Our Solution
80
Hash TableLinked ListDesignDoubly-Linked List
10
HardMinimum Operations to Make Numbers Non-positive
78
ArrayBinary Search
11
MediumNumber of Good Binary Strings
76
Dynamic Programming
12
MediumMaximum Total Damage With Spell Castingβœ“ Our Solution
76
ArrayHash TableTwo PointersBinary Search+3
13
MediumMaximum Length of Repeated Subarrayβœ“ Our Solution
74
ArrayBinary SearchDynamic ProgrammingSliding Window+2
14
MediumLRU Cacheβœ“ Our Solution
74
Hash TableLinked ListDesignDoubly-Linked List
15
HardMinimum Costs Using the Train Line
74
ArrayDynamic Programming
16
HardBest Position for a Service Centreβœ“ Our Solution
74
ArrayMathGeometryRandomized
17
MediumEvaluate Divisionβœ“ Our Solution
72
ArrayStringDepth-First SearchBreadth-First Search+3
18
MediumFirst Completely Painted Row or Columnβœ“ Our Solution
72
ArrayHash TableMatrix
19
MediumLongest String Chainβœ“ Our Solution
70
ArrayHash TableTwo PointersString+2
20
MediumMerge Intervalsβœ“ Our Solution
70
ArraySorting
21
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
67
ArrayDynamic Programming
22
HardSerialize and Deserialize Binary Treeβœ“ Our Solution
67
StringTreeDepth-First SearchBreadth-First Search+2
23
MediumFind the Duplicate Numberβœ“ Our Solution
67
ArrayTwo PointersBinary SearchBit Manipulation
24
MediumEvaluate Reverse Polish Notationβœ“ Our Solution
65
ArrayMathStack
25
MediumInsert Delete GetRandom O(1)βœ“ Our Solution
65
ArrayHash TableMathDesign+1
26
HardSudoku Solverβœ“ Our Solution
61
ArrayHash TableBacktrackingMatrix
27
MediumLength of Longest Subarray With at Most K Frequencyβœ“ Our Solution
61
ArrayHash TableSliding Window
28
HardParallel Courses IIIβœ“ Our Solution
61
ArrayDynamic ProgrammingGraphTopological Sort
29
MediumNumber of Islandsβœ“ Our Solution
61
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
30
HardCouples Holding Handsβœ“ Our Solution
57
GreedyDepth-First SearchBreadth-First SearchUnion Find+1
31
HardFind Median from Data Streamβœ“ Our Solution
57
Two PointersDesignSortingHeap (Priority Queue)+1
32
MediumGroup Anagramsβœ“ Our Solution
57
ArrayHash TableStringSorting
33
MediumValidate Binary Search Treeβœ“ Our Solution
57
TreeDepth-First SearchBinary Search TreeBinary Tree
34
MediumMeeting Scheduler
57
ArrayTwo PointersSorting
35
HardEmployee Free Time
57
ArrayLine SweepSortingHeap (Priority Queue)
36
HardMerge k Sorted Listsβœ“ Our Solution
57
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
37
MediumPermutationsβœ“ Our Solution
57
ArrayBacktracking
38
HardRobot Room Cleaner
57
BacktrackingInteractive
39
MediumBinary Tree Zigzag Level Order Traversalβœ“ Our Solution
52
TreeBreadth-First SearchBinary Tree
40
HardDesign Search Autocomplete System
52
StringDepth-First SearchDesignTrie+3
41
52
ArrayBacktracking
42
EasyFizz Buzzβœ“ Our Solution
52
MathStringSimulation
43
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
52
ArrayDynamic ProgrammingGreedy
44
HardRegular Expression Matchingβœ“ Our Solution
52
StringDynamic ProgrammingRecursion
45
HardBest Time to Buy and Sell Stock IIIβœ“ Our Solution
52
ArrayDynamic Programming
46
MediumSearch Suggestions Systemβœ“ Our Solution
52
ArrayStringBinary SearchTrie+2
47
MediumCombination Sumβœ“ Our Solution
52
ArrayBacktracking
48
MediumDesign Circular Queueβœ“ Our Solution
52
ArrayLinked ListDesignQueue
49
HardTrapping Rain Waterβœ“ Our Solution
52
ArrayTwo PointersDynamic ProgrammingStack+1
50
MediumWord Searchβœ“ Our Solution
46
ArrayStringBacktrackingDepth-First Search+1
51
HardDesign Excel Sum Formula
46
ArrayHash TableStringGraph+3
52
EasyClimbing Stairsβœ“ Our Solution
46
MathDynamic ProgrammingMemoization
53
MediumLetter Combinations of a Phone Numberβœ“ Our Solution
46
Hash TableStringBacktracking
54
46
MathBinary Search
55
MediumImplement Trie (Prefix Tree)βœ“ Our Solution
46
Hash TableStringDesignTrie
56
EasyMoving Average from Data Stream
46
ArrayDesignQueueData Stream
57
HardSort Items by Groups Respecting Dependenciesβœ“ Our Solution
46
Depth-First SearchBreadth-First SearchGraphTopological Sort
58
MediumDesign Front Middle Back Queueβœ“ Our Solution
46
ArrayLinked ListDesignQueue+1
59
HardMedian of Two Sorted Arraysβœ“ Our Solution
46
ArrayBinary SearchDivide and Conquer
60
HardFind Servers That Handled Most Number of Requestsβœ“ Our Solution
46
ArrayGreedyHeap (Priority Queue)Ordered Set
61
HardLongest Increasing Path in a Matrixβœ“ Our Solution
46
ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4
62
MediumHouse Robberβœ“ Our Solution
46
ArrayDynamic Programming
63
MediumMaximal Squareβœ“ Our Solution
46
ArrayDynamic ProgrammingMatrix
64
46
ArrayTwo PointersSorting
65
MediumPerfect Squaresβœ“ Our Solution
46
MathDynamic ProgrammingBreadth-First Search
66
MediumMinimum Height Treesβœ“ Our Solution
46
Depth-First SearchBreadth-First SearchGraphTopological Sort
67
HardAlien Dictionary
46
ArrayStringDepth-First SearchBreadth-First Search+2
68
MediumCount Ways To Build Good Stringsβœ“ Our Solution
46
Dynamic Programming
69
HardTransform to Chessboardβœ“ Our Solution
46
ArrayMathBit ManipulationMatrix
70
MediumBest Time to Buy and Sell Stock with Transaction Feeβœ“ Our Solution
37
ArrayDynamic ProgrammingGreedy
71
MediumOpen the Lockβœ“ Our Solution
37
ArrayHash TableStringBreadth-First Search
72
MediumKoko Eating Bananasβœ“ Our Solution
37
ArrayBinary Search
73
MediumPopulating Next Right Pointers in Each Node IIβœ“ Our Solution
37
Linked ListTreeDepth-First SearchBreadth-First Search+1
74
HardMax Points on a Lineβœ“ Our Solution
37
ArrayHash TableMathGeometry
75
MediumInteger to Romanβœ“ Our Solution
37
Hash TableMathString
76
MediumPermutations IIβœ“ Our Solution
37
ArrayBacktrackingSorting
77
MediumPow(x, n)βœ“ Our Solution
37
MathRecursion
78
MediumSimplify Pathβœ“ Our Solution
37
StringStack
79
MediumContainer With Most Waterβœ“ Our Solution
37
ArrayTwo PointersGreedy
80
MediumRotting Orangesβœ“ Our Solution
37
ArrayBreadth-First SearchMatrix
81
MediumLongest Increasing Subsequenceβœ“ Our Solution
37
ArrayBinary SearchDynamic Programming
82
HardRank Transform of a Matrixβœ“ Our Solution
37
ArrayUnion FindGraphTopological Sort+2
83
MediumPaint House
37
ArrayDynamic Programming
84
MediumSubarray Sums Divisible by Kβœ“ Our Solution
37
ArrayHash TablePrefix Sum
85
MediumSearch a 2D Matrix IIβœ“ Our Solution
37
ArrayBinary SearchDivide and ConquerMatrix
86
HardBest Time to Buy and Sell Stock IVβœ“ Our Solution
37
ArrayDynamic Programming
87
HardInsert Delete GetRandom O(1) - Duplicates allowedβœ“ Our Solution
37
ArrayHash TableMathDesign+1
88
HardWord Ladder IIβœ“ Our Solution
37
Hash TableStringBacktrackingBreadth-First Search
89
HardBus Routesβœ“ Our Solution
37
ArrayHash TableBreadth-First Search
90
MediumCourse Scheduleβœ“ Our Solution
37
Depth-First SearchBreadth-First SearchGraphTopological Sort
91
MediumReorganize Stringβœ“ Our Solution
37
Hash TableStringGreedySorting+2
92
MediumLongest Common Subsequenceβœ“ Our Solution
37
StringDynamic Programming
93
MediumEgg Drop With 2 Eggs and N Floorsβœ“ Our Solution
37
MathDynamic Programming
94
MediumCourse Schedule IIβœ“ Our Solution
37
Depth-First SearchBreadth-First SearchGraphTopological Sort
95
MediumPopulating Next Right Pointers in Each Nodeβœ“ Our Solution
37
Linked ListTreeDepth-First SearchBreadth-First Search+1
96
MediumKnight Probability in Chessboardβœ“ Our Solution
37
Dynamic Programming
97
MediumAsteroid Collisionβœ“ Our Solution
37
ArrayStackSimulation
98
HardThe Skyline Problemβœ“ Our Solution
37
ArrayDivide and ConquerBinary Indexed TreeSegment Tree+3
99
HardBasic Calculatorβœ“ Our Solution
37
MathStringStackRecursion
100
MediumCount Number of Maximum Bitwise-OR Subsetsβœ“ Our Solution
37
ArrayBacktrackingBit ManipulationEnumeration