Tip 1 : Have command on any one language and also maintain decent GPA
Tip 2 : Build a strong portfolio by practicing quality code and having good projects
Tip 1 : Mention at least 2 Projects on your resume.
Tip 2 : Never fake your resume.
- Morning time
- Environment was good.
- No
- Interviewer was good



M*M = M
s1 - Apply Idempotent matrix approach
s2 - Size N of the matrix, N + 1 : NXN elements of the matrix



You can’t sell without buying first.
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.
- Morning time
- Environment was good.
- No
- Interviewer was good



If the ARR is [4,6,9,11,1,2,2] and ‘VAL’ is 4, the answer will be ‘YES’ as 4 exist in ‘ARR’.
- Morning time
- Environment was good.
- No
- Interviewer was good
NOTE : It was a round with the senior engineering director of the team, where he tested my knowledge of OOPS, OS, Data structures and Algorithm


You only need to return the starting node for minimum and maximum slope. So if slope(P1, P2) is maximum, just return P1.
In case of more than one possible solution return the first occurring solution.
s1 - minimum and the maximum slope of simultaneous points of coordinates., Apply the Maximum(Slope(P1, P2), Slope(P2, P3)) and Minimum(Slope(P1, P2), Slope(P2, P3)).
s2 - Apply minimum algorithm
What are semaphores?
What is virtual memory?
Tip 1 : Read Galvin for OS thoroughly.
Tip 2 : Do practice for SQL queries.

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