AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Directi Software Developer Interview Questions, Process, and Tips
Top Directi Software Developer Interview Questions and Answers
- 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 elem ...read more
- Q2. Leaf Nodes Retrieval from Binary Tree Given a binary tree, implement a function that returns a list of leaf nodes following their appearance from left to right. If leaf ...read more
- Q3. 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') ...read more
Directi Software Developer Interview Experiences
5 interviews found
Selected
I applied via Naukri.com and was interviewed before Jun 2023. There were 2 interview rounds.
Given a set of questions to be solved within a given time frame.
(3 Questions)
- Q1. About myself and projects done during my academics
- Q2. Various Oops concepts
- Q3. DNS concepts -How does internet work? what happens when someone types a url in browser?
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
It was problem solving round.
Questions revolve around solving problems in javascript.
Like deep flattened the array, print level wise elements of same problem.
- Q1.
Occurrence of X in a Sorted Array Problem Statement
Given a sorted array of integers of size N and an integer X, determine the total number of occurrences of X in the array.
Input:
The first line of the... - Ans.
Count occurrences of a given integer in a sorted array.
Use binary search to find the first and last occurrence of X in the array.
Calculate the total occurrences by subtracting the indices and adding 1.
Handle edge cases like X not present in the array.
Time complexity can be O(log N) using binary search.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
There were 2 problems, related to DS and Algorithms.
- Q1.
Leaf Nodes Retrieval from Binary Tree
Given a binary tree, implement a function that returns a list of leaf nodes following their appearance from left to right. If leaf nodes are equidistant from the left...
- Ans.
Implement a function to retrieve leaf nodes from a binary tree in left-to-right order.
Traverse the binary tree in a depth-first manner, keeping track of leaf nodes encountered.
Store leaf nodes in a list while traversing the tree.
If leaf nodes are equidistant from the leftmost node, prefer the node at a lesser depth.
Return the list of leaf nodes in the order they appear from left to right.
- Q2.
Exclusive Time of Functions
We are executing a program containing 'N' functions on a single-threaded CPU. Each function has a unique 'ID' between 0 and (N-1). Each time a function starts or ends, a log is...
- Ans.
Calculate exclusive time of functions based on logs of function start and end times.
Parse the input logs to calculate exclusive time for each function ID.
Use a stack to keep track of function start times and calculate exclusive time when function ends.
Iterate through the logs and update exclusive time for each function ID accordingly.
Round duration - 60 Minutes
Round difficulty - Medium
Round duration - 60 minutes
Round difficulty - Medium
Round duration - 15 minutes
Round difficulty - Easy
Interview Preparation Tips
Tip 1 : Develop a lots of projects with medium complexity [around 5-8].
Tip 2 : Develop projects using css, js html to practice machine coding round under time constraints
Tip 3 : Prepare mostly asked interview questions in JS.
Tip 1: Keep resume only 1 page, don't keep your college at top of resume unless you are from tier 1 and good academic record [I keep at last , though from tier 1 college but poor academic record] .
Tip 2: Write projects, interns and what impact you made, don't waste lines about project.
Skills evaluated in this interview
Interview Preparation Tips
Skills: Problem Solving Qualities
College Name: IIT KHARAGPUR
I appeared for an interview in May 2016.
Interview Preparation Tips
Experience: You are given N ranges of the form [A,B]. Find all the ranges which occur atleast K times.
Round: Algorithmic Round
Experience: 1. Find the number of ways from reaching (1,1) to (N,M) when only right and down moves are allowed in O(N+M) complexity.
2. A row-wise and column-wise sorted matrix is given. Find an element in O(N+M) complexity.
Round: Algorithmic Round
Experience: 1. Check whether the given graph is bipartite or not.
2. Given a sorted array,find the longest sequence in AP.
Skills: Algorithm, Data Structures
College Name: NIT Allahabad
Directi interview questions for designations
I appeared for an interview before May 2021.
(2 Questions)
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 ofNintegers. These integers fall within the range from 0 to N - 1. Some elements in this array may appear more t... - 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'].
- Q2.
Find Triplets with Given Sum Problem Statement
Given an array
ARRconsisting ofNintegers, your task is to identify all distinct triplets within the array that sum up to a given integerK.Explanation:
... - 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.
(2 Questions)
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, andlengththat define the d... - 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]]
- 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...
- 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
(2 Questions)
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...
- 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.
- 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...
- 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...
Round duration - 30 minutes
Round difficulty - Easy
This was a small interaction just to make us familiar in Mumbai office.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Get interview-ready with Top Directi Interview Questions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.
- Q1.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges in a grid.
Use Breadth First Search (BFS) to simulate the rotting process
Track the time taken to rot all oranges and return -1 if any fresh oranges remain
Handle edge cases like no fresh oranges or all oranges already rotten
Consider using a queue to efficiently process adjacent oranges
- Q2.
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...
- Ans.
Find the majority element in an array, return -1 if no majority element exists.
Iterate through the array and keep track of the count of each element using a hashmap.
Check if any element's count is greater than floor(N/2) to determine the majority element.
Return the majority element or -1 if no majority element exists.
- Q3.
Maximum Path Sum Between Two Leaves Problem Description
You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...
- Ans.
Find the maximum path sum between two leaf nodes in a binary tree.
Traverse the tree to find the maximum path sum between two leaf nodes.
Keep track of the maximum sum found so far.
Consider all possible paths between leaf nodes.
Handle cases where the tree has only a single leaf node.
Implement a recursive function to calculate the maximum path sum.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was a technical round with DSA based questions.
- Q1.
N-th Node From The End Problem Statement
You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.
Example:
Input:
If the given list is (1 -> -2 -&g...
- Ans.
Find the N-th node from the end of a Singly Linked List of integers.
Traverse the list to find the length L of the list.
Calculate the position of the N-th node from the beginning as L - N + 1.
Traverse the list again to reach the calculated position and return the node's value.
- Q2.
LCA of Binary Tree Problem Statement
You are given a binary tree consisting of distinct integers and two nodes,
XandY. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes... - Ans.
Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.
Traverse the binary tree to find the paths from the root to nodes X and Y.
Compare the paths to find the last common node, which is the LCA.
Handle cases where one node is an ancestor of the other or when one node is the LCA itself.
- Q3.
Reverse Words in a String: Problem Statement
You are given a string of length
N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o... - Ans.
Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.
Split the input string by spaces to get individual words
Reverse the list of words
Join the reversed words with a single space in between
Handle leading/trailing spaces by stripping them before and after reversing
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA
- Q1.
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...
- Ans.
Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.
Sort subjects in descending order
Assign subjects to friends one by one until all subjects are assigned
The maximum workload will be the sum of problems assigned to the friend with the most problems
Return the maximum workload as the minimum time required
- Q2. What is grammar in the context of compiler design?
- Ans.
Grammar in compiler design defines the syntax and structure of a programming language.
Grammar specifies the rules for forming valid statements in a programming language.
It consists of a set of production rules that define how valid programs can be constructed.
There are different types of grammars such as context-free grammar, regular grammar, etc.
Example: In C programming language, the grammar specifies that a for loop...
- Q3. What is a token in compiler design?
- Ans.
A token in compiler design is a basic unit of syntax that the compiler can understand and process.
Tokens are the smallest units of a program that are meaningful to the compiler.
Examples of tokens include keywords, identifiers, operators, and punctuation symbols.
Tokens are generated by the lexical analysis phase of the compiler.
Tokens are used by the parser to build the abstract syntax tree of the program.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.
- Q1.
Sum Root to Leaf Numbers
You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...
- Ans.
Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.
Traverse the binary tree from root to leaf nodes, keeping track of the current path sum
Add the current path sum to the total sum when reaching a leaf node
Use modulo (10^9 + 7) to handle large outputs
- Q2. What is a regular language?
- Ans.
A regular language is a language that can be recognized by a finite automaton.
Regular languages can be described by regular expressions.
Regular languages are closed under union, concatenation, and Kleene star operations.
Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.
- Q3. What are NP and NP-Hard problems?
- Ans.
NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.
NP problems can be verified in polynomial time but not necessarily solved in polynomial time.
NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.
Examples of NP problems include the subset sum problem and the traveling salesm...
Round duration - 30 minutes
Round difficulty - Easy
That was the round for which I’ve been waiting for hours
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I applied via Company Website and was interviewed in Jun 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Related to react js amd js
Interview Preparation Tips
Normal aptitude questions
Not exactly coding, it was an automata fixround
(1 Question)
- Q1. Basics of project, oops, sql
(1 Question)
- Q1. It was a tehno managerial round. Consisting of puzzles, oops & situation based questions
Interview Preparation Tips
Pay is a bit less for freshers, which is in case of all service based company
amit kashyap
I applied via Naukri.com and was interviewed in Jun 2021. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. They asked me questions related to my project on which i had work in my last company. And there were questions from core java , database, collections, Spring framework ,
Interview Preparation Tips
I applied via Campus Placement
40 MCQ and 7 coding mcq and 10 english
(2 Questions)
- Q1. Time complexity and space complexity
- Q2. Coding pattern question and explain its complexity
Interview Preparation Tips
- Dsa
Prepare about your projects
Directi Interview FAQs
Tell us how to improve this page.
Directi Interviews By Designations
- Directi Software Developer Interview Questions
- Directi Application Developer Interview Questions
- Directi Software Engineer Interview Questions
- Directi Product Manager Interview Questions
- Directi Applications Engineer Interview Questions
- Directi IT Support Executive Interview Questions
- Directi Platform Engineer Interview Questions
- Directi Intern Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
Directi Software Developer Interview Process
based on 3 interviews
Interview experience
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Directi Software Developer Reviews and Ratings
based on 1 review
Rating in categories
|
Software Development Engineer II
13
salaries
|  ₹21.5 L/yr - ₹55 L/yr |
|
Software Developer
11
salaries
| ₹19.9 L/yr - ₹36 L/yr |
|
Senior Software Engineer
11
salaries
| ₹25 L/yr - ₹57 L/yr |
|
Product Manager
11
salaries
| ₹21 L/yr - ₹35 L/yr |
|
Software Engineer
9
salaries
| ₹9.1 L/yr - ₹36.4 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant
- Home >
- Interviews >
- Directi Interview Questions >
- Directi Software Developer Interview Questions
