Rubrik Interview Questions

Showing 38 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Rubrik. The higher the ranking, the more likely you'll encounter it in a Rubrik interview.

Question

Frequency

Difficulty

Maximum Points After Enemy Battles

You're given your initial points and information about multiple enemy battles. Each battle can increase or decrease your points. Determine the maximum points you can have after strategically fighting a subset of the enemies.

ArraysGreedy Algorithms

If you have a Rubrik interview, it's very likely that you will get this question

#1. Maximum Points After Enemy Battles

You're given your initial points and information about multiple enemy battles. Each battle can increase or decrease your points. Determine the maximum points you can have after strategically fighting a subset of the enemies.

ArraysGreedy Algorithms

This question is very likely to be asked in your Rubrik interview

Maximize Subarray Sum After Removing All Occurrences of One Element

Given an array, you can remove all occurrences of a single element. Find the maximum possible sum of a subarray after performing this removal.

ArraysSliding Windows

If you have a Rubrik interview, it's very likely that you will get this question

#2. Maximize Subarray Sum After Removing All Occurrences of One Element

Given an array, you can remove all occurrences of a single element. Find the maximum possible sum of a subarray after performing this removal.

ArraysSliding Windows

This question is very likely to be asked in your Rubrik interview

Manhattan Distances of All Arrangements of Pieces

You're given the starting and target positions of multiple pieces on a grid. Find the sum of Manhattan distances for every possible arrangement of moving the pieces from their starting to target positions.

ArraysGreedy Algorithms

If you have a Rubrik interview, it's very likely that you will get this question

#3. Manhattan Distances of All Arrangements of Pieces

You're given the starting and target positions of multiple pieces on a grid. Find the sum of Manhattan distances for every possible arrangement of moving the pieces from their starting to target positions.

ArraysGreedy Algorithms

This question is very likely to be asked in your Rubrik interview

Stamping the Grid

Determine if you can transform a grid of zeros to a target grid using a stamp of a given size. You can stamp multiple times, and the stamp must fit within the grid's boundaries.

ArraysSliding Windows

If you have a Rubrik interview, it's very likely that you will get this question

#4. Stamping the Grid

Determine if you can transform a grid of zeros to a target grid using a stamp of a given size. You can stamp multiple times, and the stamp must fit within the grid's boundaries.

ArraysSliding Windows

This question is very likely to be asked in your Rubrik interview

Count Lattice Points Inside a Circle

You are given several circles defined by their center coordinates and radius. Your task is to count the number of distinct lattice points (points with integer coordinates) that lie inside or on the boundary of at least one of these circles.

Somewhat likely

If you have a Rubrik interview, you might get this question

#5. Count Lattice Points Inside a Circle

You are given several circles defined by their center coordinates and radius. Your task is to count the number of distinct lattice points (points with integer coordinates) that lie inside or on the boundary of at least one of these circles.

This question is somewhat likely to be asked in your Rubrik interview

Alice and Bob Playing Flower Game

Alice and Bob are playing a game with flowers. Determine who wins based on the number of odd and even flower pots available.

Greedy AlgorithmsArrays

Somewhat likely

If you have a Rubrik interview, you might get this question

#6. Alice and Bob Playing Flower Game

Alice and Bob are playing a game with flowers. Determine who wins based on the number of odd and even flower pots available.

Greedy AlgorithmsArrays

This question is somewhat likely to be asked in your Rubrik interview

Candy Crush

Simulate the Candy Crush game. Repeated sequences of the same candy type (3 or more) should be removed until no more such sequences exist.

ArraysTwo Pointers

Somewhat likely

If you have a Rubrik interview, you might get this question

#7. Candy Crush

Simulate the Candy Crush game. Repeated sequences of the same candy type (3 or more) should be removed until no more such sequences exist.

ArraysTwo Pointers

This question is somewhat likely to be asked in your Rubrik interview

Random Pick with Weight

You're given an array representing weights. Implement a function to randomly pick an index from the array, where the probability of picking each index is proportional to its weight.

ArraysBinary Search

Somewhat likely

If you have a Rubrik interview, you might get this question

#8. Random Pick with Weight

You're given an array representing weights. Implement a function to randomly pick an index from the array, where the probability of picking each index is proportional to its weight.

ArraysBinary Search

This question is somewhat likely to be asked in your Rubrik interview

Find X Value of Array I

ArraysTwo PointersSliding Windows

Somewhat likely

If you have a Rubrik interview, you might get this question

#9. Find X Value of Array I

ArraysTwo PointersSliding Windows

This question is somewhat likely to be asked in your Rubrik interview

Distribute Candies Among Children III

You have a certain number of candies to distribute among children, but there are rules on how many each child can receive. Determine the number of ways to distribute all the candies following these constraints.

ArraysGreedy Algorithms

Somewhat likely

If you have a Rubrik interview, you might get this question

#10. Distribute Candies Among Children III

You have a certain number of candies to distribute among children, but there are rules on how many each child can receive. Determine the number of ways to distribute all the candies following these constraints.

ArraysGreedy Algorithms

This question is somewhat likely to be asked in your Rubrik interview

Distribute Candies Among Children I

You have a certain number of candies to distribute among a given number of children. Find out how many children will receive the maximum number of candies.

ArraysDynamic Programming

Somewhat likely

If you have a Rubrik interview, you might get this question

#11. Distribute Candies Among Children I

You have a certain number of candies to distribute among a given number of children. Find out how many children will receive the maximum number of candies.

ArraysDynamic Programming

This question is somewhat likely to be asked in your Rubrik interview

Existence of a Substring in a String and Its Reverse

Determine if a given string contains a substring where the reverse of that substring also exists within the original string.

StringsTwo PointersSliding Windows

Somewhat likely

If you have a Rubrik interview, you might get this question

#12. Existence of a Substring in a String and Its Reverse

Determine if a given string contains a substring where the reverse of that substring also exists within the original string.

StringsTwo PointersSliding Windows

This question is somewhat likely to be asked in your Rubrik interview

LRU Cache

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked ListsDesign

Somewhat likely

If you have a Rubrik interview, you might get this question

#13. LRU Cache

Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.

Linked ListsDesign

This question is somewhat likely to be asked in your Rubrik interview

Find the Sum of Subsequence Powers

Given an array of numbers, find all possible subsequences. Calculate the sum of each subsequence where each number is raised to the power of its position in the subsequence.

ArraysTwo PointersSliding Windows

Somewhat likely

If you have a Rubrik interview, you might get this question

#14. Find the Sum of Subsequence Powers

Given an array of numbers, find all possible subsequences. Calculate the sum of each subsequence where each number is raised to the power of its position in the subsequence.

ArraysTwo PointersSliding Windows

This question is somewhat likely to be asked in your Rubrik interview

Find X Value of Array II

Given an array, you repeatedly choose two elements and replace one with their bitwise XOR. The goal is to minimize the remaining element after several operations.

ArraysSliding Windows

If you have a Rubrik interview, it's unlikely that you will get this question

#15. Find X Value of Array II

Given an array, you repeatedly choose two elements and replace one with their bitwise XOR. The goal is to minimize the remaining element after several operations.

ArraysSliding Windows

This question is not likely to be asked in your Rubrik interview

Distribute Candies Among Children II

You have a certain number of candies to distribute among children. Each child has a limit to how many candies they can receive; distribute the candies as fairly as possible up to a given limit per child.

ArraysDynamic Programming

If you have a Rubrik interview, it's unlikely that you will get this question

#16. Distribute Candies Among Children II

You have a certain number of candies to distribute among children. Each child has a limit to how many candies they can receive; distribute the candies as fairly as possible up to a given limit per child.

ArraysDynamic Programming

This question is not likely to be asked in your Rubrik interview

Find Longest Special Substring That Occurs Thrice II

Find the length of the longest substring within a given string that appears at least three times, with the occurrences allowed to overlap. The substring must also consist of only one distinct character.

ArraysTwo PointersSliding Windows

If you have a Rubrik interview, it's unlikely that you will get this question

#17. Find Longest Special Substring That Occurs Thrice II

Find the length of the longest substring within a given string that appears at least three times, with the occurrences allowed to overlap. The substring must also consist of only one distinct character.

ArraysTwo PointersSliding Windows

This question is not likely to be asked in your Rubrik interview

Insert Delete GetRandom O(1)

Design a data structure that supports insert, delete, and getRandom operations, all in average O(1) time. The getRandom method should return a random element from the current set of elements.

ArraysHash TableRandomizedSet

If you have a Rubrik interview, it's unlikely that you will get this question

#18. Insert Delete GetRandom O(1)

Design a data structure that supports insert, delete, and getRandom operations, all in average O(1) time. The getRandom method should return a random element from the current set of elements.

ArraysHash TableRandomizedSet

This question is not likely to be asked in your Rubrik interview

Web Crawler Multithreaded

Implement a multithreaded web crawler to efficiently explore and retrieve pages from a website, respecting the website's rules.

ArraysGraphsGreedy Algorithms

If you have a Rubrik interview, it's unlikely that you will get this question

#19. Web Crawler Multithreaded

Implement a multithreaded web crawler to efficiently explore and retrieve pages from a website, respecting the website's rules.

ArraysGraphsGreedy Algorithms

This question is not likely to be asked in your Rubrik interview

Snapshot Array

Implement a snapshot array where you can update elements and take snapshots of the array at any time. Later, you should be able to retrieve the value of an element at a specific snapshot.

ArraysBinary Search

If you have a Rubrik interview, it's unlikely that you will get this question

#20. Snapshot Array

Implement a snapshot array where you can update elements and take snapshots of the array at any time. Later, you should be able to retrieve the value of an element at a specific snapshot.

ArraysBinary Search

This question is not likely to be asked in your Rubrik interview

Copyright © Taro