Filter interviews by
Algo from leetcode No.56
I appeared for an interview 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 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 appeared for an interview 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 Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
I applied via Company Website and was interviewed in Jan 2021. There were 4 interview rounds.
I appeared for an interview before May 2021.
Round duration - 120 minutes
Round difficulty - Easy
It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium levels. Time was enough and no sectional time was present. 1-2 MCQs on SQL was also present.
Given a 2-dimensional boolean matrix mat
of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
Iterate through the matrix to find elements with value 1
Store the row and column indices of these elements
Update the entire row and column for each element found to be 1
Round duration - 60 minutes
Round difficulty - Easy
It was an online video interview round on HackerEarth with a simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class that required inheritance was asked by the interviewer to write. I was helped by the interviewer if I got stuck somewhere, Some questions on the implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.
Tip 1 : Clear basics
Tip 2 : Prepare well
Tip 3 : Do at-least 2 projects
Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly
posted on 9 Nov 2024
I applied via LinkedIn and was interviewed in May 2024. There were 3 interview rounds.
Event loop is a mechanism in programming that allows for asynchronous execution of code by continuously checking for and handling events.
Event loop is commonly used in JavaScript to handle asynchronous operations like setTimeout, setInterval, and AJAX requests.
It works by continuously checking the event queue for any pending events, executing them one by one, and then moving on to the next event.
Event loop helps in pre...
The order of output is fs, process, setTimeout, setInterval, promise.
fs module is synchronous and will output first
process is next in line
setTimeout will be executed after process
setInterval will be executed after setTimeout
promise will be executed last
JavaScript is an interpreted language.
JavaScript is an interpreted language, meaning it is executed line by line at runtime.
There is no separate compilation step in JavaScript like in languages that use compilers.
Examples of interpreted languages include Python, Ruby, and PHP.
Output comparison of for loops using var, let, and bind in JavaScript.
Using var: variable is function-scoped, may lead to unexpected behavior in loops.
Using let: variable is block-scoped, recommended for loop iterations.
Using bind: creates a new function with a specified 'this' value and initial arguments.
I work on coding, debugging, testing, and collaborating with team members. Tech stack decisions are based on project requirements, scalability, performance, and team expertise.
Daily tasks include coding, debugging, testing, and collaborating with team members
Tech stack decisions are based on project requirements, scalability, performance, and team expertise
Consider factors like language compatibility, libraries/framewo...
Design a scalable, real-time document sharing app like Google Docs.
Use websockets for real-time collaboration
Implement version control to track changes
Utilize a distributed database for scalability
Include user authentication and access control
Support offline editing with automatic sync
Utilize cloud storage for scalability, implement image compression techniques, and regularly update image processing libraries.
Utilize cloud storage for scalability
Implement image compression techniques
Regularly update image processing libraries
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There were 2 interview rounds.
First round was coding test in online mode which was quite easy.
I applied via Referral and was interviewed before Dec 2023. There was 1 interview round.
Types of frauds in General Insurance include premium diversion, false claims, and policy manipulation.
Premium diversion: When an agent or employee diverts premium payments for personal use.
False claims: Submitting fake claims for reimbursement.
Policy manipulation: Altering policy details to obtain more coverage or lower premiums.
Technicalities to consider during processing of general insurance claim
Verify policy coverage and limits
Assess the cause of loss and determine if it is covered
Gather necessary documentation and evidence
Evaluate the extent of damage or loss
Adhere to regulatory requirements and timelines
Communicate effectively with the insured party
based on 1 interview
Interview experience
Content Moderator
317
salaries
| ₹2.7 L/yr - ₹6.5 L/yr |
Quality Analyst
244
salaries
| ₹3 L/yr - ₹9.5 L/yr |
SME
149
salaries
| ₹3 L/yr - ₹9.6 L/yr |
Content Reviewer
84
salaries
| ₹2.2 L/yr - ₹6 L/yr |
Accounts Manager
47
salaries
| ₹7 L/yr - ₹21 L/yr |
Udaan
Swiggy
BlackBuck