No products in the cart!
Please make your choice.View all catalog
First Round: It was on Hackerrank. We were given 4 coding questions which were random for all.
Some of the questions that I got are as follows:
Compliance Priorities: A system contains a queue of all current issues along with their priorities. The priorities range from 1 to 99. Create an algorithm that will reassign priorities so that the value of the maximum priority assigned is minimized, keeping the relative priorities between all issues the same.
priorities = [1, 4, 8, 4] There are three priority levels: 1, 4, and 8. The array of elements are reassigned to priorities [1, 2, 3, 2]. Their relative priorities are maintained while the value of the maximum priority is minimized.
Given the priorities of the issues, return a list that contains the reassigned priority values without reordering.
Device Name System: Create unique device names. If a device name already exists in the system, an integer number is added at the end of the name to make it unique. The integer added starts with 1 and is incremented by 1 for each new request of an existing device name. Given a list of device name requests, process all requests and return an array of the corresponding unique device names.
devicenames = ['switch', 'tv', 'switch', watch', 'switch','tv']
return uniqueDevicenames = ['switch', 'tv', 'switch1', 'watch', 'switch2', 'tv1']
Perfect Pairs: A pair of integers (x, y) is perfect if both of the following conditions are met:
min(|x-y|,|x+y|) <=min(|x|,|y|) max(|x-y|,|x+y|) >=max(|x|,|y|)
Given an array arrof length n, find the number of perfect pairs arr[i], arr[j] where 0 i < j < n.
Grid Traversal: In this question, the coder had to find a minimum number of jumps from the start point to the endpoint.
I was able to solve 2 problems fully and 1 problem partially.
Second Round: This was a technical interview round conducted offline in our campus. The interviewer asked the following questions:
Duration: 1 hour
After that, the interviewer asked 2 coding questions:
At first, I explained the brute force approach and then the interviewer asked me to further optimize the approach
Tips: Interview will be scheduled the next day after the coding test. So prepare for the interview beforehand. In our case we gave test at 2 pm the results were declared around 11 pm, and at 2 am we were asked to be ready at 8:30 am sharp the very next day.
I didn’t get selected for further rounds. But it was a nice experience since it was my first offline – in person interview.