Rubrik
Data-management loops with distributed-systems depth — coding rounds, then design questions about backup, recovery, and consistency.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: coding and distributed-systems rounds
- 4Architecture deep dive
- 5Behavioral round
Questions
Callback's practice questions and the LeetCode questions Rubrik has been asking, filtered together.
Asked on LeetCode
36 questions · all time
- Maximum Points After Enemy BattlesmediumArrayGreedyfrequency 100.0
- Manhattan Distances of All Arrangements of PieceshardMathCombinatoricsfrequency 70.7
- Maximize Subarray Sum After Removing All Occurrences of One ElementhardArrayHash TableDivide and ConquerDynamic Programming+2frequency 70.7
- Count Lattice Points Inside a CirclemediumArrayHash TableMathGeometry+1frequency 67.6
- Stamping the GridhardArrayGreedyMatrixPrefix Sumfrequency 62.4
- Find Longest Special Substring That Occurs Thrice IImediumHash TableStringBinary SearchSliding Window+1frequency 60.8
- Find X Value of Array ImediumArrayMathDynamic Programmingfrequency 60.8
- Find X Value of Array IIhardArrayMathSegment Treefrequency 60.8
- Alice and Bob Playing Flower GamemediumMathfrequency 59.0
- Candy CrushmediumArrayTwo PointersMatrixSimulationfrequency 59.0
- Distribute Candies Among Children IeasyMathCombinatoricsEnumerationfrequency 57.0
- Distribute Candies Among Children IImediumMathCombinatoricsEnumerationfrequency 57.0
- Distribute Candies Among Children IIIhardMathCombinatoricsfrequency 57.0
- Existence of a Substring in a String and Its ReverseeasyHash TableStringfrequency 57.0
- Find the Sum of Subsequence PowershardArrayDynamic ProgrammingSortingfrequency 57.0
- Random Pick with WeightmediumArrayMathBinary SearchPrefix Sum+1frequency 57.0
- LRU CachemediumHash TableLinked ListDesignDoubly-Linked Listfrequency 49.1
- Minimum Number of Moves to Make PalindromehardTwo PointersStringGreedyBinary Indexed Treefrequency 45.4
- Remove Invalid ParentheseshardStringBacktrackingBreadth-First Searchfrequency 45.4
- Snapshot ArraymediumArrayHash TableBinary SearchDesign+1frequency 45.4
- Web Crawler MultithreadedmediumDepth-First SearchBreadth-First SearchConcurrencyfrequency 45.4
- Next PermutationmediumArrayTwo Pointersfrequency 40.5
- Task Scheduler IImediumArrayHash TableSimulationfrequency 40.5
- Web CrawlermediumStringDepth-First SearchBreadth-First SearchInteractivefrequency 40.5
- 3SummediumArrayTwo PointersSortingfrequency 33.8
- 4SummediumArrayTwo PointersSortingfrequency 33.8
- Count Zero Request ServersmediumArrayHash TableSliding WindowSortingfrequency 33.8
- Design Circular QueuemediumArrayLinked ListDesignQueuefrequency 33.8
- Design Memory AllocatormediumArrayHash TableDesignSimulationfrequency 33.8
- Insert Delete GetRandom O(1)mediumArrayHash TableMathDesign+1frequency 33.8
- Paint FencemediumDynamic Programmingfrequency 33.8
- Range ModulehardDesignSegment TreeOrdered Setfrequency 33.8
- Scramble StringhardStringDynamic Programmingfrequency 33.8
- Smallest String With SwapsmediumArrayHash TableStringDepth-First Search+3frequency 33.8
- Special Binary StringhardStringDivide and ConquerSortingfrequency 33.8
- Task SchedulermediumArrayHash TableGreedySorting+2frequency 33.8