Filter interviews by
Clear (1)
System design - ecommers website and project related
Js + react js questions
Top trending discussions
I applied via Campus Placement
Regex for email validation
Start with a string of characters followed by @ symbol
Followed by a string of characters and a period
End with a string of characters with a length of 2-6 characters
Allow for optional subdomains separated by periods
Disallow special characters except for . and _ in username
Print prime numbers in a given range and optimize the solution.
Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently
Start with a boolean array of size n+1, mark all as true
Loop through the array and mark all multiples of each prime as false
Print all the indexes that are still marked as true
Find angle between hour and minute hand in a clock given the time.
Calculate the angle made by the hour hand with respect to 12 o'clock position
Calculate the angle made by the minute hand with respect to 12 o'clock position
Find the difference between the two angles and take the absolute value
If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle
To un-hash a string, use a reverse algorithm to convert the hash back to the original string.
Create a reverse algorithm that takes the hash as input and outputs the original string
Use the same logic as the hash function but in reverse order
If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string
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.
I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.
Diameter of a binary tree is the longest path between any two leaf nodes.
Calculate the height of left and right subtrees recursively.
Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).
Return the maximum diameter.
To find interchanged terms from an AP series
Identify the common difference between terms
Swap the positions of adjacent terms
Check if the new series is also an AP
Repeat until no more interchanged terms can be found
Database indexing is a technique to improve the performance of database queries.
Indexing creates a data structure that allows for faster retrieval of data.
Indexes are created on one or more columns of a table.
Queries that use indexed columns can be executed faster.
Indexes can be clustered or non-clustered.
Clustered indexes determine the physical order of data in a table.
Non-clustered indexes create a separate structure...
I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.
Design a stack that supports getmin in O(1) time and O(1) space complexities.
Use two stacks, one for storing the actual values and the other for storing the minimum values.
When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.
When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.
To get the minimum val...
Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.
There are three main types of binary tree traversal: inorder, preorder, and postorder.
Inorder traversal visits the left subtree, then the root, then the right subtree.
Preorder traversal visits the root, then the left subtree, then the right subtree.
Postorder traversal visits the left subtree, then the right subt...
LRU cache is a data structure that stores the most recently used items and discards the least recently used items.
LRU stands for Least Recently Used
It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item
It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion
Example: A web browser cache that ...
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
Iterative solution using a stack to perform postorder traversal.
Use a stack to simulate the recursive call stack.
Push nodes in the order of right, left, root.
Pop nodes from stack and add to result array.
Repeat until stack is empty.
Design a messaging app like WhatsApp with one-to-one, group messaging, and read receipts functionalities.
Use a relational database to store user information, messages, and group memberships.
Create tables for users, messages, groups, and group memberships.
Include columns for message content, sender, receiver, timestamp, and read status.
Implement a feature to mark messages as read with read receipts.
Use indexes for effic
posted on 23 Aug 2024
My name is John Smith.
Full name is John Smith
Common name in English-speaking countries
No middle name or initial
In my free time, I enjoy hiking, playing video games, and learning new programming languages.
Hiking in local trails and national parks
Playing video games like Overwatch and Minecraft
Learning new programming languages like Python and JavaScript
I was interviewed in May 2022.
Round duration - 120 minutes
Round difficulty - Medium
Round duration - 120 minutes
Round difficulty - Medium
- Discussion on the first round's assignment
- Was asked about adding unit tests in the assignment
- Fundamental questions on the approach used for the assignment.
Some improvements in the system design problem could include better scalability planning, more efficient data storage solutions, and improved error handling.
Implementing a more robust caching mechanism to improve performance under heavy load.
Optimizing the database schema for better query performance and scalability.
Introducing load balancing and horizontal scaling to handle increased traffic.
Enhancing error handling t...
Round duration - 90 minutes
Round difficulty - Medium
Round was with tech lead. Was briefly asked about the problem I solved in the first round. Then I was asked to solve 1 medium level DSA based question. Some discussion on culture fit was also done.
Yes, an invalid state can occur if the traffic lights are in conflicting states simultaneously.
An invalid state occurs when multiple traffic lights are showing conflicting signals, such as both red and green at the same time.
This can happen due to a malfunction in the traffic light system or human error in programming the lights.
For example, if a traffic light is stuck showing both red and green signals, it would be co
Tip 1 : Have clear web dev fundamentals
Tip 2 : Have at least 1 good non-trivial project
Tip 3 : Practice basic DSA questions.
Tip 1 : For past experience (internship/full time), explain the impact you created instead of only mentioning what you did.
Tip 2 : Don't exceed 1 page.
Tip 3 : Get it cross-checked for mistakes through multiple sources.
Tip 4 : Only put in stuff that you are confident in being able to explain.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
HUB Executive
58
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
50
salaries
| ₹0 L/yr - ₹0 L/yr |
HUB Manager
38
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive
34
salaries
| ₹0 L/yr - ₹0 L/yr |
Inventory Executive
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Udaan
Ninjacart
Shadowfax Technologies
Delhivery