i
Shadowfax Technologies
Filter interviews by
I was interviewed before Mar 2023.
Use a greedy algorithm to send the office bus to all locations in the city efficiently.
Start from the office location and pick the nearest location to visit next.
Continue picking the nearest unvisited location until all locations are covered.
Repeat the process until all locations are visited.
Consider using Dijkstra's algorithm or a similar approach for finding the nearest location.
Optimize the route by considering traf
Top trending discussions
OOPs (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPs focuses on creating objects that interact with each other to solve problems
Key concepts include encapsulation, inheritance, and polymorphism
Encapsulation allows data to be hidden within an object and only accessed through methods
Inheritance allows a class to inherit properties and methods f...
OOPs (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.
OOPs focuses on creating objects that interact with each other to solve problems
Key concepts include encapsulation, inheritance, and polymorphism
Encapsulation allows data to be hidden within an object and only accessed through methods
Inheritance allows a class to inherit properties and methods f...
posted on 22 Jul 2023
I applied via Recruitment Consulltant and was interviewed in Jun 2023. There were 4 interview rounds.
It was a normal aptitude test with mathematical questions.
It was a techno-coding test where I had to code while sharing my screen on a live conversation with the interviewer.
I would analyze the current approach, identify the root cause of the issue, brainstorm alternative solutions, and collaborate with the team to implement and test them.
Analyze the current approach to identify weaknesses
Brainstorm alternative solutions with the team
Implement and test the new solutions
Regularly communicate and collaborate with team members
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.
Team Lead
501
salaries
| ₹1.1 L/yr - ₹5.1 L/yr |
Assistant Manager
370
salaries
| ₹4 L/yr - ₹10.6 L/yr |
Associate Lead
237
salaries
| ₹2.7 L/yr - ₹5 L/yr |
Senior Executive
198
salaries
| ₹2.1 L/yr - ₹4.8 L/yr |
HUB Incharge
189
salaries
| ₹1.8 L/yr - ₹5.4 L/yr |
Delhivery
Rivigo
Ecom Express
XpressBees