Problem database last updated: June 20, 2025
31 problems · 2 Easy, 17 Medium, 12 Hard · Ranked #64 of 458
2 Easy
6% · avg 23%
17 Medium
55% · avg 59%
12 Hard
39% · avg 18%
Based on 31 reported problems, Rubrik interviews are significantly harder than average - 39% Hard vs 18% across all companies. The majority (55%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Rubrik puts unusual emphasis on combinatorics (9.7% of problems, 17x the industry average), enumeration (9.7% of problems, 11.8x the industry average), segment-tree (6.5% of problems, 10.6x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (58.1%), math (29%), hash-table (29%), string (25.8%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Maximum Points After Enemy Battles You are given an integer array enemyEnergies denoting the energy values of various enemies. | Medium | Very Likely | arraygreedy | Solve |
Stamping the Grid You are given an m x n binary matrix grid where each cell is either 0 (empty) or 1 (occupied). | Hard | Likely | arraygreedymatrix | Solve |
Alice and Bob Playing Flower Game Alice and Bob are playing a turn-based game on a field, with two lanes of flowers between them. There are x flowers in the first lane between Alice and Bob, and... | Medium | Likely | math | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Random Pick with Weight You are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index. | Medium | Likely | arraymathbinary-search | Solve |
Count Lattice Points Inside a Circle Given a 2D integer array circles where circles[i] = [xi, yi, ri] represents the center (xi, yi) and radius ri of the ith circle drawn on a grid, return the numb... | Medium | Likely | arrayhash-tablemath | Solve |
Find the Sum of Subsequence Powers You are given an integer array nums of length n, and a positive integer k. | Hard | Likely | arraydynamic-programmingsorting | Solve |
Existence of a Substring in a String and Its Reverse Given a string s, find any substring of length 2 which is also present in the reverse of s. | Easy | Likely | hash-tablestring | Solve |
Maximize Subarray Sum After Removing All Occurrences Of One Element You are given an integer array nums. You can perform at most one operation: choose any integer x such that nums remains non-empty after removing all occurrences... | Hard | Likely | segment-treearraydynamic-programming | Solve |
Find X Value of Array II You are given an array of positive integers nums and a positive integer k. You are also given a 2D array queries, where queries[i] = [indexi, valuei, starti, xi... | Hard | Likely | arraymathsegment-tree | Solve |
Manhattan Distances Of All Arrangements Of Pieces You are given three integers m, n, and k. There is a rectangular grid of size m × n containing k identical pieces. Return the sum of Manhattan distances between... | Hard | Likely | mathcombinatorics | Solve |
Distribute Candies Among Children II You are given two positive integers n and limit. | Medium | Likely | mathcombinatoricsenumeration | Solve |
Distribute Candies Among Children I You are given two positive integers n and limit. | Easy | Likely | mathcombinatoricsenumeration | Solve |
Find X Value of Array I You are given an array of positive integers nums, and a positive integer k. | Medium | Likely | arraymathdynamic-programming | Solve |
Find Longest Special Substring That Occurs Thrice II You are given a string s that consists of lowercase English letters. | Medium | Likely | hash-tablestringbinary-search | Solve |
Insert Delete GetRandom O(1) Implement the RandomizedSet class: | Medium | Likely | arrayhash-tablemath | Solve |
Next Permutation A permutation of an array of integers is an arrangement of its members into a sequence or linear order. | Medium | Sometimes | arraytwo-pointers | Solve |
Snapshot Array Implement a SnapshotArray that supports the following interface: | Medium | Sometimes | arrayhash-tablebinary-search | Solve |
Scramble String We can scramble a string s to get a string t using the following algorithm: | Hard | Sometimes | stringdynamic-programming | Solve |
Design Add and Search Words Data Structure Design a data structure that supports adding new words and finding if a string matches any previously added string. | Medium | Sometimes | stringdepth-first-searchdesign | Solve |
Task Scheduler You are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of one task.... | Medium | Sometimes | arrayhash-tablegreedy | Solve |
Sliding Window Maximum You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see... | Hard | Sometimes | arrayqueuesliding-window | Solve |
Edit Distance Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. | Medium | Sometimes | stringdynamic-programming | Solve |
Design a Text Editor Design a text editor with a cursor that can do the following: | Hard | Sometimes | linked-liststringstack | Solve |
Prefix and Suffix Search Design a special dictionary that searches the words in it by a prefix and a suffix. | Hard | Sometimes | arrayhash-tablestring | Solve |
4Sum Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: | Medium | Sometimes | arraytwo-pointerssorting | Solve |
Design Memory Allocator You are given an integer n representing the size of a 0-indexed memory array. All memory units are initially free. | Medium | Sometimes | arrayhash-tabledesign | Solve |
Minimum Number of Refueling Stops A car travels from a starting position to a destination which is target miles east of the starting position. | Hard | Sometimes | arraydynamic-programminggreedy | Solve |
Remove Invalid Parentheses Given a string s that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid. | Hard | Sometimes | stringbacktrackingbreadth-first-search | Solve |
Cherry Pickup II You are given a rows x cols matrix grid representing a field of cherries where grid[i][j] represents the number of cherries that you can collect from the (i, j)... | Hard | Sometimes | arraydynamic-programmingmatrix | Solve |
Building H2O There are two kinds of threads: oxygen and hydrogen. Your goal is to group these threads to form water molecules. | Medium | Sometimes | concurrency | Solve |
Maximum Points After Enemy Battles
SolveYou are given an integer array enemyEnergies denoting the energy values of various enemies.
Stamping the Grid
SolveYou are given an m x n binary matrix grid where each cell is either 0 (empty) or 1 (occupied).
Alice and Bob Playing Flower Game
SolveAlice and Bob are playing a turn-based game on a field, with two lanes of flowers between them. There are x flowers in the first lane between Alice and Bob, and...
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Random Pick with Weight
SolveYou are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index.
Count Lattice Points Inside a Circle
SolveGiven a 2D integer array circles where circles[i] = [xi, yi, ri] represents the center (xi, yi) and radius ri of the ith circle drawn on a grid, return the numb...
Find the Sum of Subsequence Powers
SolveYou are given an integer array nums of length n, and a positive integer k.
Existence of a Substring in a String and Its Reverse
SolveGiven a string s, find any substring of length 2 which is also present in the reverse of s.
Maximize Subarray Sum After Removing All Occurrences Of One Element
SolveYou are given an integer array nums. You can perform at most one operation: choose any integer x such that nums remains non-empty after removing all occurrences...
Find X Value of Array II
SolveYou are given an array of positive integers nums and a positive integer k. You are also given a 2D array queries, where queries[i] = [indexi, valuei, starti, xi...
Manhattan Distances Of All Arrangements Of Pieces
SolveYou are given three integers m, n, and k. There is a rectangular grid of size m × n containing k identical pieces. Return the sum of Manhattan distances between...
Distribute Candies Among Children II
SolveYou are given two positive integers n and limit.
Distribute Candies Among Children I
SolveYou are given two positive integers n and limit.
Find X Value of Array I
SolveYou are given an array of positive integers nums, and a positive integer k.
Find Longest Special Substring That Occurs Thrice II
SolveYou are given a string s that consists of lowercase English letters.
Next Permutation
SolveA permutation of an array of integers is an arrangement of its members into a sequence or linear order.
Snapshot Array
SolveImplement a SnapshotArray that supports the following interface:
Scramble String
SolveWe can scramble a string s to get a string t using the following algorithm:
Design Add and Search Words Data Structure
SolveDesign a data structure that supports adding new words and finding if a string matches any previously added string.
Task Scheduler
SolveYou are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of one task....
Sliding Window Maximum
SolveYou are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Edit Distance
SolveGiven two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.
Design a Text Editor
SolveDesign a text editor with a cursor that can do the following:
Prefix and Suffix Search
SolveDesign a special dictionary that searches the words in it by a prefix and a suffix.
4Sum
SolveGiven an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:
Design Memory Allocator
SolveYou are given an integer n representing the size of a 0-indexed memory array. All memory units are initially free.
Minimum Number of Refueling Stops
SolveA car travels from a starting position to a destination which is target miles east of the starting position.
Remove Invalid Parentheses
SolveGiven a string s that contains parentheses and letters, remove the minimum number of invalid parentheses to make the input string valid.
Cherry Pickup II
SolveYou are given a rows x cols matrix grid representing a field of cherries where grid[i][j] represents the number of cherries that you can collect from the (i, j)...
Building H2O
SolveThere are two kinds of threads: oxygen and hydrogen. Your goal is to group these threads to form water molecules.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Rubrik interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Rubrik interviews focus heavily on array, math, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Rubrik interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Rubrik has been reported to ask 31 distinct coding problems. The most common topics are array, math, hash-table. 2 are Easy difficulty, 17 are Medium, and 12 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 31 reported problems, Rubrik interviews are significantly harder than average - 39% Hard vs 18% across all companies. 55% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, math, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Rubrik coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Rubrik interview with AIarrow_forward
