Directi Interview Questions, Process, and Tips

Round duration - 45 minutes
Round difficulty - Medium

This was a technical round.

Q1. 
Duplicate Elements in Array
You are provided with an array or list called ARR, consisting of N integers. These integers fall within the range from 0 to N - 1. Some elements in this array may appear more t...read more
Ans. 
Identify duplicate elements in an array of integers within the range from 0 to N - 1.
• Iterate through the array and keep track of seen elements using a hash set.

• If an element is already in the set, it is a duplicate and can be added to the result.

• Return the list of duplicate elements found in the array.

• Example: For input [1, 3, 1, 3, 4], output should be ['1', '3'].
Answered by AI
Add your answer
Q2. 
Find Triplets with Given Sum Problem Statement
Given an array ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a given integer K.
Explanation:
...read more
Ans. 
The task is to find all distinct triplets in an array that sum up to a given integer.
• Iterate through the array and use a nested loop to find all possible triplets.

• Use a set to store unique triplets and avoid duplicates.

• Check if the sum of the triplet equals the target sum.

• Return the list of valid triplets or -1 if no such triplet exists.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

This was a technical interview round with questions on Programming and algorithms.

Q1. 
Box Stacking Problem Statement
Consider you are provided with 'n' different types of rectangular 3D boxes. For each type of box, you have three separate arrays: height, width, and length that define the d...read more
Ans. 
The task is to stack different types of rectangular 3D boxes to achieve the maximum possible height.
• Iterate through all possible rotations of each box type.

• Sort the boxes based on their base dimensions in non-increasing order.

• Use dynamic programming to find the maximum height achievable by stacking the boxes.

• Consider the constraints while implementing the solution.

• Example: For input [3, [4, 1, 4], [6, 2, 5], [7, 3, 6]]
Answered by AI
Add your answer
Q2. 
Maximum Sum Subarray Problem Statement
Given an array of integers, find the maximum sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
Exp...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array in O(N) time complexity.
• Use Kadane's algorithm to find the maximum sum subarray in O(N) time complexity

• Initialize two variables: max_sum and current_sum to track the maximum sum subarray

• Iterate through the array and update current_sum by adding the current element or starting a new subarray

• Update max_sum if current_sum becomes greater than max_sum
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

This was a difficult on to face as we have to hold phone and concentrate and explaining is also very difficult.

Q1. 
Stock Buy and Sell Problem Statement
Given an array/list 'prices' where the elements represent yesterday's stock prices at each minute, determine the maximum profit possible from a single buy and sell act...read more
Ans. 
Given an array of stock prices, find the maximum profit from a single buy and sell action.
• Iterate through the 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 seen so far.

• If the profit is negative, set it to 0 as we can't sell without buying first.
Answered by AI
Add your answer
Q2. 
Dijkstra's Algorithm Problem Statement
Given an undirected graph with 'V' vertices (labeled 0, 1, ..., V-1) and 'E' edges, where each edge connects two nodes ('X', 'Y') and has a weight that denotes the di...read more
Ans. 
Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in a graph.
• Implement Dijkstra's algorithm to find the shortest path distances from node 0 to all other nodes in the graph.

• Use a priority queue to efficiently select the next node with the shortest distance.

• Initialize distances to all nodes as infinity except for the source node which is 0.

• Update distances to neighborin...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a small interaction just to make us familiar in Mumbai office.