EVC LABS Interview Questions and Answers

Round duration - 70 Minutes
Round difficulty - Hard

The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.

Q1. 
Unweighted Graph Shortest Path Problem
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N houses numbered from 1 ...read more
Ans. 
Find the shortest path between two houses in a city represented as an unweighted graph.
• Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.

• Start BFS from the source house and keep track of the path taken to reach each house.

• Once the destination house is reached, backtrack from destination to source to find the shortest path.

• Consider using a queue data structure to implement BFS eff...read more
Answered by AI
Add your answer
Q2. 
Check If Two Nodes Are Cousins
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a and b. Your task is to determine if ...read more
Ans. 
Check if two nodes in a binary tree are cousins by comparing their levels and parents.
• Traverse the tree to find the levels and parents of the given nodes.

• Compare the levels and parents of the two nodes to determine if they are cousins.

• If the levels are the same and the parents are different, the nodes are cousins.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It contained two programming questions.

Q1. 
Counting Nodes in a Complete Binary Tree - Problem Statement
Given the root of a complete binary tree, calculate the total number of nodes in this tree.
A complete binary tree is defined as a binary tree...read more
Ans. 
Count the total number of nodes in a complete binary tree given its root.
• Traverse the tree in level order and count the nodes

• Use a queue to keep track of nodes at each level

• Check for null nodes represented by -1 in the input

• The total number of nodes in the example tree is 7
Answered by AI
Add your answer
Q2. 
Rearrange Array Numbers for Largest Possible Number
Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt...read more
Ans. 
Rearrange array numbers to form the largest possible numerical value by combining digits of each number in the array.
• Convert integers in the array to strings for easier manipulation.

• Sort the array of strings in non-increasing order based on custom comparison function.

• Join the sorted strings to form the largest possible number.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was more of a interaction round with some technical skills.

Q1. Can you explain the ACID properties and the rollback mechanism in DBMS?
Ans. 
ACID properties ensure database transactions are processed reliably. Rollback mechanism undoes changes if transaction fails.
• ACID properties: Atomicity, Consistency, Isolation, Durability

• Atomicity ensures all operations in a transaction are completed successfully or none at all

• Consistency ensures database remains in a valid state before and after transaction

• Isolation ensures transactions are independent and do not inter...read more
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

The interviewer was friendly. Explained the question well. Allowed to use any preferred platform to write code.

Q1. 
Best Time to Buy and Sell Stock Problem Statement
Given an array prices representing the prices of a stock where each element indicates the price at a given minute, determine the maximum profit you can ac...read more
Ans. 
Find the maximum profit by buying and selling a stock once based on given prices.
• Iterate through the prices array and keep track of the minimum price seen so far and the maximum profit achievable.

• Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.

• Return the maximum profit, ensuring it is not negative.

• Example: prices = [2, 100, 150, 120], Buy at 2, sell a
Answered by AI
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Dance Team Pairing Challenge
Imagine you are helping Ninja, a dance coach, who needs to form dance pairs from the available boys and girls in a studio. Given the number of boys N, the number of girls M, a...read more
Ans. 
The challenge involves forming dance pairs from available boys and girls based on potential pairings to maximize the number of pairs.
• Parse the input to get the number of test cases, boys, girls, and potential pairings.

• Iterate through the potential pairings and form pairs based on the given indexes.

• Output '1' if a set of maximum possible pairs is returned, else output '0'.

• There can be multiple valid configurations of pa...read more
Answered by AI
Add your answer
Q2. What is the difference between multiprocessing and multithreading?
Ans. 
Multiprocessing involves multiple processes running concurrently, while multithreading involves multiple threads within a single process.
• Multiprocessing utilizes multiple processes to execute tasks simultaneously.

• Multithreading involves multiple threads within a single process sharing the same memory space.

• Multiprocessing is typically used for CPU-bound tasks, while multithreading is more suitable for I/O-bound tasks.

• E...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

Q1. Can you describe the classes and functions involved in the design of a system like Splitwise?
Ans. 
Splitwise is a system for managing shared expenses among groups of people.
• Classes: User, Expense, Group

• Functions: addExpense(), settleUp(), calculateBalance()
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard