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.
Technical round based on Java and DSA problem.



Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Divide the array into 2 halves.
Get the answer of left and right parts of the array by recursion.
Get the answer of Maximum subarray sum such that the subarray crosses the midpoint.
To find the maximum subarray sum of crossing points we need to find the maximum sum starting from mid point and ending at some point on the left of mid, then find the maximum sum starting from mid + 1 and ending with some point on right of mid + 1. Total sum would be the sum of both left part and right part.
Maximum of all three sums would be the final answer.
What is custom class loader used for? What is the use case?
What is AOP? Where it is used apart from spring?
Technical round with questions based on java and spring
How call back is working in java?
In Spring, what will happen if we bind with same id? how to find which is loaded?
HR round with behavioural questions mainly.
1. Tell me about yourself
2. Why Accion Labs?
3. Who is your role model?

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