Tip 1 : Read interview experience of others.
Tip 2 : Clear basic concepts
Tip 3 : If you are not going for big companies, try to solve medium level problems
Tip 4 : Project based work experience, so try make few good projects
Tip 1 : Focus more on the work experience and skills part, rest is not needed much, work experience, personal projects and skills should be top priority
Tip 2 : Go for a simple but attractive template
2 coding questions and objectives questions were there.



1. The integers x,y and z might not be distinct , but they should be present at different locations in the array i.e if a[i] = x, a[j] = y and a[k] = z, then i,j and k should be pairwise distinct.
2. The integers a,b and c can be present in any order in the given array.
2 coding questions were asked in this



Given maze: {[0, 0, 1], [1, 0, 0], [1, 0, 0]}
Starting point: [2, 2]
Destination: [0, 0]
For the above example maze will look like this:

So, we can see there are 2 ways for Ninja to reach destination(D), from the starting point(SP). They are: [left -> up -> left] and [up -> left -> up -> left].
So, you need to print true.



Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
Step 1 : First I checked with by generating all the subarrays and checking whether my given sum is equal to any of the subarray.
Step 2 : Time complexity for this approach was O(n^2). Interviewer asked me to optimize the solution
Step 3 : I have given him the two pointer approach to find the subarray
I have applied for the position of java developer, so in this round all the basic concepts related to java were asked.
What is immutable class, how to achieve that.
Tip 1 : Always prepare the core and basic concepts
Some questions related to my previous work experience and springboot as I have mentioned that in my skills
Questions related to dependency injection, which you should use while writing test class @Autowired or create a new instance using new keyword.
Tip 1 : Be prepared whatever you have written in your resume
Tip 2 : Even if you don't have much experience, give at least a try with proper explanation. It may be correct or wrong, but try.
camel and banana puzzle
A person has 3000 bananas and a camel. The person wants to transport the maximum number of bananas to a destination which is 1000 KMs away, using only the camel as a mode of transportation. The camel cannot carry more than 1000 bananas at a time and eats a banana every km it travels. What is the maximum number of bananas that can be transferred to the destination using only camel (no other mode of transportation is allowed)
General questions about myself, strength and weakness, why you want to switch the company and the tech stack etc.
Why you want to switch the company and tech stack.
Tip 1 : Be confident and give explanation for the reason.

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