Coding Questions Asked in Mettl

There are many cars parked in the parking lot. The parking is a straight very long line and a parking slot for every single meter. There are cars parked currently and you want to cover them from the rain by building a roof. The requirement is that at least k cars are covered by the roof. What's the minimum length of the roof that would cover k cars?

The function has the following parameters:
cars: integer array of length denoting the parking slots where cars are parked
k: integer denoting the number of cars that have to be covered by the roof

Example:
Input:
cars: [2, 10, 8, 17]
k: 3
output: 9
Explanation: you can build a roof of length 9 covering all parking slots from the 2nd one to the 10th one, so covering 3 cars at slots 2, 10, 8, there are no shorter roof that can cover 3 cars, so the answer is 9

Note:
1 <= n <= 10^5
1 <= k <= n
1 <= cars[i] <= 10^14
All slots token by cars are unique

Input : cars: [2, 10, 8, 17]
k: 3

Output :

View Answer |  Sorting |  Practice Program | To Reading List | Asked In AmazonHackerRank |  Experience, Fresher

Return the character which occurs for the maximum numbers of times in the Input String.
If multiple characters occur with the same highest frequency then return "0".

Input : Input1: abcdd

Output :

View Answer |  Strings |  Practice Program | To Reading List | Asked In TCS NQTNagarroWipro NLTHHackerRank |  Experience, Fresher

A prime number is a whole number greater than 1 that is divisible only by itself and the number 1.

Given 'n' (1 <= n <= 100000), find the nth prime number.

Input : An integer n

Output :

View Answer |  Basics |  Practice Program | To Reading List | Asked In TCS NQTNagarroWipro NLTHHackerRank |  Experience, Fresher

A Derangement is a permutation of n elements, such that no element appears in its original position. For example, a derangement of {0, 1, 2, 3} is {2, 3, 1, 0}.

Given a number n, find the total number of Derangements of a set of n elements.

Input : 1st Input: n = 2

For two elements say {0, 1}, there is only one
possible derangement {1, 0}

2nd Input: n = 3

For three elements say {0, 1, 2}, there are two
possible derangements {2, 0, 1} and {1, 2, 0}

Output :

View Answer |  Basics |  Practice Program | To Reading List | Asked In TCS NQTNagarroWipro NLTHHackerRank |  Experience, Fresher

Every character in the input string is followed by its frequency.
Write a function to decrypt the string and find the nth character of the decrypted string. If no character exists at that positionthen then return "-1".
For eg:- If the input string is "a2b3" the decrypted string is "aabbb".
Note: The frequency of encrypted string cannot be greater than a single digit i.e.<10.

Explanation:

The decrypted string is "abccc", hence the 5th character in the decrypted string is "c".

Input : Input Specification:
Input1: A string.
Input2:5

Output :

View Answer |  Basics |  Practice Program | To Reading List | Asked In NagarroWipro NLTHTCS NinjaHackerRank |  Experience, Fresher

Given a number of objects N(non-repetitive object) Find the number of arrangements in which no objects occur at original positions.

Input : Input1: N, the number of Objects.
Input1: 3

Output :

View Answer |  Basics |  Practice Program | To Reading List | Asked In NagarroWipro NLTHWipro NLTHHackerRank |  Experience, Fresher