Filter interviews by
posted on 14 Jul 2024
I applied via Referral and was interviewed in Jan 2024. There were 2 interview rounds.
DSA asked a lot around 2 dsa questions asked
Data analysis assignemet given
Top trending discussions
I was interviewed before May 2021.
Round duration - 45 Minutes
Round difficulty - Medium
A class booking application for students to schedule and manage their classes.
Create a class booking system where students can view available classes, book classes, and manage their schedule.
Include features like class search, class details, booking confirmation, and calendar view.
Implement user authentication to ensure only registered students can book classes.
Allow students to cancel or reschedule classes with proper...
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer understand the current problem statement I was working on.
Asked the clarifying questions and alternative approaches to solve the same and their tradeoffs.
Also, asked about the technologies I was using in depth and reason for choosing the same.
You have a car with a gas tank of infinite capacity. There are 'N' gas stations located along a circular route, numbered from 0 to N-1. You begin your journey with an empty tank...
Find the starting gas station index to complete a circular route with gas and cost arrays.
Iterate through gas stations, keeping track of gas remaining after each station
If gas remaining is negative, reset starting station to current station + 1
If total gas remaining at the end is greater than or equal to total cost, return starting station index
Round duration - 45 Minutes
Round difficulty - Medium
This round was their with the CTO and was mostly the culture fitment round.
Round duration - 30 Minutes
Round difficulty - Easy
This round was with the cofounder and was mostly culture fitment.
Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts
Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand
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...
DHCP is a protocol that assigns IP addresses to devices on a network. DNS is a system that translates domain names to IP addresses.
DHCP assigns IP addresses to devices on a network
DNS translates domain names to IP addresses
DHCP reduces the need for manual IP address configuration
DNS allows users to access websites using domain names instead of IP addresses
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 Jul 2020. There was 1 interview round.
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 applied via Company Website and was interviewed in Mar 2022. There were 2 interview rounds.
They grasping our knowledge
posted on 5 Dec 2024
I applied via Campus Placement and was interviewed in Nov 2024. There were 3 interview rounds.
Platform->interview bit, Topics->linked list, arrays, duration:around 1hr
based on 1 interview
Interview experience
Operations Executive
108
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
22
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive Operations
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
BlackBuck
Delhivery
Ecom Express
Shadowfax Technologies