Tip 1: Make sure you have your computer science fundamentals very clear.
Tip 2: You should know the complexity of the code you write and should know the internal implementation of the data structure you use while coding.
Tip 3: You should know about everything you write in your resume.
Tip 4: Practice a lot of programming problems. Participate in competitive programming contests.
Tip 1: Be honest about what you write in your resume.
Tip 2: Should have at least 2 projects
Tip 3: Maintain a precise and self-speaking one-page resume.
Tip 4: Add technical achievements only.
This round was an preliminary test and there were 3 coding questions that were need to be completed in the stipulated time.



You are given ‘MAT’= [[1, 2],[3, 4]] and ‘K’ = 8.

Then the answer will be 7 (the sum of the red rectangle).



In the given linked list, there is a cycle, hence we return true.

Have a visited flag with each node.
Traverse the linked list and keep marking visited nodes.
If you see a visited node again then there is a loop.


The interview started with my Introduction and directly moved on to the technical skills. Started with deep questions on Projects in my Resume. Asked about Past experience, some computer fundamentals then coding questions. like Access Specifiers and He also asked me what data structure is to be used if I have to store the addresses..


1. In each row, integers are sorted from left to right.
2. Each row's first integer is greater than the previous row's last integer.
Input:
'MATRIX' = [ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 60] ], 'TARGET' = 3
Output:1
Explanation: Since the given number ‘TARGET’ is present in the matrix, we return true.
We start search the matrix from top right corner, initialize the current position to top right corner, if the target is greater than the value in current position, then the target can not be in entire row of current position because the row is sorted, if the target is less than the value in current position, then the target can not in the entire column because the column is sorted too. We can rule out one row or one column each time, so the time complexity is O(m+n).
Explain Scheduling algorithms?
Whart is kernel?
What is Process Management and Device Management?
What are semaphores?
Tip 1: Learn basic OS questions
Tip 2: Go through all the previously asked Questions
Some questions about Past experience were asked and talks on compensation and basic HR questions.
How do you handle conflicts?
You have a call with a client and he is talking about something you have no idea about and he wants deadlines on the work, how do you respond?
Then he asked if I have worked with the team, what difficulties I faced and what I learned. He asked me about a project idea, and how will I implement it.
He was just checking whether I am the correct fit and will I be able to cope up with the team. He asked about my weakness. The most interesting question he asked was whether in past my friends have said that I am wrong and how I handled it. And if there is conflict in ideas in the project in a team, how I will manage it if I am team lead?
Tip 1: Practice previously asked questions.
Tip 2: Share the process with the interviewer.
Tip 3: clear the requirements from interviewer if required

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?