RKIT Software - Miracle Accounting Software Fullstack Java Developer Interview Questions and Answers

Round duration - 45 Minutes
Round difficulty - Medium

Very fixed deadline of interview of 45 min
Interviewer was friendly.
What is the difference between tag and tag?
Difference between “==” and “===” operators in js.
Explain Hoisting in javascript.

Q1. Shortest path in an unweighted graph
The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...read more
Ans. BFS
• Store all the edges in the form of an adjacency list ADJ. if ADJ[X][j] = Y which means there is an edge from X to Y.
• Declare a queue Q and push S in it and also declare two vectors VISITED and DISTANCE which will store whether a house is visited or not and what is a distance of the house from house S respectively.
• We will also store the PARENT, that store the node from which we will reach the current node. It will hel...read more
Answered by CodingNinjas
Add your answer
Q2. Dijkstra's shortest path
You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance betw...read more
Ans. Using Adjacency Matrix
The idea is to maintain two arrays, one stores the visited nodes, and the other array stores the distance (element at index ‘i’ denotes the distance from node 0 to node ‘i’). We pick an unvisited minimum distance vertex, then update the distance of all its adjacent vertices considering the path from source to an adjacent vertex to pass through the picked minimum distance vertex. Repeat the process...read more
Answered by CodingNinjas
View 1 more answer