i
Brakes India
Filter interviews by
To find the minimum in an array of strings, convert the strings to numbers and compare them.
Convert the strings to numbers using parseInt() or parseFloat()
Use Math.min() to find the minimum value
Handle edge cases like empty array or non-numeric strings
To find the shortest distance between two nodes, we can use algorithms like Dijkstra's or A*.
Use Dijkstra's algorithm to find the shortest path between two nodes in a graph
Implement A* algorithm for finding the shortest path in a grid-based environment
Consider using Floyd-Warshall algorithm for finding all pairs shortest paths in a graph
Basic aptitude questions
Top trending discussions
based on 1 interview
Interview experience
Trainee
272
salaries
| ₹0.9 L/yr - ₹3.1 L/yr |
Engineer
224
salaries
| ₹2.5 L/yr - ₹8.6 L/yr |
Junior Engineer
203
salaries
| ₹1.5 L/yr - ₹4.6 L/yr |
Senior Engineer
167
salaries
| ₹5.7 L/yr - ₹12.4 L/yr |
Deputy Engineer
150
salaries
| ₹3.2 L/yr - ₹7.7 L/yr |
Bosch
TVS Motor
Mahindra & Mahindra
Tata Motors