Fullstack Developer

You're given an array ARR[] of size N, where every element belongs to the range 0 to N-1. Your task is to rearrange the given array so that ARR[i] becomes ARR[ARR[i]] and make sure that this task is done with O(1) extra space.

During Endgame Natasha(Black Widow) sacrificed her life for the soul stone.

Hulk wants to bring Natasha back. So, he came to Goku for help. Goku told him he will help Hulk if he can solve the task given by him. Hulk accepts the challenge of Goku.

Goku gave Hulk a list of ‘N’ numbers and a number ‘K’. The task is to rearrange the elements of the list such that all elements less than or equal to ‘K’ become adjacent to each other. Hulk can only swap any two elements of the array/list multiple times. Goku wants Hulk to do the task using the minimum number of swaps.

As Hulk is not good at maths so he called you to solve the task given by Goku to save Natasha.The fate of Natasha lies in your hand.

A lot of questions were related to my projects. Like I was asked about the functioning, my contribution to the project, its uniqueness, and all.

(Just be confident in your learning and don't change your answers even after the interviewer's suggestions. The 
final year project plays a vital role in your selection. )

 

Tell me about yourself.

Which fields are you interested in and why? 

What are your hobbies?

Salary Expectation

Are you willing to relocate?