RUBRIK INDIA Interview Questions, Process, and Tips

Round duration - 100 Minutes
Round difficulty - Hard

**Criteria:
8 CPI or Above (only CSE, MnC). All students irrespective of history of backlogs or current backlogs were considered if they satisfied the CPI criteria.

It was first round..
This round was the Online test which was around 1 Hour 40 Minutes long(don't remember exact time).

Timing from 19:00 to 20:40
Environement was comfortable.
Hackerrank is a good platform for online tests.

All questions were new for me, So cant give any links.

Q1. 
Minimum Removals Problem Statement
Given an integer array ARR of size N and an integer K, determine the minimum number of elements that need to be removed so that the difference between the maximum and mi...read more
Ans. 
Find the minimum number of elements to remove from an array to satisfy a given condition.
• Calculate the initial difference between the maximum and minimum elements in the array.

• Iterate through the array and remove elements to minimize the difference.

• Return the count of elements removed as the answer.
Answered by AI
Add your answer
Q2. 
Minimum Number of Stabs to Kill the King
You are given the initial health of a king represented by an integer N. Your task is to determine the minimum number of stabs required to reduce the king's health ...read more
Ans. 
Calculate the minimum number of stabs required to kill the king by reducing his health to zero.
• Iterate through each test case and calculate the minimum number of stabs required based on the given operations.

• For each test case, keep reducing the king's health using the first or second type of stab until it reaches zero.

• Consider the constraints provided to optimize the solution and handle edge cases.

• Example: For input 10...read more
Answered by AI
Add your answer
Q3. 
Minimum Time Problem Statement
In a city with ‘N’ junctions and ‘M’ bi-directional roads, each junction is connected to other junctions with specified travel times. No road connects a junction to itself, ...read more
Ans. 
The problem involves finding the minimum time to travel from a source junction to a destination junction in a city with specified travel times and green light periods.
• Input consists of the number of test cases, number of junctions and roads, green light periods, road connections with travel times, and source/destination junctions.

• Output should be the minimum time needed from source to destination, or -1 if destination ...read more
Answered by AI
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

This was an Online F2F Technical Round conducted on zoom. Interviewer shared codepad link and you were asked to code and pass sample test case given by interviewer. Only one question(coding) was asked(More follow questions).
Interviewer was really helpful..

Q1. 
XOR Query Problem Statement
Assume you initially have an empty array called ARR. You are required to return the updated array after executing Q number of queries on this array.
There are two types of que...read more
Ans. 
Implement a function to update an array based on XOR queries.
• Create an empty array to store the elements.

• Iterate through each query and update the array accordingly.

• Use bitwise XOR operation to update the elements.

• Ensure to handle both types of queries - insert and XOR.

• Return the updated array after all queries are processed.
Answered by AI
Add your answer

Round duration - 90 Miinutes
Round difficulty - Medium

Again pattern was same(Zoom video call and I was asked to code and 1 question was there(+Follow up)).
Timing was afternoon time around 13:00

Q1. 
Scramble String Problem Statement
You are given an integer 'N' and two strings S and R, each having the size N. Determine if you can scramble string S to obtain string R using specified operations.
Your ...read more
Ans. 
Given two strings of the same length, determine if one can be scrambled to obtain the other using specified operations.
• Check if the two strings are equal, if so return true.

• Check if the characters in both strings are the same, if not return false.

• Try all possible ways of splitting and scrambling the first string to match the second string.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was a zoom video call.
In starting 5 minutes, interviewer tried to make me comfortable with him..