Hackerrank
Goodland is a country with a number of evenly spaced cities along a line. The distance between adjacent cities is unit. There is an energy infrastructure project planning meeting, and the government needs to know the fewest number of power plants needed to provide electricity to the entire list of
Hackerrank
You will be given a list of integers, , and a single integer . You must create an array of length from elements of such that its unfairness is minimized. Call that array . Unfairness of an array is calculated as Where: - max denotes the largest integer in - min denotes the
Hackerrank
The member states of the UN are planning to send people to the moon. They want them to be from different countries. You will be given a list of pairs of astronaut ID's. Each pair is made of astronauts from the same country. Determine how many pairs of
Hackerrank
You are given a 2D matrix of dimension and a positive integer . You have to rotate the matrix times and print the resultant matrix. Rotation should be in anti-clockwise direction. Rotation of a matrix is represented by the following figure. Note that in one rotation, you have to shift elements
Hackerrank
A gene is represented as a string of length (where is divisible by ), composed of the letters , , , and . It is considered to be steady if each of the four letters occurs exactly times. For example, and are both steady genes. Bear Limak is a famous biotechnology scientist who specializes in
Hackerrank
Given an array of integers, determine whether the array can be sorted in ascending order using only one of the following operations one time. 1. Swap two elements. 2. Reverse one sub-segment. Determine whether one, both or neither of the operations will complete the task. If both work, choose swap.
Hackerrank
Given a 2D array of digits or grid, try to find the occurrence of a given 2D pattern of digits. For example, consider the following grid: 1234567890 0987654321 1111111111 1111111111 2222222222 Assume we need to look for the following 2D pattern array: 876543 111111 111111 The 2D pattern begins at
Hackerrank
Alice is playing an arcade game and wants to climb to the top of the leaderboard and wants to track her ranking. The game uses Dense Ranking, so its leaderboard works like this: * The player with the highest score is ranked number on the leaderboard. * Players who have equal scores
Hackerrank
Sherlock considers a string to be valid if all characters of the string appear the same number of times. It is also valid if he can remove just character at index in the string, and the remaining characters will occur the same number of times. Given a string , determine if
Hackerrank
You will be given an array of integers and a target value. Determine the number of pairs of array elements that have a difference equal to a target value. For example, given an array of [1, 2, 3, 4] and a target value of 1, we have three values meeting
Hackerrank
Lauren has a chart of distinct projected prices for a house over the next several years. She must buy the house in one year and sell it in another, and she must do so at a loss. She wants to minimize her financial loss. For example, the house is valued
Hackerrank
Given the time in numerals we may convert it into words, as shown below: At , use o' clock. For , use past, and for use to. Note the space between the apostrophe and clock in o' clock. Write a program which prints the time in words for the input