Tip 1 : Do as much as coding question you can do.
Tip 2 : Do some projects also.
Tip 3 : Revise and clear your basic concepts too.
Tip 1 : Mention only things related to job profile only.
Tip 2 : Make it page pager.
There were 15 MCQS you have to do in 25 Minutes and 3 Coding questions you have to do in 40 minutes. They also give a demo test link to get you use to the environment.



'ARR' = [3, 4, -1, 1, 5] and 'K' = 3
Output = [4, 4, 5]
Since the maximum element of the first subarray of length three ([3, 4, -1]) is 4, the maximum element of the second subarray of length three ([4, -1, 1]) is also 4 and the maximum element of the last subarray of length three ([-1, 1, 5]) is 5, so you need to return [4, 4, 5].
It was a standard problem so I know the exact solution, you can simply use dequeue + two pointers to solve this questions.



Consider 0-based indexing.
Consider the array 1, 2, 3, 4, 5, 6
We can Jump from index 0 to index 1
Then we jump from index 1 to index 2
Then finally make a jump of 3 to reach index N-1
There is also another path where
We can Jump from index 0 to index 1
Then we jump from index 1 to index 3
Then finally make a jump of 2 to reach index N-1
So multiple paths may exist but we need to return the minimum number of jumps in a path to end which here is 3.
I did it by using DP, again it was a standard problem.



str = "ababc"
The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome.
There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.
I solve it by using dp in O(n^2) time complexity.
It was more of Design + Data structure round. They give access to their server and ask us to do code there.
They give a predefined file system project in which we have to write functionalities like to create/move/delete/copy a file. I have to use predefined classes to write my functionalities and build the file structure. They also ask to maintain multiple versions and restoring them for the same file.
I made tree type data structure to build the file system but only able to write create and delete functionalities in the given time.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL clause is used to specify the conditions in a query?