Rubrik Interview Questions — 36 DSA Problems

30 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Rubrik LeetCode questions for software engineering interviews.

• Maximum Points After Enemy Battles (MEDIUM) — Array, Greedy
• Stamping the Grid (HARD) — Array, Greedy, Matrix, Prefix Sum
• Alice and Bob Playing Flower Game (MEDIUM) — Math
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Count Lattice Points Inside a Circle (MEDIUM) — Array, Hash Table, Math, Geometry, Enumeration
• Candy Crush (MEDIUM) — Array, Two Pointers, Matrix, Simulation
• Random Pick with Weight (MEDIUM) — Array, Math, Binary Search, Prefix Sum, Randomized
• Distribute Candies Among Children III (HARD) — Math, Combinatorics
• Distribute Candies Among Children II (MEDIUM) — Math, Combinatorics, Enumeration
• Distribute Candies Among Children I (EASY) — Math, Combinatorics, Enumeration
• Find X Value of Array I (MEDIUM) — Array, Math, Dynamic Programming
• Find Longest Special Substring That Occurs Thrice II (MEDIUM) — Hash Table, String, Binary Search, Sliding Window, Counting
• Find the Sum of Subsequence Powers (HARD) — Array, Dynamic Programming, Sorting
• Existence of a Substring in a String and Its Reverse (EASY) — Hash Table, String
• Maximize Subarray Sum After Removing All Occurrences of One Element (HARD) — Array, Dynamic Programming, Segment Tree
• Find X Value of Array II (HARD) — Array, Math, Segment Tree
• Manhattan Distances of All Arrangements of Pieces (HARD) — Math, Combinatorics
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Snapshot Array (MEDIUM) — Array, Hash Table, Binary Search, Design
• Scramble String (HARD) — String, Dynamic Programming
• Next Permutation (MEDIUM) — Array, Two Pointers
• Web Crawler Multithreaded (MEDIUM) — Depth-First Search, Breadth-First Search, Concurrency
• Design Add and Search Words Data Structure (MEDIUM) — String, Depth-First Search, Design, Trie
• Design a Text Editor (HARD) — Linked List, String, Stack, Design, Simulation, Doubly-Linked List
• Web Crawler (MEDIUM) — String, Depth-First Search, Breadth-First Search, Interactive
• Task Scheduler (MEDIUM) — Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting
• Edit Distance (MEDIUM) — String, Dynamic Programming
• Sliding Window Maximum (HARD) — Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue
• Building H2O (MEDIUM) — Concurrency
• 4Sum (MEDIUM) — Array, Two Pointers, Sorting
• Prefix and Suffix Search (HARD) — Array, Hash Table, String, Design, Trie
• Remove Invalid Parentheses (HARD) — String, Backtracking, Breadth-First Search
• Cherry Pickup II (HARD) — Array, Dynamic Programming, Matrix
• Minimum Number of Refueling Stops (HARD) — Array, Dynamic Programming, Greedy, Heap (Priority Queue)
• Design Bounded Blocking Queue (MEDIUM) — Concurrency
• Design Memory Allocator (MEDIUM) — Array, Hash Table, Design, Simulation