![]() |
VOOZH | about |
Rubrik visited our campus for a recruitment drive, providing an exciting opportunity for students to showcase their skills and secure positions in their esteemed organization.
Process: Online Test followed by 3 Rounds of interviews
Online Test: Plaform Hackerrank
4 coding problems in 90 minutes, All the problems were of Medium-hard level.
Only a few students (<10) were shortlisted for interviews.
Platform for interviews- Zoom + Coderpad
Round-1 Interview
Time- 45 minutes
Design Problem
Design an interface of a Text Editor
Suggestion-
Round 2: Interview
Time: 45 minutes
Given an unsorted array and value 'd', find all the APs of length >= 3, whose distance is lesser than or equal to a given value 'd'.
The list of AP can be in any order, but each individual AP has to be sorted.
For example:
[0, 2, 98, 102, 3, 6, 100, 104, 10], d = 4
Ans: [0,3,6](d = 3), [98, 100, 102, 104](d = 2), [2, 6, 10](d = 4)
Suggestion:
Tips:
Rubrik wants to hire the best of people, so ensure that you give your best in every aspect in every round of interviews to get selected.
Your speed, accuracy, and confidence are what matters the most.