Coding Round, Technical Round, and HR.

The developers at Chennai simply copy/paste questions from GeeksforGeeks instead of preparing their own. Poor coordination.

They will make you sit idle for 3-4 hours without any reason. Please improve the interview process and value the time.

Given an array A of positive integers, sort the array in ascending order such that the element at index K in the unsorted array stays unmoved and all other elements are sorted.

Input: arr[] = {10, 4, 11, 7, 6, 20} k = 2; Output: arr[] = {4, 6, 11, 7, 10, 20}

Input: arr[] = {30, 20, 10} k = 0 Output: arr[] = {30, 10, 20}

How to design a parking lot using object-oriented principles?

For our purposes right now, we’ll make the following assumptions. We made these specific assumptions to add a bit of complexity to the problem without adding too much. If you made different assumptions, that’s totally fine.

1. The parking lot has multiple levels. Each level has multiple rows of spots.
2. The parking lot can park motorcycles, cars, and buses.
3. The parking lot has motorcycle spots, compact spots, and large spots.
4. A motorcycle can park in any spot.
5. A car can park in either a single compact spot or a single large spot.
6. A bus can park in five large spots that are consecutive and within the same row. It cannot park in small spots.