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 Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I had one interview for approx. an hour, it includes both Technical and HR round, well mostly technical. Interview starts with tell me something about yourself. Asked in detailed about algorithms/web based projects mentioned in CV, make sure that whatever you have written you have complete knowledge about it. Asked to code few basic algorithms questions. Do mention about small project if you have done related to web development.
If interviewer says if you want to ask any question, its always better to ask one or two question.
A Binary Search Tree (BST) is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.
Nodes in a BST are arranged in a hierarchical order where the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.
BST allows for efficient search...
Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...
Insert a new node with a given value into a binary search tree while maintaining the properties of a BST.
Traverse the BST starting from the root node and compare the value to be inserted with each node's value to determine the correct position for insertion.
Insert the new node as a leaf node in the appropriate position to maintain the BST properties.
Ensure that the resulting tree is a valid binary search tree by follow...
You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.
A BST is a ...
Delete a given node from a Binary Search Tree (BST) and return the inorder traversal of the modified BST.
Traverse the BST to find the node to be deleted.
Handle different cases like node with no children, one child, or two children.
Update the pointers of the parent node and child nodes accordingly.
Perform inorder traversal after deletion to get the modified BST.
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...
Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.
Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.
Iterate through the original linked list to create the cloned nodes and update the hashmap.
Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.
Time comple...
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 : Must verify your CV from your seniors/batchmates.
Tip 2 : Include all the projects, intern work or hall activities or anything you have done on your own which is related to or interest of company. If you know any back-end/front-end (javascript, php, mysql etc) language do mention. I think the cv shortlist was completely based on previous work and technical skills related to Web Development/Design mentioned in the CV.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Naukri.com
based on 7 interviews
Interview experience
Director Finance
4
salaries
| ₹59 L/yr - ₹90 L/yr |
Director
4
salaries
| ₹72 L/yr - ₹250 L/yr |
Staff Engineer
4
salaries
| ₹55 L/yr - ₹130 L/yr |
Industrial Engineer
3
salaries
| ₹60 L/yr - ₹60 L/yr |
Amazon
Flipkart
BigBasket
JustDial