Tip 1 : Practice Java hands on rather than just reading the concepts.
Tip 2 : Need not to jump on advance sql, practice basic sql but be strong in that
Tip 3 : Practice arrays, String and linked list questions. No need for advance data structures.
Tip 1: Mention the skills after having a look at company requirements.
Tip 2: Don't make your resume too big. Make it crisp and avoid non-tech things.
The round was based on MCQs and questions were related to basic computer fundamentals and some code snippet questions. It was for 2 hours.



It was coding round on paper. It has two questions to solve.



The simple idea of Kadane’s algorithm is to look for all positive contiguous segments of the array (max_ending_here is used for this). And keep track of maximum sum contiguous segment among all positive segments (max_so_far is used for this). Each time we get a positive sum compare it with max_so_far and update max_so_far if it is greater than max_so_far.



a) Duplicate elements may be present.
b) If no such element is present return -1.
Input: Given a sequence of five numbers 2, 4, 5, 6, 8.
Output: 6
Explanation:
In the given sequence of numbers, number 8 is the largest element, followed by number 6 which is the second-largest element. Hence we return number 6 which is the second-largest element in the sequence.
Take two temp variables and store the second largest in that. Keep traversing the array and keep updating the variable if the element is larger.
This is basic discussion about salary and about myself
Tell me about yourself
What are your strengths and weaknesses?
Why should we hire you?
What do you know about our work culture?
How do you think one can overcome his fear of failure?
Tip 1 : Start introducing yourself
Tip 2 : Be prepared for this one day before
Tip 3 : Try to be positive

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