Rubrik
11 questions · 8 experiences · 1p3a (6) · LeetCode (4) · Other (9)
19 entries
Rubrik OA Question: Minimum Swaps to Make Binary String Palindrome
Rubrik New Grad 2025 Software Engineer Interview Experience
Rubrik onsite interview experience: Queue design using array
#276 Paint Fence
Rubrik SDE-2 System Coding Interview Experience and Concurrency Question
#2249 Count Lattice Points Inside a Circle
#1242 Web Crawler Multithreaded
#2193 Minimum Number of Moves to Make Palindrome
Rubrik System Coding Interview Experience?
App Installation
Buffer Queue
File Size
Game Ranking
Smallest Difference
Snapshot Key Value Store
Variable Expansion
Rubrik Internship Online Test: Subarray XOR, Team Cost, and Scheduling Problems
Rubrik 2026 Summer Intern Online Assessment for SDE Frontend
Rubrik SDE Interview – No update
Rubrik OA Question: Minimum Swaps to Make Binary String Palindrome
Question Details
Hi everyone, I recently got this question in an OA (Rubrik): Given a binary string s consisting of only '0' and '1', find the minimum number of swaps (swap any two characters, not necessarily adjacent) required to make the string a palindrome. If it is impossible, return -1. Example: Input: s = "101000" Output: 1 (swap the chars at position '2' & position '5') Can anyone please share the exact question link for practice if they have it handy? or best - if you have solution, please post this question to leetcode.