Directi Software Developer Intern Interview Questions, Process, and Tips

3 coding questions, very basic

Q1. Again DSA and DBMS questions, easy to medium easy
Add your answer

Q1. There are three technical rounds one round will be tough
Add your answer

Q1. They didn't ask me anything
Add your answer
Q2. Will give U false promises and showoff about the company
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Timing of test start from 11 AM and everything goes well here .

Q1. What is segmentation in the context of operating systems?
Add your answer
Q2. How many levels of normalization are there in database management systems?
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It happen nicely and no problem occur.

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. Brute Force Approach
The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.
 
Here is the algorithm :
 
1. Iterate over every elevation or element and find the maximum elevation on to the left and right of it. Say, the maximum elevation on to the left of the current elevation or element that we are looking at is ‘maxLeftHeight’ and the maximum elevation on...read more
Answered Anonymously
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. Sorting
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
• Sort the Array and just return.
Space Complexity: O(1)Explanation:
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:
O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Answered Anonymously
Add your answer

Round duration - 90 mintues
Round difficulty - Hard

Environment is very bad the intervier video call is lagging.

Q1. What are the sub-parts or phases of the analysis part in compiler design?
Add your answer
Q2. 
Left Rotations of an Array
Given an array of size N and Q queries, each query requires left rotating the original array by a specified number of elements. Return the modified array for each query.
Input:
...read more
Ans. Rotate One Element At A Time
The idea is to create a function which would rotate the array one element at a time. This can be done by shifting the array towards left by one element and copying the first element to the end of the array. For every query repeatedly call the above function, until the desired rotation is obtained.
 
If the number of rotations required, say ‘K’, is greater than the number of elements, ‘N’,...read more
Answered Anonymously
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was 10 AM. Platform was very lagging. So overall it was not a good experience.

Q1. 
Topological Sort Problem Statement
You are given a directed acyclic graph (DAG). Your task is to perform topological sorting of the graph and return any valid ordering.
Explanation:
A directed acyclic g...read more
Ans. DFS traversal of DAG
In topological sort a vertex u must come before vertex v if there is a directed edge between u and v. We can modify DFS traversal of a graph to achieve this.
 
The algorithm will be-
• We can declare a stack ‘topSort’ which will store the nodes after the topological sort.
• We also maintain an array/list ‘visited’ of size N, denoting which node is visited in a dfs traversal. Initially, all elements of ...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

This round contains only 1 coding question which you have to solve in the language selected by you at the time of registration.
(Note: One can have to attempt the question in C language is he/she had selected C++ language at the time of registration).

Q1. 
Topological Sort Problem Statement
Given a Directed Acyclic Graph (DAG) consisting of V vertices and E edges, your task is to find any topological sorting of this DAG. You need to return an array of size ...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This is a technical interview which was held on google meet. The interviewer helps me to be comfortable. He first asked me some basic questions on OOPS concepts like function overloading and overriding. Then he asked me to explain any of my project and also put some question around it. After that he asked me one DSA question and share a google docs on which I have to code it. Then we dry run the code and he was satisfied with the solution.

Q1. 
Distinct Occurrences Problem Statement
You are given two strings 'A' and 'B' of lengths 'N' and 'M' respectively. Your task is to determine how many distinct ways string 'B' occurs as a subsequence in str...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This round is also a Technical Interview round. The main focus of interviewer was on OOPS concepts. Around 30mins he came up with OOPS questions only like abstract class, inheritance, interfaces, exception handling and alot of other topics. Then he asked some DBMS concepts like normalization and some SQL queries for which I gave him satisfactory answer. He also asked questions around Data structures like what are queues, stack, hashmap etc. In the end he asked one DSA question around Linked List.

Q1. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Add your answer