Tip 1 : Data Structure should be clear till hashmaps, graphs & DP are not asked frequently
Tip 2 : Aptitude is important
Tip 3 : Must have 1 Projects
Tip 1 : 1 Project is necessary
Tip 2 : and should be 1 Pager
Firstly, they told me to introduce myself and then asked some DBMS questions and follows by Java questions, & OOPs, and 1 basic data structure question. then some casual talks about my life.
What is the difference between OOP and SOP?
What is Object Oriented Programming?
What are the main features of OOPs?
What are the different types of inheritance?
What are the limitations of inheritance?
What is a superclass?
What are ‘access specifiers’?
Tip 1: give the proper answer with an example of real life
Tip 2: don't try to mislead by the answer.



Here, sorted paths mean that the expected output should be in alphabetical order.
Given a square matrix of size 4*4 (i.e. here 'N' = 4):
1 0 0 0
1 1 0 0
1 1 0 0
0 1 1 1
Expected Output:
DDRDRR DRDDRR
i.e. Path-1: DDRDRR and Path-2: DRDDRR
The rat can reach the destination at (3, 3) from (0, 0) by two paths, i.e. DRDDRR and DDRDRR when printed in sorted order, we get DDRDRR DRDDRR.
step 1: Create a solution matrix, initially filled with 0’s.
step 2: Create a recursive function, which takes initial matrix, output matrix and position of rat (i, j).
step 3: if the position is out of the matrix or the position is not valid then return.
step 4: Mark the position output[i][j] as 1 and check if the current position is destination or not. If destination is reached print the output matrix and return.
step 5: Recursively call for position (i+1, j) and (i, j+1).
step 6: Unmark position (i, j), i.e output[i][j] = 0.
- Morning time
- Environment was good.
- No
- Interviewer was good



1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
step 1: Traverse the array from start to end. (loop counter i)
step 2: Create a HashMap or set to store unique pairs.
step 3: Run another loop from i+1 to end of the array. (loop counter j)
step 4: If there is an element in the set which is equal to x- arr[i] – arr[j], then print the triplet (arr[i], arr[j], x-arr[i]-arr[j]) and break
step 5: Insert the jth element in the set.



Two strings are said to be anagram if they contain the same characters, irrespective of the order of the characters.
If 'STR1' = “listen” and 'STR2' = “silent” then the output will be 1.
Both the strings contain the same set of characters.
Step 1: Create count arrays of size 256 for both strings. Initialize all values in count arrays as 0.
Step 2: Iterate through every character of both strings and increment the count of characters in the corresponding count arrays.
Step 3: Compare count arrays. If both count arrays are the same, then return true else return false.
- Morning time
- Environment was good.
- No
- Interviewer was good
Why are you interested in this job? ...
Where do you see yourself in the next 5 years? ...
Would you like to work overtime or odd hours?
What motivated you to do your job well?
why do you want to join incedo inc even though you have 3 offers ?
Tip 1: show eagerness to join there company
Tip 2: Be confident

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?