Deevia Software India Interview Questions and Answers

Round duration - 120 minutes
Round difficulty - Medium

Timing was in the afternoon. 
The platform was easy to operate and worked on considerable speed. 
Both the webcam and audio was supposed to be ON during the test duration.
We could switch between the questions of the same section in case we wanted to change the answers.

Q1. 
Minimum Spanning Tree Problem Statement
You are provided with an undirected, connected, and weighted graph G(V, E). The graph comprises V vertices (numbered from 0 to V-1) and E edges.
Determine and retu...read more
Ans. 
Find the total weight of the Minimum Spanning Tree in a graph using Kruskal's algorithm.
• Implement Kruskal's algorithm to find the Minimum Spanning Tree.

• Sort the edges based on their weights and add them to the MST if they don't form a cycle.

• Keep track of the total weight of the MST and return it as the output.
Answered by AI
Add your answer
Q2. 
Maximum Points On Straight Line Problem Statement
You are provided with a 2-D plane and a set of integer coordinates. Your task is to determine the maximum number of these coordinates that can be aligned ...read more
Ans. 
Find the maximum number of points that can be aligned in a straight line on a 2-D plane.
• Iterate through each pair of points and calculate the slope between them.

• Store the slope in a hashmap and keep track of the frequency of each slope.

• The maximum frequency of slopes + 1 gives the maximum number of points on a straight line.
Answered by AI
Add your answer