J'ai postulé via un recruteur. Le processus a pris 1 jour. J'ai passé un entretien chez Rupeek (Bengaluru) en févr. 2018
Entretien
First Telephonic Screening Round
Design a solution to verify customer and his phone number, such that a customer can have more than one number but each phone number should has unique customer. Explain how you would store them in DB and APIs you would create.
Four F2F Rounds
First round - Written coding
Out of two questions attempt anyone. 45 mins to solve
Q1 - minimum number of rooms required given start and end time of events.
Q2 - Given denominations of coins print all unique permutations of coins which sum to a given number.
Round Two - DS Algo
Q1 - create mirror tree of a binary tree
Q2 - find max sum from a given array having non-negative integers given constraint that you can not pick adjacent elements.
Round 3 - Design and Architecture
Design RDBMS solution for ola pool feature. You need to show ETA and match riders having similar journey path. How you will store data and use it?
Round 4 - Manager round
Cultural fitment and brief about the company
Total three rounds
Screening test: online test on some portal. DSA and sql queries.
1st Round: DSA related to trees, Arrays. Medium level
2nd Round: LLD, related to schema design. Medium level
J'ai postulé via une agence de recrutement. J'ai passé un entretien chez Rupeek en nov. 2020
Entretien
An online test was provided
I solved it using C++. I got shortlisted for f2f interview
First round of interview:
The interviewer directly jumped into the questions he already wrote on google docs.
1. A binary tree is given -> for a particular node sum of path equals sum of all parents and value of current node -> find max sum of path
2. Print array in spiral form
After I solved 1st question, and was in midway of solving 2nd question, my wifi was not working. The interviewer called me and asked if he should reschedule. I said I know how to solve the second question correctly, so I can proceed on the call itself explaining how to solve the 2nd question.
Then he said, that now he will change the question as I know how to solve it already. Who changes question in midway of solving ?
If He needed to change the question then why did he even bother to ask me the 2nd question
Then he changed the question to
3. A binary tree is given. Find all nodes at distance d from a particular target node.
I wrote the working pseudo code, and explained it to him again. If at some point he thought my approach isn't going to work, he should have pointed it out.
Rather he said that he understood my approach clearly.
Then he left in hurry that he has some other meeting to attend.
Next day HR mailed me that I am not shortlisted for next round.
No feedback provided
I don't know what they require in a candidate and that too in DS/Algo round
Questions d'entretien [3]
Question 1
A binary tree is given -> for a particular node sum of path equals sum of all parents and value of current node -> find max sum of path