R
Rubrik
36 questions tracked30 with solutions
Frequency scoreSorted highest β lowest frequencyβ Our Solution = we have a detailed walkthrough
Showing 36 of 36 questions
2ArrayGreedyMatrixPrefix Sum
4Hash TableLinked ListDesignDoubly-Linked List
5ArrayHash TableMathGeometry+1
6MediumCandy Crush
ArrayTwo PointersMatrixSimulation
7ArrayMathBinary SearchPrefix Sum+1
8HardDistribute Candies Among Children III
MathCombinatorics
9MathCombinatoricsEnumeration
10MathCombinatoricsEnumeration
11ArrayMathDynamic Programming
12Hash TableStringBinary SearchSliding Window+1
13ArrayDynamic ProgrammingSorting
15HardMaximize Subarray Sum After Removing All Occurrences of One Elementβ Our Solution ArrayDynamic ProgrammingSegment Tree
16HardFind X Value of Array II
ArrayMathSegment Tree
18ArrayHash TableMathDesign+1
19ArrayHash TableBinary SearchDesign
20StringDynamic Programming
22MediumWeb Crawler Multithreaded
Depth-First SearchBreadth-First SearchConcurrency
23StringDepth-First SearchDesignTrie
24Linked ListStringStackDesign+2
25MediumWeb Crawler
StringDepth-First SearchBreadth-First SearchInteractive
26ArrayHash TableGreedySorting+2
27StringDynamic Programming
28ArrayQueueSliding WindowHeap (Priority Queue)+1
31ArrayHash TableStringDesign+1
32StringBacktrackingBreadth-First Search
33ArrayDynamic ProgrammingMatrix
34ArrayDynamic ProgrammingGreedyHeap (Priority Queue)
35MediumDesign Bounded Blocking Queue
Concurrency
36ArrayHash TableDesignSimulation