Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio,etc.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1: Have at least two good projects mentioned in your resume with a link.
Tip 2: Focus on skills, internships, projects, and experiences.
Tip 3: Make it simple, crisp, and one page.
This was technical round in which they gave me two coding questions which need to be solved in one hour.



Input: 'arr' = [1, 2, 1, 2, 1]
Output: 3
Explanation: The longest bitonic subsequence for this array will be [1, 2, 1]. Please note that [1, 2, 2, 1] is not a valid bitonic subsequence, because the consecutive 2's are neither strictly increasing, nor strictly decreasing.
n^2 Solutions were acceptable here, so I checked all elements as the peak point, found the length of such sequences for all elements in the array, and took the maximum of them as the answer.



I have done this question many times. So, I had remembered this.
I explained all the questions. I implemented a linked list and explained how we use each of them in the real world.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?