Cisco
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Nodal moving using heap at min cost involves finding the shortest path between nodes using a heap data structure.
Use Dijkstra's algorithm to find the shortest path between nodes in a graph.
Implement a min heap to efficiently store and retrieve nodes based on their cost.
Update the cost of nodes in the heap as you explore the graph to find the minimum cost path.
Example: Find the shortest path between two cities in a road...
Hard interviewer was friendly
Top trending discussions
I applied via Referral and was interviewed before Nov 2021. There were 2 interview rounds.
To rotate a matrix's values, transpose the matrix and then reverse each row or column.
Transpose the matrix by swapping elements across the diagonal
Reverse each row or column to rotate the matrix
For clockwise rotation, reverse the rows. For anti-clockwise, reverse the columns
Example: [[1,2,3],[4,5,6],[7,8,9]] -> [[1,4,7],[2,5,8],[3,6,9]] -> [[7,4,1],[8,5,2],[9,6,3]]
I applied via Referral and was interviewed before Nov 2021. There were 2 interview rounds.
To rotate a matrix's values, transpose the matrix and then reverse each row or column.
Transpose the matrix by swapping elements across the diagonal
Reverse each row or column to rotate the matrix
For clockwise rotation, reverse the rows. For anti-clockwise, reverse the columns
Example: [[1,2,3],[4,5,6],[7,8,9]] -> [[1,4,7],[2,5,8],[3,6,9]] -> [[7,4,1],[8,5,2],[9,6,3]]
based on 1 interview
Interview experience
Software Engineer
2.6k
salaries
| ₹10.1 L/yr - ₹39 L/yr |
Technical Consulting Engineer
652
salaries
| ₹8 L/yr - ₹30 L/yr |
Senior Software Engineer
633
salaries
| ₹14 L/yr - ₹48.8 L/yr |
Network Engineer
393
salaries
| ₹3.8 L/yr - ₹13 L/yr |
Software Developer
339
salaries
| ₹10.4 L/yr - ₹41 L/yr |
Microsoft Corporation
Hewlett Packard Enterprise
Juniper Networks