Rupeek interview experience Real time questions & tips from candidates to crack your interview
Associate Software Engineer
Rupeek
3 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 6 months
Topics: Data Structures, Computer Networks, DBMS, OOPS, Algorithms, Arrays, Recursion, Dynamic Programming
Tip 1 : During preparation, try to do at least 3-4 data structures and algorithms questions each day along with studying core computer science subjects.
Tip 2 : Mention atleast 2 good projects on your resume.
Application process
Where: Other
Eligibility: 700+ Cocubes test score
Tip 1 : Make a well-formatted 1-page resume.
Tip 2 : Highlight the keywords on your resume, and try to summarize the project description or past experience in short points.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date2 Sep 2020
Coding problem1
CoCubes Online Test was the first round whose score was used in shortlisting. It was held on the CoCubes platform. The test was divided into different sections, which tested the candidates on data structures & algorithms questions and general computer science concepts.
1. Ways To Make Coin Change
Moderate
20m average time
80% success
0/80
Asked in companies
You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a change for value V using coins of denominations from D. Print 0, if a change isn't possible.
Problem approach
Step 1: The idea is to use recursion and memoization.
Step 2: For a particular coin, there are two options: either include it or exclude it.
Step 3: If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
Step 4: If we exclude that coin, then recur for the same amount that we have to make.
Step 5: The final answer would be the total number of ways either by including or excluding.
02
Round
Medium
Video Call
Duration45 minutes
Interview date8 Sep 2020
Coding problem1
This round was completely based on data structures and algorithms. The interviewer was very friendly.
1. LCA - Lowest Common Ancestor
Hard
40m average time
70% success
0/120
Asked in companies
The lowest common ancestor (LCA) is a concept in graph theory and computer science.
Let ‘T’ be a rooted tree with ‘N’ nodes. The lowest common ancestor is defined between two nodes, ‘u’ and ‘v’, as the lowest node in ‘T’ that has both ‘u’ and ‘v’ as descendants (where we allow a node to be a descendant of itself). - Wikipedia
For the given tree, The LCA of nodes 5 and 8 will be node 2, as node 2 is the first node that lies in the path from node 5 to root node 1 and from node 8 to root node 1.
Path from node 5 to root node looks like 5 → 2 → 1.
Path from node 8 to root node looks like 8 → 6 → 2 → 1.
Since 2 is the first node that lies in both paths. Hence LCA will be 2.
Given any two nodes ‘u’ and ‘v’, find the LCA for the two nodes in the given Tree ‘T’.
Note: For each test case, the tree is rooted at node 1.
Problem approach
Step 1: The idea is to traverse the tree starting from the root.
Step 2: If any of the given keys (n1 and n2) matches with the root, then the root is LCA (assuming that both keys are present).
Step 3: If the root doesn’t match with any of the keys, we recur for the left and right subtree. The node which has one key present in its left subtree and the other key present in the right subtree is the LCA.
Step 4: If both keys lie in the left subtree, then the left subtree has LCA also, otherwise, LCA lies in the right subtree.
03
Round
Medium
Video Call
Duration30 minutes
Interview date11 Sep 2020
Coding problem1
This was the last round: Hiring Manager round. This round revolves around the projects that I have mentioned on my resume and the work that I have done in my past internships.
1. DBMS Questions
SQL vs NoSQL database
ACID properties
Problem approach
Tip 1 : Read the most frequently asked questions on DBMS.
Tip 2 : Have a clear understanding of basic concepts.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 5 problems
Interviewed by Rupeek
Selected 
2243 views
0 comments
0 upvotes
SDE - 1
4 rounds | 4 problems
Interviewed by Rupeek
Selected 982 views
0 comments
0 upvotes
SDE - 1
4 rounds | 4 problems
Interviewed by Rupeek
Selected 956 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 8 problems
Interviewed by Rupeek
Selected 2080 views
0 comments
0 upvotes
Companies with similar interview experiences
Associate Software Engineer
3 rounds | 10 problems
Interviewed by Amdocs
Selected 2370 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 2 problems
Interviewed by Ernst & Young (EY)
Selected 2672 views
0 comments
0 upvotes
Associate Software Engineer
3 rounds | 15 problems
Interviewed by Ernst & Young (EY)
Selected 2347 views
0 comments
0 upvotes