i
ElasticRun
Filter interviews by
Visual Reasoning questions
Mostly string based questions
I applied via Referral and was interviewed before Jan 2022. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed in Aug 2021. There was 1 interview round.
Find all nodes at a distance K from a given node in a tree.
Use DFS to traverse the tree and mark the nodes at distance K from the given node.
Maintain a visited set to avoid revisiting nodes.
Use a queue to keep track of the nodes to be visited next.
If the given node is the root, traverse the entire tree and mark nodes at distance K.
If K is 0, return the given node itself.
I applied via Hirist and was interviewed in Apr 2024. There were 2 interview rounds.
I applied via Company Website and was interviewed in Mar 2022. There were 2 interview rounds.
They grasping our knowledge
I applied via Naukri.com and was interviewed before Nov 2023. There was 1 interview round.
I applied via Company Website and was interviewed in Mar 2022. There were 2 interview rounds.
They grasping our knowledge
posted on 3 Jul 2021
I applied via Campus Placement and was interviewed in Jun 2021. There were 3 interview rounds.
I appeared for an interview before Feb 2023.
Basic algorithms testing
I appeared for an interview 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
based on 2 interviews
Interview experience
based on 12 reviews
Rating in categories
Team Lead
454
salaries
| ₹2 L/yr - ₹6 L/yr |
Team Lead Operations
269
salaries
| ₹2 L/yr - ₹5.3 L/yr |
Area Sales Manager
189
salaries
| ₹7.4 L/yr - ₹24.7 L/yr |
Area Manager
187
salaries
| ₹3 L/yr - ₹11 L/yr |
City Manager
155
salaries
| ₹3 L/yr - ₹10.2 L/yr |
Mahindra Logistics
DTDC Express
GATI-KWE
Exl India