Tip 1 : Consistency-Solving problems daily
Tip 2 : Quality over quantity
Tip 3 : build confidence by solving problems till you confident about any topic (don't go over number of questions)
Tip 1 : Be Precise
Tip 2 : mention only important tech related things like projects and experiences
First Round-It was 90 minutes round and basically contains aptitude question which you need to solve quickly.
Normal aptitude and English and reasoning questions.
My interview started and the interviewer asked me to introduce myself. Also he asked me some questions related to my hobbies like the last movie I saw in theatre (these questions are asked to make you comfortable and familiarise you with the interview) .
After this he asked me about my projects.
In which technology did I work. What is my project all about , what are its features and how is it useful in the real world.
After this, since I made my project in native Android using Java he asked me some conceptual questions in Java.He asked me about Collection framework.
After this he asked me about OOPs.What is OOPs, then he asked me about polymorphism and told me to explain it.
Finally, he gave me a question and asked me to code it.
Q. Find the second largest element in the given array (don't use sorting ).
Eg. arr={6,7,8,9,0}
Then, output=8
Interview took around 35-40 min .
At last he asked me if I had any questions for him to which I replied in what technologies do I get to work on if I get selected.



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.
first calculate the largest no. then again run the loop for entire array and find the no. just less then that largest no. but greater than other nos.

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