Tip 1 : Keep practicing DS and Algos cover all essential topics.
Tip 2 : Have basic knowledge of Core subjects.
Tip 3 : Do at least 2 projects.
Tip 1 : Display your skills and your achievements.
Tip 2 : Have some projects on your resume.
First basic introduction (10 minutes)
2 questions were asked. (45 Minutes)
Conclusion (5 min)



An array c is a subarray of array d if c can be obtained from d by deletion of several elements from the beginning and several elements from the end.
For e.g.- The non-empty subarrays of an array [1,2,3] will be- [1],[2],[3],[1,2],[2,3],[1,2,3].
If arr = {-3,4,5}.
All the possible non-empty contiguous subarrays of “arr” are {-3}, {4}, {5}, {-3,4}, {4,5} and {-3,4,5}.
The product of these subarrays are -3, 4, 5, -12, 20 and -60 respectively.
The maximum product is 20. Hence, the answer is 20.
Can you solve this in linear time and constant space complexity?
Came up with a recursive solution that wasn't fast enough just added memorization logic to optimize my existing code. That was the solution actually.
Timing: Evening
In this round interviewer mostly covers all the core subjects plus my projects(detailed discussion).
It took around 30 minutes.
Then he asked me to design typeahead(60 minutes).
LSTM vs RNN?
What is the vanishing gradient problem and how does LSTM solve this issue better than RNN?
Design Typeahead Suggestion?
Tip 1 : If you've done some project you should be confident about that, you should be able to answer every question related to that project.
Tip 2 : For design problems always ask beforehand about all the requirements and what to implement.

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?