AmbitionBox
Search
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
Updated
24 Nov 2015
Directi Application Developer Interview Experiences
3 interviews found
Interview Preparation Tips
Round: Test
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
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
Round: Test
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
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
asked in
Oracle
Q1. Minimum Cost to Connect All Points Problem Statement Given an arr ... read more
asked in
Fujitsu
Q2. Reverse Linked List Problem Statement Given a singly linked list ... read more
asked in
Oracle
Q3. Puzzle: – Two persons X and Y are sitting side by side with a coi ... read more
asked in
Oracle
Q4. Count Subsequences Problem Statement Given an integer array ARR o ... read more
asked in
Oracle
Q5. Remove the Kth Node from the End of a Linked List You are given a ... read more
Interview Preparation Tips
Round: Test
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
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
Top trending discussions
View All
Salary Discussions, Hike & Promotions
2w (edited)
easylobster11
·
works at
Accenture
Confused between 2 offers
Hi all, I am having two offers- one from Infy (Kolkata) another from Deloitte (Hyd). Kolkata being my preferred location, while Deloitte offering 15k more monthly. (I know Hyd's expense will cancel this out eventually).
Kindly suggest on what to do. This is my first switch.
Thanks in advance.
Got a question about Directi?
Ask anonymously on communities.
Interview questions from similar companies
Application Developer Interview Questions & Answers
QualityKiosk Technologies
Anonymous
posted on 10 Jul 2024
Interview experience
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test
Simple aptitude , 3 coding question on basic,2Sql question
Round 2 - Group Discussion
Simple topics of current affairs
Interview Preparation Tips
Interview preparation tips for other job seekers - Simple and easy process one apti round one gd and two technical interview with one hr interview
Interview experience
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected
I applied via Campus Placement and was interviewed before Jul 2022. There were 4 interview rounds.
Round 1 - Aptitude Test
MCQ questions related to data structures and algorithms and some easy-medium leetcode coding questions
Round 2 - Code Pairing
(1 Question)
- Q1. A problem was given which was required to be solved using the concepts of OOPS with clean code.
Add your answer
Round 3 - Technical
(3 Questions)
- Q1. Introduce yourself and explain any one of the projects
- Q2. Questions related to HTML and CSS
- Q3. DSA questions related to Strings, two-pointers, maps, etc. Difficulty : easy-medium
Add your answer
Add your answer
Add your answer
Round 4 - Social change and Leadership
(1 Question)
- Q1. The interviewer asked me to choose a social topic and then questions following to that topic were asked. This round was more of a discussion type round where they checked my social and leadership skills.
Add your answer
Interview Preparation Tips
Interview preparation tips for other job seekers - Thorough knowledge of OOPS and DSA is required. Except that you must be well aware of your Resume and must be able to explain anything from it. The interviewers were friendly and cool
Application Developer Interview Questions & Answers
Wissen Technology
Anonymous
posted on 19 May 2021
I applied via Naukri.com and was interviewed in Apr 2021. There were 4 interview rounds.
Interview Questionnaire
7 Questions
- Q1. 1. Aptitude, coding and db schema design round
- Q2. 2. Telephonic Interview - array based question
- Q3. Collection Framework
- Q4. DB query (where and having)
- Q5. Linux command
- Q6. 3. F2F tech - flood fill, db normalization, inheritance
- Q7. 4. HR round
Add your answer
Add your answer
Add your answer
Add your answer
Add your answer
Add your answer
Add your answer
Interview Preparation Tips
Interview preparation tips for other job seekers - Stick to the basics. The interviewers are helpful
Anonymous
Round 1 - Aptitude Test
(1 Question)
- Q1. The duration of the test is around 2 hours. It has questions from DSA on topics like Graphs, Arrays, etc. and MCQs from other topics of OOPS and DBMS. Swapping adjacent, counting votes and Pair Sum.
Add your answer
Round 2 - Technical
(1 Question)
- Q1. Problem statement: Aapali Taxi is a taxi cab operator. They have 3 types of cars- Mini, Sedan and SUV, each with different tariffs. When customers approach them for booking rides, they show an “Estimated ...
Add your answer
Round 3 - Technical
(5 Questions)
- Q1. 1. Permutations of the string.
- Ans.
Permutations of a string can be generated using recursion and swapping characters.
Use recursion to generate all possible permutations
Swap characters to create new permutations
Store permutations in an array of strings
Handle duplicate characters to avoid repetition
- Q2. 2. How will you design a database to manage the songs playlist on Spotify?
- Ans.
A database for managing songs on Spotify playlists.
Create a table for playlists with columns for name, description, and user ID
Create a table for songs with columns for title, artist, album, and duration
Create a table for playlist-songs with columns for playlist ID and song ID
Use foreign keys to link tables together
Allow for CRUD operations on playlists and songs
- Q3. 3. Middle element of linked list in a single traversal
- Ans.
To find the middle element of a linked list in a single traversal.
Use two pointers, one moving at twice the speed of the other.
When the faster pointer reaches the end, the slower pointer will be at the middle.
If the linked list has even number of elements, the middle will be the second of the two middle elements.
- Q4. 4. Design a list to show songs in the year in which they were published.
- Ans.
Create an array of song titles sorted by year of publication.
Create an array of song objects with properties for title and year of publication.
Sort the array by year of publication.
Extract the titles of the songs into a separate array.
Return the array of song titles.
- Q5. 5. Another question related to library management class where you have to make diagrams too.
Answered by
AI
Add your answer
Answered by
AI
Add your answer
Answered by
AI
Add your answer
Answered by
AI
Add your answer
Add your answer
Round 4 - HR
(1 Question)
- Q1. This Round is comparatively simple and easier than previous rounds. They ask you to introduce yourself followed by questions regarding your background goals, strengths, etc. And discussing some social prob...
Add your answer
Interview Preparation Tips
Topics to prepare for ThoughtWorks Application Developer interview:
- React and NodeJ
- DSA and Projects
Skills evaluated in this interview
I applied via campus placement at Vishwakarma Institute of Technology, Pune and was interviewed in May 2022. There were 2 interview rounds.
Round 1 - Resume Shortlist
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical
(3 Questions)
- Q1. OOP based questions - Inheritance, Polymorphism etc
- Q2. Project based in depth question - which technology, why
- Q3. Data structures concept, programming concepts (i was asked loop vs recurssion)
Add your answer
Add your answer
Add your answer
Interview Preparation Tips
Interview preparation tips for other job seekers - Be thorough with your resume. Know each and everything you mentioned. Prepare with basics.
I applied via LinkedIn and was interviewed in Dec 2021. There were 4 interview rounds.
Round 1 - HR
(4 Questions)
- Q1. What are your salary expectations?
- Q2. Why are you looking for a change?
- Q3. Tell me about yourself.
- Q4. Why did you choose Thoughtworks?
Add your answer
Add your answer
Add your answer
Add your answer
Round 2 - One-on-one
(3 Questions)
- Q1. Code Pairing Round on a github repo
- Q2. Add a new feature using SOLID principles and explain your thought process
- Ans.
Adding a new feature using SOLID principles
Identify the new feature and its requirements
Analyze the existing codebase and identify areas that need modification
Apply SOLID principles to design the new feature
Implement the feature using clean code practices
Test the feature thoroughly to ensure it meets the requirements
- Q3. Explain the HTTP status code for your tests
- Ans.
HTTP status codes indicate the status of a web request.
1xx - Informational
2xx - Success
3xx - Redirection
4xx - Client Error
5xx - Server Error
Examples: 200 OK, 404 Not Found, 500 Internal Server Error
Add your answer
Answered by
AI
Add your answer
Answered by
AI
Add your answer
Round 3 - Technical
(2 Questions)
- Q1. Explain your previous project
- Q2. What could you have done differently
Add your answer
Add your answer
Round 4 - HR
(4 Questions)
- Q1. Why are you looking for a change?
- Q2. What are your strengths and weaknesses?
- Q3. Tell me about yourself.
- Q4. Social change questions
Add your answer
Add your answer
Add your answer
Add your answer
Interview Preparation Tips
Topics to prepare for ThoughtWorks Application Developer interview:
- Java
- solid
- TDD
- Spring Boot
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in May 2022. There were 3 interview rounds.
Round 1 - Code Pairing Round
(1 Question)
- Q1. A question on Pizza bill calculation. Use oops concept and try to print the correct output. Practice more questions like bill calculation using oops.
Add your answer
Round 2 - Technical
(1 Question)
- Q1. What is better java or c?
- Ans.
Both Java and C have their own strengths and weaknesses, and the choice depends on the specific requirements of the project.
Java is better for developing enterprise-level applications due to its platform independence and robustness.
C is better for developing system-level software and applications that require high performance and low-level access to hardware.
Java has a larger community and more libraries and frameworks...
Answered by
AI
Add your answer
Round 3 - HR
(1 Question)
- Q1. What challenges have you faced
Add your answer
Interview Preparation Tips
Interview preparation tips for other job seekers - Be yourself. Prepare all main subjects from your engineering syllabus well.
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 Applications Engineer Interview Questions
- Directi Intern Interview Questions
- Directi IT Support Executive Interview Questions
- Directi Platform Engineer Interview Questions
- Directi Product Manager 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
Application Developer Interview Questions from Similar Companies
Fast track your campus placements
|
Software Development Engineer II
13
salaries
|  ₹21.5 L/yr - ₹55 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 |
|
Software Developer
9
salaries
| ₹8.4 L/yr - ₹30 L/yr |
Compare Directi with
Zoho
Compare
TCS
Compare
Infosys
Compare
Wipro
Compare
Popular Calculators
Did you find this page helpful?
Yes No
- Home >
- Interviews >
- Directi Interview Questions >
- Directi Application Developer Interview Questions
Share an Interview