iServeU Software Developer Interview Questions and Answers for Experienced

Q1. Basics on Node.js
Add your answer

Q1. Node.js concepts
Add your answer
Q2. Schema design
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

DS/Algo Questions 
2 questions

Q1. 
Hurdle Game Problem Statement
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 ...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Last Stone Weight Problem Explanation
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...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Live coding

Q1. 
Rearrange Odd and Even Position Nodes in Linked List
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 ...read more
Ans. 
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...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. How would you design a system like Zomato?
Ans. 
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...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Cultural

Basic mathematics and analytical thinking questions

Basic programming questions

Q1. Be confident and speak casually
Add your answer
Q2. Basic questions depending on how u interact
Add your answer

Data Structures Algorithms

Data Structures and Algorithm

Q1. Find Target Element in a rotating sorted Array.
Ans. 
Search for target element in a rotated sorted array.
• Use binary search to find the pivot point where rotation happens.

• Divide the array into two subarrays and perform binary search on the appropriate subarray.

• Handle cases where the target element is on the left or right side of the pivot.
Answered by AI
Add your answer

Q1. Sort array of cards in color red , blue,green
Ans. 
Sort array of cards in red, blue, green colors.
• Use a custom sorting function to sort the array based on color order.

• Assign a numerical value to each color (e.g. red: 0, blue: 1, green: 2) and sort based on these values.

• Implement a sorting algorithm like bubble sort or quicksort to rearrange the array based on color order.
Answered by AI
Add your answer

In test I had to solve 3 dsa questions in 1 hour

Q1. I have asked 2 DSA questions in my interview
Add your answer