Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Mar 2024. There were 3 interview rounds.
Given a task to automate login process
Top trending discussions
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
I was interviewed before Apr 2021.
Round duration - 60 minutes
Round difficulty - Medium
It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Array: [2,1,5,6,3,8], K ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order
Return the Kth element from the sorted array
Handle multiple test cases
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find the initial rotten oranges and add them to the queue.
Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.
Continue until the queue is empty, ke...
Round duration - 45 minutes
Round difficulty - Easy
This was a design round.
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.
I applied via Recruitment Consultant and was interviewed in Sep 2020. There were 4 interview rounds.
Merge two lists with different intervals based on overlapping intervals.
Sort both lists based on start time.
Iterate through both lists and compare intervals for overlap.
Merge overlapping intervals and add non-overlapping intervals to the result list.
Nothing much compulsary field
An array is a data structure that stores a collection of elements of the same type in a contiguous block of memory.
Arrays are indexed starting at 0, with each element accessible by its index.
Arrays can be used to store and manipulate multiple values of the same data type.
Example: String[] names = {"Alice", "Bob", "Charlie"};
Glassdoor may require users to write questions to encourage engagement and gather feedback.
Encourages user engagement and feedback
Helps improve the overall user experience on the platform
Allows users to share their thoughts and opinions
Can lead to valuable insights for Glassdoor to enhance their services
posted on 14 Oct 2024
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
There are Question based on data strcuture ,they cover all the topic in ds
In coding code they gave internet access to solve the problem after 30 they told us to make some changes in it and we should ready to explain the entire code
I was interviewed before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given the head node of a singly linked list and an integer 'k', this problem requires you to determine the value at the k-th node from the end of the linke...
To find the k-th node from the end of a linked list, iterate through the list to determine the size, then traverse again to reach the k-th node from the end.
Iterate through the linked list to determine its size.
Calculate the position of the k-th node from the end based on the size of the list.
Traverse the list again to reach the k-th node from the end.
Return a pointer to the k-th node from the end.
Round duration - 60 Minutes
Round difficulty - Easy
High level System Design
Designing a system like Uber involves components like user app, driver app, server, database, and algorithms for matching and routing.
User app for booking rides and tracking
Driver app for accepting rides and navigation
Server for handling requests and communication between apps
Database for storing user, driver, and ride information
Algorithms for matching riders with drivers and routing
Round duration - 45 minutes
Round difficulty - Easy
Basic HR questions
Tip 1 : Practise DSA/coding consistently
Tip 2 : Choose a tech stack and Make side hobby projects
Tip 3 : Give mock interviews for your preparation evaluation
Tip 1 : Pointers about your current job responsibility
Tip 2 : Side Projects with Tech stack
Priority Queue with linked list
I applied via Recruitment Consulltant and was interviewed in Aug 2023. There was 1 interview round.
Questions asked 2
1. Group Anagrams
2. Question based kn recursion
based on 1 interview
Interview experience
Operations Specialist
32
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Manager
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Transport Executive
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Ridecell
QuickRide
Rapido
Shuttl