i
Rupeek
Filter interviews by
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
Data Structures Algorithms
Data Structures and Algorithm
I applied via campus placement at New Horizon College of Engineering, Bangalore and was interviewed in Oct 2023. There were 4 interview rounds.
Basic mathematics and analytical thinking questions
Basic programming questions
I was interviewed in May 2022.
Round duration - 90 Minutes
Round difficulty - Medium
DS/Algo Questions
2 questions
Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).
Given the total number ...
The task is to determine the number of levels cleared by Kevin based on the total number of hurdles he has jumped.
Each level 'i' has 'i' hurdles, so Kevin can only reach level 'i' if he has cleared level 'i-1'.
Count the number of levels cleared by dividing the total number of hurdles by the sum of the first 'n' natural numbers.
The formula to calculate the sum of the first 'n' natural numbers is (n * (n + 1)) / 2.
Given a collection of stones, each having a positive integer weight, perform the following operation: On each turn, select the two heaviest stones and smash them toge...
This question is about finding the weight of the last stone after repeatedly smashing the two heaviest stones together.
Sort the array of stone weights in descending order.
Repeatedly smash the two heaviest stones together until there is at most 1 stone left.
If there is 1 stone left, return its weight. Otherwise, return 0.
Round duration - 60 Minutes
Round difficulty - Medium
Live coding
Rearrange a linked list such that all nodes at odd positions are together, followed by all nodes at even positions. You need to return the head of the ...
The task is to rearrange a linked list such that all odd position nodes are together and all even position nodes are together.
Create two separate linked lists, one for odd position nodes and one for even position nodes.
Traverse the original linked list and add the nodes to their respective lists based on their position.
Join the two lists together by pointing the last node of the odd list to the head of the even list.
Re...
Round duration - 60 Minutes
Round difficulty - Easy
Design Zomato - a food delivery platform
Zomato is a platform that connects users with restaurants for food delivery
Users can search for restaurants, view menus, and place orders
Restaurants can register, manage their menus, and receive orders
Delivery partners can sign up to deliver orders
Payment integration is required for seamless transactions
User reviews and ratings can be implemented for restaurant feedback
Location-b...
Round duration - 30 Minutes
Round difficulty - Easy
Cultural
Tip 1 : Prepare for DA/Algo online consistently.
Tip 2 : During interviews, do not hesitate to clarify your doubts, if any. Be in constant communication, explain your thought process.
Tip 3 : Have strong grasp on domain and technologies. Quality over Quantity
Tip 1 : Have super clear idea about the projects you've been part of in case of any cross questions.
Tip 2 : Along with your role do describe how you increased the throughput or reduced cost.
Top trending discussions
Write code for advance surrying in js
Implement custom hook for api call
I applied via Referral and was interviewed in Oct 2024. There was 1 interview round.
I applied via Campus Placement
One medium and one standard DP question
Design Google Pay - a digital wallet platform for online payments and transactions.
Allow users to securely store payment information such as credit/debit cards, bank accounts, and loyalty cards.
Enable users to make payments in stores, online, and within apps using their stored payment methods.
Implement security features like biometric authentication, tokenization, and encryption to protect user data.
Provide features fo...
High Level Design (HLD) of recursive functions in software development.
Recursive functions call themselves to solve smaller instances of the same problem.
HLD of recursive functions involves defining the base case, recursive case, and termination condition.
Example: HLD of a recursive function to calculate factorial of a number involves defining base case as factorial(0) = 1.
I applied via campus placement at Indian Institute of Technology (IIT), Guwahati and was interviewed in Nov 2023. There were 4 interview rounds.
Mcqs based on cs fundamentals and 2_3 coding questions
Merge two sorted linked lists into one.
Create a new linked list to store the merged list.
Compare the values of the nodes from both lists and add the smaller value to the new list.
Move the pointer of the list with the smaller value to the next node.
Repeat the comparison and addition until one of the lists is empty.
Add the remaining nodes from the non-empty list to the new list.
Return the new merged list.
Medium Leetcode, Array, String, Tree, DP
Interview experience
based on 6 reviews
Rating in categories
Senior Relationship Manager
278
salaries
| ₹2 L/yr - ₹5 L/yr |
Loan Manager
247
salaries
| ₹2.4 L/yr - ₹5 L/yr |
Sales Manager
237
salaries
| ₹2.2 L/yr - ₹5 L/yr |
Team Lead
120
salaries
| ₹4 L/yr - ₹7 L/yr |
Operations Executive
78
salaries
| ₹2.1 L/yr - ₹4 L/yr |
Muthoot Finance
Manappuram Finance
Bajaj Finance
HDB Financial Services