Upload Button Icon Add office photos

Directi

Compare button icon Compare button icon Compare

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=n­1in 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 B­WAY 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: 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 non­empty 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 NP­Complete 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

Application Developer Interview Questions Asked at Other Companies

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: 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

Interview questions from similar companies

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

Interview preparation tips for other job seekers - Average interview. There will he two rounds technical. One will be telephonic and second will be skyp video.
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Around 75 mcq questions with snippets of code

Round 2 - Technical 

(3 Questions)

  • Q1. Interview conducted by technical lead. Around 10-15 questions asked. Questions related to your skills only.
  • Q2. Basics of core java
  • Q3. SQL queries, scenario based questions
Round 3 - Behavioral 

(1 Question)

  • Q1. Daily routine. Casual question/non technical questions. Tricky question. Puzzles. Sone technical questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Easy level not much hard, don’t worry and go for CitiusTech.
Work culture is very awesome.
All the facilities are there as
1. Technical Trainings
2. Games and funny events
3. Canteen
4. Auditorium
5. Sick room
6. People are helping.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. What is oops concepts
  • Ans. 

    Object-oriented programming concepts that help in organizing and structuring code.

    • Encapsulation: Bundling data and methods together in a class.

    • Inheritance: Creating new classes from existing ones, inheriting their properties and behaviors.

    • Polymorphism: Objects of different classes can be treated as objects of a common superclass.

    • Abstraction: Hiding complex implementation details and providing simplified interfaces.

    • Enca...

  • Answered by AI
  • Q2. Abstraction polymorphism inheritance encapsulation

I applied via Campus Placement and was interviewed in May 2022. There were 3 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 - Aptitude Test 

It was a 1 Hour aptitude test along a few MCQ based questions on DSA.

Round 3 - One-on-one 

(6 Questions)

  • Q1. The interview was held online. The interview first asked me to explain any one of my projects.
  • Q2. Asked a a few basic question of DSA like difference between quick and merge sort. Time complexities of a few algorithms. Real life application of Trees.
  • Q3. A few basic questions related to OOPs
  • Q4. Find missing numbers in a list in Python. (He asked me a few concepts related to Python since most of my projects were made in that)
  • Q5. If A,B both classes have a function with same name (lets say the name of function id FUN) and C is a child of both. So, if FUN is called for C what will happen in Python and in C++.
  • Ans. Will give an error in C++, But will call FUN from whichever parent was declared first in Python
  • Answered Anonymously
  • Q6. He also asked me to implement quick sort

Interview Preparation Tips

Topics to prepare for Incedo Software Developer interview:
  • OOPS
Interview preparation tips for other job seekers - Make sure that you have a proper understanding of all the technologies you have used in your projects.
Learn the concepts of OOPs.

I applied via Approached by Company 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 

(1 Question)

  • Q1. Polymorphism ..Pure virtual function ..oops concept ..Design pattern ..Smart printer STL

Interview Preparation Tips

Interview preparation tips for other job seekers - Always be patience and keep giving the interviews and never give up ..Clear your basics ..Will not advice you to read this or that .. Whatever is your domain and language have solid understanding on that
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. All about java 8 and collections

Interview Preparation Tips

Interview preparation tips for other job seekers - Just clear your basics
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(3 Questions)

  • Q1. Questions on spring boot and question around spring annotations and its benifits
  • Q2. Questions on Java 8 - 21 versions such as virtual threads and stream API
  • Q3. Question on Databases fundamentals.

Interview Preparation Tips

Interview preparation tips for other job seekers - The process was simple and crisp

Tell us how to improve this page.

Software Development Engineer II
13 salaries
unlock blur

₹21.5 L/yr - ₹55 L/yr

Software Developer
11 salaries
unlock blur

₹19.9 L/yr - ₹36 L/yr

Senior Software Engineer
11 salaries
unlock blur

₹25 L/yr - ₹57 L/yr

Product Manager
11 salaries
unlock blur

₹21 L/yr - ₹35 L/yr

Software Engineer
9 salaries
unlock blur

₹9.1 L/yr - ₹36.4 L/yr

Explore more salaries
Compare Directi with

ITC Infotech

3.6
Compare

CMS IT Services

3.1
Compare

KocharTech

3.9
Compare

Xoriant

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview