LeetCode
Experience
#2193 Minimum Number of Moves to Make Palindrome
Interview Experience
LeetCode #2193: Minimum Number of Moves to Make Palindrome. Difficulty: Hard. Topics: Two Pointers, String, Greedy, Binary Indexed Tree. Asked at Rubrik in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →About This Question
This is a candidate experience report from a rubrik interview for a swe role during the coding round.
It covers the following topics: Binary Indexed Tree, Greedy, Strings, Two Pointers .
Difficulty rating: Hard
More Rubrik Interview Questions
1p3a
Rubrik SDE-2 System Coding Interview Experience and Concurrency Question
1p3a
Rubrik OA Question: Minimum Swaps to Make Binary String Palindrome
1p3a
Rubrik onsite interview experience: Queue design using array
InterviewDB
Rubrik SWE Phone - App Installation (Graph/Topological Sort)
1p3a
Rubrik New Grad 2025 Software Engineer Interview Experience