I applied through a staffing agency. The process took 2 weeks. I interviewed at Rupeek (Bengaluru) in Mar 2021
Interview
I was contacted by Recruitment Agency.
There were a total of 4 Rounds:
1. Hackerrank Test: 60 mins test with 2 medium difficulty problem.
2. Data Structure and Algorithm: This round was taken by a third-party consultant. 2 coding questions.
3. Data Structure and Algorithm 2: This round was taken by Rupeek tech team guy. Again 2 coding problems were asked.
4. System Design: This was a one hour Design round with focus on LLD
Interview questions [5]
Question 1
Minimum Number of Platforms Required for a Railway/Bus Station
I applied through a recruiter. The process took 2 months. I interviewed at Rupeek (New Delhi) in May 2021
Interview
Such a waste in giving interview, asked one question for entire hour and that to a wrong question. He was giving clue which was solving only for length 1 but fails for length greater than 1. Even interviewer was not able to solve the question that he has asked.
How can someone suggest by just one question?
Interview questions [1]
Question 1
in a binary tree find monotonous increasing path of any difference.
I applied through a recruiter. The process took 3 weeks. I interviewed at Rupeek (Bengaluru) in Dec 2020
Interview
Applied Through Third party recruiter. There were mostly 5 rounds including hacker earth online coding.
1st Round were on hacker earth there were 2 coding question with medium level difficulty.
2nd Round were with one Third party engineer who basically belongs from some top tech giants i.e. Microsoft/Amazon etc. he asked me 2 coding question on collabedit.
3rd round were with Rupeek Software Developer - he asked me 2 coding question (similar to 1st round) after that I've got rejected. May be he is looking for someone who's coding skills is very good, but think simply if someone is very good in doing he will go to FAANG mostly. so take interview to select otherwise its very easy to reject someone.
Interview questions [4]
Question 1
Given a linked list determine if its circular, then find the first meeting point in circular linked list.
