Filter interviews by
Write debounce in js, with leading and trailing edge. A react question, make 5 star a rating widget.
I applied via Recruitment Consulltant and was interviewed in May 2024. There was 1 interview round.
AB framework is a system for testing two versions of a software application to determine which performs better.
Define the goals and metrics for comparison
Create two versions of the software with the only difference being the feature being tested
Randomly assign users to either version A or version B
Collect and analyze data on user behavior and performance to determine which version is more effective
I applied via Recruitment Consulltant and was interviewed in Apr 2024. There was 1 interview round.
Medium leet code question
Coupang interview questions for popular designations
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There were 5 interview rounds.
Build a file system and implement mkdir, ls commands
Implement a tagging system similar to Twitter
Given a design of legacy system, how it can be improved
Design a social networking platform like Facebook
User profiles with personal information and photos
News feed displaying posts from friends and pages
Messaging feature for private communication
Groups and events for community engagement
Advertising platform for targeted marketing
Easy to Medium PSDS question
Top trending discussions
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
Leet code medium question
Cab/food aggregators mask phone numbers for user/driver security by using technology like number masking and encryption.
Use number masking to replace actual phone numbers with temporary numbers for communication.
Implement encryption techniques to secure the transmission and storage of phone numbers.
Utilize secure communication protocols to prevent unauthorized access to phone numbers.
Regularly update security measures ...
I was interviewed before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
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.
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 7 interviews
Interview experience
Director Finance
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Director
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Industrial Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Amazon
Snapdeal
Paytm Mall