All company sheets
Rubrik DSA interview questions
53 problems to practise before your Rubrik online test or coding round. Most widely asked first.
53
Questions
10
Easy
31
Medium
12
Hard
Commonly reported. Problems candidates often report from this company’s coding rounds. These are Astra’s own tags, not an official question list.
Rubrik is hiring · 24 open roles on Astra right nowView roles53 questions
- 1
Determine if a Binary Tree is Symmetric
EasyRecursionTagged at 7 companies - 2
Convert a Sorted Array to a Height-Balanced BST
EasyRecursionTagged at 7 companies - 3
Check If a Number Is Majority Element in Sorted Array
EasyBinary SearchTagged at 7 companies - 4
Merge Two Sorted Arrays In-Place
EasyArrayTagged at 7 companies - 5
Generate Pascal's Triangle up to N Rows
EasyArrayTagged at 7 companies - 6
Fitness App Weekly Calorie Tracker
EasySliding WindowTagged at 7 companies - 7
Move Zeroes
EasyTwo PointersTagged at 7 companies - 8
Task Scheduler
MediumGreedyTagged at 7 companies - 9
Read N Characters Given Read4
MediumArrayTagged at 7 companies - 10
Implement Quick Sort Algorithm Recursively
MediumRecursionTagged at 7 companies - 11
Find Kth Largest Element in an Array
MediumRecursionTagged at 7 companies - 12
Find Length of Longest Common Subsequence
MediumRecursionTagged at 7 companies - 13
Maximize Stolen Money from House Robber Problem
MediumRecursionTagged at 7 companies - 14
Find Index of First 1 in an Infinite Binary Sorted Array
MediumBinary SearchTagged at 7 companies - 15
Find the Duplicate Number (Binary Search on Answer)
MediumBinary SearchTagged at 7 companies - 16
Find All Duplicates in an Array (O(1) Space)
MediumArrayTagged at 7 companies - 17
Insert a New Interval into a Sorted List of Intervals
MediumArrayTagged at 7 companies - 18
Generate All Combinations of Size K from N Numbers
MediumArrayTagged at 7 companies - 19
Implement strStr()
EasyStringTagged at 6 companies - 20
Detect if a Linked List Has a Cycle
EasyLinkedListTagged at 6 companies - 21
Remove Duplicates from a Sorted Linked List
EasyLinkedListTagged at 6 companies - 22
Edit Distance
MediumDPTagged at 6 companies - 23
Number of Subsequences with Sum K
MediumDPTagged at 6 companies - 24
Remove K Digits from a Number to Make Smallest
MediumStack and QueueTagged at 6 companies - 25
Design an Online Stock Span Price Tracker
MediumStack and QueueTagged at 6 companies - 26
Split a Circular Linked List into Two Halves
MediumLinkedListTagged at 6 companies - 27
Reverse a Doubly Linked List
MediumLinkedListTagged at 6 companies - 28
Delete the Middle Node of a Linked List
MediumLinkedListTagged at 6 companies - 29
Find the Root of an N-ary Tree (Given All Nodes)
MediumTreeTagged at 6 companies - 30
Find the Lowest Common Ancestor (LCA) of an N-ary Tree
MediumTreeTagged at 6 companies - 31
Convert an N-ary Tree to a Binary Tree
MediumTreeTagged at 6 companies - 32
Implement Insertion into a Binary Search Tree (BST)
MediumTreeTagged at 6 companies - 33
Convert a Binary Search Tree to a Sorted Circular Doubly Linked List
MediumTreeTagged at 6 companies - 34
Check if String Contains a Permutation of Another
MediumStringTagged at 6 companies - 35
Find the Longest Common Substring (DP)
MediumStringTagged at 6 companies - 36
Find the Longest Palindromic Subsequence (LPS)
MediumStringTagged at 6 companies - 37
Trapping Rain Water
HardArrayTagged at 6 companies - 38
Find Minimum in Rotated Sorted Array II (with Duplicates)
HardBinary SearchTagged at 6 companies - 39
Find Longest Valid Obstacle Course at Each Position
HardBinary SearchTagged at 6 companies - 40
Calculate Trapping Rain Water (Two Pointers)
HardArrayTagged at 6 companies - 41
Combination Sum
MediumBacktrackingTagged at 5 companies - 42
Course Schedule
MediumGraphTagged at 5 companies - 43
Topological Sorting (DFS Method)
MediumGraphTagged at 5 companies - 44
Cheapest Flights Within K Stops
MediumGraphTagged at 5 companies - 45
Surrounded Regions (Flood Fill)
MediumGraphTagged at 5 companies - 46
Reconstruct Itinerary from Airline Tickets (DFS)
HardStack and QueueTagged at 5 companies - 47
Flatten a Linked List (with Next and Bottom Pointers)
HardLinkedListTagged at 5 companies - 48
Merge Sort a Circular Linked List
HardLinkedListTagged at 5 companies - 49
Implement an Autocomplete System (Trie + Heap)
HardTreeTagged at 5 companies - 50
Longest Increasing Path in a Matrix
HardDynamic ProgrammingTagged at 4 companies - 51
Word Break II
HardDPTagged at 4 companies - 52
Word Ladder
HardGraphTagged at 3 companies - 53
Discord Active User Cache
HardDesignTagged at 3 companies