Rubrik coding interview questions
Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.
| Progress | Title | Difficulty | Next step |
|---|---|---|---|
| Snapshot ArrayBasics | Medium | Solve | |
| Web Crawler MultithreadedBFS / DFS Basics | Medium | Solve | |
| Design Bounded Blocking QueueConcurrency | Medium | Solve | |
| Distribute Candies Among Children IIMath / Number Theory | Medium | Solve | |
| Candy CrushSimulation | Medium | Solve | |
| Random Pick with WeightBasics | Medium | Solve | |
| LRU CacheLinked Lists | Medium | Solve | |
| Next PermutationRight to Left Traversal | Medium | Solve | |
| Task Scheduler IIHashing | Medium | Solve | |
| Task SchedulerGreedy | Medium | Solve | |
| Web CrawlerBFS / DFS Basics | Medium | Solve | |
| Design Memory AllocatorSimulation | Medium | Solve | |
| Design Circular QueueQueue / Circular Buffer | Medium | Solve | |
| Special Binary StringDivide and Conquer | Hard | Solve | |
| Smallest String With SwapsConnected Components | Medium | Solve | |
| 3SumTwo Sum | Medium | Solve | |
| 4SumTwo Pointer | Medium | Solve | |
| Insert Delete GetRandom O(1)Hash Map + Array | Medium | Solve |
No questions match these filters.
Also reported, being added to AlgoRung (20)
Count Lattice Points Inside a Circle · Maximize Subarray Sum After Removing All Occurrences of One Element · Manhattan Distances of All Arrangements of Pieces · Maximum Points After Enemy Battles · Stamping the Grid · Find X Value of Array II · Find X Value of Array I · Alice and Bob Playing Flower Game · Distribute Candies Among Children I · Distribute Candies Among Children III · Find the Sum of Subsequence Powers · Existence of a Substring in a String and Its Reverse · Minimum Number of Moves to Make Palindrome · Find Longest Special Substring That Occurs Thrice II · Remove Invalid Parentheses · Count Zero Request Servers · Paint Fence · Range Module · Scramble String · Cherry Pickup II
Questions people ask
What coding questions does Rubrik ask most?
Snapshot Array, Web Crawler Multithreaded, Design Bounded Blocking Queue, Distribute Candies Among Children II, Candy Crush, Random Pick with Weight, LRU Cache, Next Permutation.
Which topics come up in Rubrik coding rounds?
design data structure, graphs, dynamic programming, math, heaps, strings.
How hard are Rubrik coding questions?
Of the reported questions, 0 are easy, 17 medium and 1 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.