Filter interviews by
Clear (1)
I was interviewed in Dec 2021.
Round duration - 45 minutes
Round difficulty - Easy
This was a coding test with 2 DSA questions.
Given two sorted integer arrays ARR1
and ARR2
of size M and N, respectively, merge them into ARR1
as one sorted array. Assume that ARR1
has a size of M + N to hol...
Merge two sorted arrays into one sorted array in place.
Iterate from the end of both arrays and compare elements to merge in place
Use two pointers to keep track of the current position in each array
Handle cases where one array is fully merged before the other
Given a number of stairs, starting from the 0th stair, calculate the number of distinct ways you can reach the Nth stair. You can climb either one step or two steps at a ...
The question is about calculating the number of distinct ways to reach the Nth stair by climbing one or two steps at a time.
Use dynamic programming to solve this problem efficiently.
Define a recursive function to calculate the number of ways to reach each stair.
Consider base cases for 0 and 1 stairs.
Use memoization to store intermediate results and avoid redundant calculations.
Handle large values of N by taking modulo ...
Round duration - 60 minutes
Round difficulty - Medium
This was the first round with questions on DSA and Low Level design.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
A low-level design of a hotel management system involves detailing the system's components and their interactions.
Define classes for entities like Room, Guest, Reservation, and Staff
Implement functions for booking rooms, checking availability, and managing guest information
Include modules for billing, housekeeping, and reporting
Utilize databases for storing information and APIs for external integrations
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Dsa and alogorithm by third party agency.
I applied via Referral and was interviewed before Jul 2022. There were 2 interview rounds.
DSA - arrays, hashing, stack, 2hrs , google meet
Spinny interview questions for designations
Top trending discussions
I applied via Naukri.com and was interviewed in Dec 2021. There were 3 interview rounds.
I would immediately inform the project manager and the testing team about the error and work collaboratively to find a solution.
Notify the project manager and testing team about the error
Collaborate with the testing team to understand the issue
Analyze the code to identify the root cause of the error
Work with the development team to fix the error as quickly as possible
Perform thorough testing to ensure the issue is reso...
I applied via Approached by Company and was interviewed in Feb 2023. There were 3 interview rounds.
I applied via AmbitionBox and was interviewed before Sep 2020. There were 3 interview rounds.
Unique key allows null values, primary key does not.
Primary key is a unique identifier for a record in a table
Unique key allows null values, primary key does not
A table can have only one primary key, but multiple unique keys
Primary key is automatically indexed, unique key is not necessarily indexed
HAVING clause is used in SQL to filter data based on aggregate functions.
It is used with GROUP BY clause to filter data based on aggregate functions
It is used to filter data after grouping has been done
It is similar to WHERE clause but operates on grouped data
Example: SELECT department, AVG(salary) FROM employees GROUP BY department HAVING AVG(salary) > 50000;
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a hash table to store key-value pairs
Use a doubly linked list to keep track of the order of items
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the back of the list
Lookup and insertion should be O(1) time complexity
Implement 2 stacks in an array
Divide the array into two halves
Use top1 and top2 to keep track of top elements of stacks
Push and pop elements from respective halves
Check for overflow and underflow conditions
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Questions from trees and linkedin
Reverse a linked list using multiple approaches.
Iterative approach: Use three pointers to reverse the links between nodes.
Recursive approach: Recursively reverse the rest of the list and adjust the links.
Stack approach: Push all the nodes onto a stack and then pop them to create the reversed list.
based on 1 interview
Interview experience
based on 5 reviews
Rating in categories
Operations Analyst
498
salaries
| ₹0 L/yr - ₹0 L/yr |
Relationship Manager
253
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
195
salaries
| ₹0 L/yr - ₹0 L/yr |
CAR Consultant
161
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
132
salaries
| ₹0 L/yr - ₹0 L/yr |
Truebil
CarDekho Group
Carwale
Cartrade.com