C
Citadel
100 questions tracked88 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
2Dynamic ProgrammingTreeDepth-First SearchBinary Tree
3ArrayHash TableDynamic Programming
4MediumMinimum Knight Moves
Breadth-First Search
5Two PointersStringDynamic Programming
6ArrayQueueSliding WindowHeap (Priority Queue)+1
7StringDynamic Programming
9Hash TableLinked ListDesignDoubly-Linked List
10HardMinimum Operations to Make Numbers Non-positive
ArrayBinary Search
11MediumNumber of Good Binary Strings
Dynamic Programming
12ArrayHash TableTwo PointersBinary Search+3
13ArrayBinary SearchDynamic ProgrammingSliding Window+2
14Hash TableLinked ListDesignDoubly-Linked List
15HardMinimum Costs Using the Train Line
ArrayDynamic Programming
16ArrayMathGeometryRandomized
17ArrayStringDepth-First SearchBreadth-First Search+3
19ArrayHash TableTwo PointersString+2
22StringTreeDepth-First SearchBreadth-First Search+2
23ArrayTwo PointersBinary SearchBit Manipulation
25ArrayHash TableMathDesign+1
26ArrayHash TableBacktrackingMatrix
27ArrayHash TableSliding Window
28ArrayDynamic ProgrammingGraphTopological Sort
29ArrayDepth-First SearchBreadth-First SearchUnion Find+1
30GreedyDepth-First SearchBreadth-First SearchUnion Find+1
31Two PointersDesignSortingHeap (Priority Queue)+1
32ArrayHash TableStringSorting
33TreeDepth-First SearchBinary Search TreeBinary Tree
34MediumMeeting Scheduler
ArrayTwo PointersSorting
35HardEmployee Free Time
ArrayLine SweepSortingHeap (Priority Queue)
36Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
38HardRobot Room Cleaner
BacktrackingInteractive
39TreeBreadth-First SearchBinary Tree
40HardDesign Search Autocomplete System
StringDepth-First SearchDesignTrie+3
43ArrayDynamic ProgrammingGreedy
44StringDynamic ProgrammingRecursion
46ArrayStringBinary SearchTrie+2
48ArrayLinked ListDesignQueue
49ArrayTwo PointersDynamic ProgrammingStack+1
50ArrayStringBacktrackingDepth-First Search+1
51HardDesign Excel Sum Formula
ArrayHash TableStringGraph+3
52MathDynamic ProgrammingMemoization
53Hash TableStringBacktracking
55Hash TableStringDesignTrie
56EasyMoving Average from Data Stream
ArrayDesignQueueData Stream
57Depth-First SearchBreadth-First SearchGraphTopological Sort
58ArrayLinked ListDesignQueue+1
59ArrayBinary SearchDivide and Conquer
60ArrayGreedyHeap (Priority Queue)Ordered Set
61ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4
63ArrayDynamic ProgrammingMatrix
65MathDynamic ProgrammingBreadth-First Search
66Depth-First SearchBreadth-First SearchGraphTopological Sort
67HardAlien Dictionary
ArrayStringDepth-First SearchBreadth-First Search+2
69ArrayMathBit ManipulationMatrix
70ArrayDynamic ProgrammingGreedy
71ArrayHash TableStringBreadth-First Search
73Linked ListTreeDepth-First SearchBreadth-First Search+1
74ArrayHash TableMathGeometry
80ArrayBreadth-First SearchMatrix
81ArrayBinary SearchDynamic Programming
82ArrayUnion FindGraphTopological Sort+2
83MediumPaint House
ArrayDynamic Programming
84ArrayHash TablePrefix Sum
85ArrayBinary SearchDivide and ConquerMatrix
87ArrayHash TableMathDesign+1
88Hash TableStringBacktrackingBreadth-First Search
89ArrayHash TableBreadth-First Search
90Depth-First SearchBreadth-First SearchGraphTopological Sort
91Hash TableStringGreedySorting+2
92StringDynamic Programming
94Depth-First SearchBreadth-First SearchGraphTopological Sort
95Linked ListTreeDepth-First SearchBreadth-First Search+1
98ArrayDivide and ConquerBinary Indexed TreeSegment Tree+3
100ArrayBacktrackingBit ManipulationEnumeration