Software Engineer

There are 25 horses among which you need to find out the fastest 3 horses. You can conduct a race among at most 5 to determine their relative speed. At no point, can you find out the actual speed of the horse in a race. Find out the minimum number of races required to get the top 3 horses.

A snail wishes to reach a water shore. To do this it must cross a wall which is 30 feet high. It has a time limit of 30 hours to reach atop the wall. The time starts as soon as it starts climbing the wall. However, he faces a problem while climbing. Every hour it climbs the wall 3 feet up, it slides down 2 feet. This occurs every hour. So how many hours will it take for the snail to reach atop the wall?

Given an array/list of integers of length ‘N’, there is a sliding window of size ‘K’ which moves from the beginning of the array, to the very end. You can only see the ‘K’ numbers in a particular window at a time. For each of the 'N'-'K'+1 different windows thus formed, you are supposed to return the maximum element in each of them, from the given array/list.

You have been given an array/list of strings 'inputStr'. You are supposed to return the strings as groups of anagrams such that strings belonging to a particular group are anagrams of one another.

An anagram is a word or phrase formed by rearranging the letters of a different word or phrase. We can generalize this in string processing by saying that an anagram of a string is another string with the same quantity of each character in it, in any order.

Note:

The order in which the groups and members of the groups are printed does not matter.

For example:

inputStr = {"eat","tea","tan","ate","nat","bat"}
Here {“tea”, “ate”,” eat”} and {“nat”, “tan”} are grouped as anagrams. Since there is no such string in “inputStr” which can be an anagram of “bat”, thus, “bat” will be the only member in its group.

Explain demand paging?

Briefly explain the different layers in the OSI model

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:

For the given binary tree

The level order traversal will be {1,2,3,4,5,6,7}.

What is the difference between a mutex and a semaphore? When should you use a mutex and when should you use a semaphore?

Why should we hire you?