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
Asked on LeetCode
All 36 by time range →- 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