SDE - 1

Once Kevin is playing a hurdle game in which he has to jump some hurdles to clear a particular level. Each level ‘i’ has ‘i’ hurdles (for example, level 6 has 6 hurdles).

You are provided with the total number of hurdles that Kevin has jumped, you have to tell how many levels he has cleared.

Note :

Kevin has played this game once. He can only reach the level ‘i’ if and only if he has already cleared the level (‘i’ - 1).

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:

The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.

Follow Up :

Can you solve this problem in O(N) time and O(1) space complexity?

You are given an array ‘A’ of size ‘N’ containing only 0s and 1s. You have to sort the array by traversing the array only once.

For Example:

For the following array:
[0 1 1 1 0 0 1]

The output should be [0 0 0 1 1 1 1].

Note:

You have to sort the array in place.

What are OOPS pillars?
What is the difference in encapsulation and abstraction?
How do you apply abstraction with an example and code?
Some more problems from abstraction in deep.

In this round, he asked me very basic HR interview questions as why do you want to join this company? where do you see yourself in 5 years? what are your expectations from company?