Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Apr 2022. There were 2 interview rounds.
Given an array of digits, find the largest multiple of 3 that can be formed from the digits.
Sort the array in descending order.
If the sum of digits is divisible by 3, return the array as a string.
If the sum of digits modulo 3 is 1, remove the smallest digit that has a remainder of 1 when divided by 3, or the two smallest digits that have a remainder of 2 when divided by 3.
If the sum of digits modulo 3 is 2, remove the ...
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 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
I applied via Company Website and was interviewed in Dec 2020. There was 1 interview round.
I applied via Company Website and was interviewed in Nov 2020. There were 3 interview rounds.
I applied via Company Website and was interviewed before Sep 2020. There were 3 interview rounds.
Content Moderator
292
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Analyst
225
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Reviewer
84
salaries
| ₹0 L/yr - ₹0 L/yr |
SME
68
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
48
salaries
| ₹0 L/yr - ₹0 L/yr |
TikTok
Udaan