AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Directi Application Developer Interview Questions and Answers
Directi Application Developer Interview Experiences
3 interviews found
Anantharam
Interview Preparation Tips
Experience: There is a drought situation in Agrabah.King got worried and called Aladdin for helping him out.
As he is a modern Aladdin he took printouts of places around Agrabah from google maps.For
analyzing the map properly, he converted the map into a M x N grid. Each point is represented
by either ‘0’ or ‘1’.
‘1’ represents the unit area of water and ‘0’ represents the unit area of land. King told him to find
the largest continuous patch of water so that he can send his people over there.
As our Aladdin is modern, but not a good programmer, he wants your help. Help him out by
printing out the largest area water patch available on map.
Round: Phone interview
Experience: 1)There are three types of balls arranged linearly in a random order Red, Green and Blue. Now
your job is to sort them so that the Red balls are in front follwed by the Green balls and the Blue
balls are pushed to the bask.
This problem was the same as sorting the array of 0, 1 and 2. we can do this in o(n)
using two pointers.
2)Given an n x n matrix, where every row and column is sorted in increasing order. Given a
number x, how to decide whether this x is in the matrix. The designed algorithm should have
linear time complexity.
a) Start with top right element
b) Loop: compare this element e with x
i) if they are equal then return its position
ii) e < x then move it to down (if out of bound of matrix then break return false)
iii) e > x then move it to left (if out of bound of matrix then break return false)
c) repeat the i), ii) and iii) till you find element or returned false
3)In the same matrix mentioned above find the kth maximum element.
I said that we just need to compare the last K x K sub matrix and to find the Kth element.
4)Given a set of integers, Display the nonempty subsets whose sum is zero. For example,
given the set { −7, −3, −2, 5, 8}, the answer is the subset { −3, −2, 5} which sums to zero.
This is the special case of knapsack problem and hence it is NPComplete so i said we
cannot find the solution in polynomial time.We consider all the subsets with k elements. Then
check how many of these sets have a sum of 0. This is an exponential time algorithm.
5)Create a data structure where inserting, deleting and finding the minimum element all have
O(1) time.
i said we can use augmented stack where with each element we can augment the
minimum element along with its actual value.Then he said “what if you cannot create any new
data structure but have to use only the previously available data structures?” I replied that then
we can use two stacks one to store the actual data and other to store the minimum values.
Skills:
College Name: Anna University Chennai
Interview Preparation Tips
Experience: 1. Queue in O(1) solution.. I came up with a method and it was not the most optimal one…
and I asked if I should optimize more.. he said he was happy with the solution I gave and
proceeded to the next question…
2. For eg.. if there is a string abda. I shud reverse it n/2 times.. ie… say
1st rev: adba
2nd rev: (during the second reversal I shouldnot rev from beg.. but rev the string between ( i+1,j
1) where i=0,j=n1in the first case….)ie
a db a => a bd a….
so it is abda finally….after n/2 reversal we get the initial string which is abda.. this is a
favourable case and I increment the count by 1…
The question is give the string length say n=4 how do u find out the total number of strings
which will have the favourable condition after n/2 reversals…. I came up with a solution… just
think over it.. not a difficult one… just 5mins of thinking will get u reach the right answer….
3. There are 100 petrol pumps between two points A and B/.. u have to select 10(say) petrol
pumps such that the largest distance between any two petrol pumps should be minimum…I gave
a top down approach.. guess he expected a bottom up approach…. But at the end he was quite
happy with my answer…
4. tel me a scenario where i cud use MERGE SORT AND QUICK SORT AND WHERE I CAN
USE ONE NOT THE OTHER.. and the differences...
MERGE SORT:
when there is 1GB of things to be solved we can divide that 1 GB into A*B=1GB , such that
each division will have a size of A(MBs)... in this case I cannot bring the entire 1GB into
memory.. So i ll bring A(MB) into memory at a time sort it and keep it and sort all the B
divisions and do a BWAY Merge... which will be easier... But this kinda thing cant be done in
quick sort...
Quick SORT:
if we want to find the Kth smallest v can use quick sort without sorting the entire array but its
enuogh.. till the pivot element is placed at the kth position... (random select...)...... this cant be
applied for merge sort..where v have to sort the entire thick to identify.. kth smallest...
Round: Technical Interview
Experience: This round involved all concepts right from OS, DBMS, Networks, Data structure, Algorithms, your
projects, a slight touch on testing…
Topics covered in each subject:
OS: Threads, process… difference.. if threads have more advantages y go for process??
Semaphores, Synchronization, concurrency problems, Second chance algorithm in virtual
memory chapter….
DBMS: Second highest salary… TRY TO USE TOP… I TOLD HIM TWO SOLUTIONS ONE
WITH TOP AND OTHER WITHOUT TOP … But he emphasized me to use TOP first.. So use
that…
He gave me a set of tables and asked me write queries
Indexing was also an important concept he asked me.. B+ trees properties and how used in DB.
Normalization of my tables in my project….
Data structures:
Difference between binary trees, hash map, Tries.
A scenario where BST has advantages than hash map without any collision.
How do we avoid collision in hash
Example of a good hash being used…(I told STL..he said no that’s a different concept.. I then
said…Java hash map…..that was the right answer… time for getting.. most of the time O(1) and
depending on the inputs and the things it might vary accordingly )
Tries advantages and wen can it be used….and application of it..
Networks:
Layers of OSi.. explanation of each layer
Google.com steps involved
About DNS
Testing:
What do u know about testing…
I explained back and white box testing… alpha n beta testing.. and he said..he was not proficient
in it..n stopped…
Algorithms: (besides the algorithm round)
Difference in greedy n dynamic… which is better….
Kinda company oriented questions:
advantages and disadvantages of that site…
what I know About Advertising online…
all this went for around 1.5 hrs
Skills:
College Name: Anna University Chennai
Interview Preparation Tips
Experience: 1. My first question was to design a data structure to store a dictionary . I gave a solution to use
a trie with 26 pointers for each character . Now he asked me to reduce the no of pointers .
He gave me an example of our phone , where we use only 10 digits to make a combination of
all the words instead of 26 different buttons of every character .
Then for this type of a system he asked me to design a data structure . Well I gave a solution
with which he was satisfied .
Note : for this hashing is not an efficient solution .
2. The next one was to design a data structure ( he explicitly expressed it as a queue ) where
inserting , deleting and finding minimum is done in O(1) time . here you can use additional
memory but they were very much concerned about the time i.e O(1) . I answered them using
additional queue .
3. Then he asked me a algorithm problem . The statement goes like this
You are given two end points ( consider them as two end stations at some distance )
there are 100 stations between these two . Now you need to build a train track between these
two end points which includes only 10 stations and not more than that . Now the objective is to
find such 10 stations such that the maximum distance between any two consecutive stations is
minimum
College Name: Anna University Chennai
Top trending discussions
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
Interview Questionnaire
1 Question
- Q1. Java multithreading, oops
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
Interview Questionnaire
2 Questions
- Q1. 1. If you given a no return its corresponding excel no.
- Ans.
Convert given no to corresponding excel no.
Excel no starts from 1 and goes up to 16384
Excel no is calculated using column and row numbers
For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on
- Q2. 2. find unique character in a window of k size in a string
- Ans.
Find unique characters in a window of k size in a string.
Use a sliding window approach.
Maintain a hash table to keep track of character frequency.
Remove characters from hash table as the window slides.
Interview Preparation Tips
Skills evaluated in this interview
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
Software Developer Interview Questions & Answers
Bounteous x Accolite
Anonymous
posted on 30 Nov 2024
Selected
I applied via LinkedIn and was interviewed before Nov 2023. There were 2 interview rounds.
1 dsa , aptitude questions
(2 Questions)
- Q1. DSA medium level questions
- Q2. Resume based questions
Interview Preparation Tips
Software Developer Interview Questions & Answers
Bounteous x Accolite
Siddharth Goyal
posted on 29 May 2024
(2 Questions)
- Q1. Tell me about spring boot
- Ans.
Spring Boot is a framework that simplifies the development of Java applications by providing pre-configured settings and tools.
Spring Boot eliminates the need for manual configuration by providing defaults for most settings.
It allows developers to create stand-alone, production-grade Spring-based Applications.
Spring Boot includes an embedded Tomcat, Jetty, or Undertow server, making it easy to deploy web applications.
I...
- Q2. Tell me about last projects
DP, Binary Search, Greedy, etc
Interview Preparation Tips
Skills evaluated in this interview
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 Application Developer Interview Questions
- Associate Application Developer Interview Questions
- Application Development Team Lead Interview Questions
- Applications Engineer Interview Questions
- Application Development Analyst Interview Questions
- Web Application Developer Interview Questions
- Application Support Engineer Interview Questions
- Application Development Engineer Interview Questions
- Show more
Interview Questions from Similar Companies
Fast track your campus placements
|
Software Development Engineer II
13
salaries
|  ₹21.5 L/yr - ₹55 L/yr |
|
Software Developer
11
salaries
| ₹19.9 L/yr - ₹36 L/yr |
|
Product Manager
11
salaries
| ₹21 L/yr - ₹35 L/yr |
|
Senior Software Engineer
10
salaries
| ₹25 L/yr - ₹57 L/yr |
|
Senior Key Account Manager
8
salaries
| ₹11.2 L/yr - ₹13 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant
- Home >
- Interviews >
- Directi Interview Questions >
- Directi Application Developer Interview Questions
