Hackerrank
Given a sequence of integers, where each element is distinct and satisfies . For each where , find any integer such that and print the value of on a new line. For example, assume the sequence . Each value of between and , the length of the sequence, is analyzed as follows: 1. , so
Hackerrank
John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts all remaining elements right one. To test Sherlock's abilities, Watson provides Sherlock with an array of integers. Sherlock
Hackerrank
You have a string of lowercase English alphabetic letters. You can perform two types of operations on the string: 1. Append a lowercase English alphabetic letter to the end of the string. 2. Delete the last character in the string. Performing this operation on an empty string results in an
Hackerrank
A jail has a number of prisoners and a number of treats to pass out to them. Their jailer decides the fairest way to divide the treats is to seat the prisoners around a circular table in sequentially numbered chairs. A chair number will be drawn from a hat. Beginning
Hackerrank
We define to be a permutation of the first natural numbers in the range . Let denote the value at position in permutation using -based indexing. is considered to be an absolute permutation if holds true for every . Given and , print the lexicographically smallest absolute permutation . If no absolute permutation exists,
Hackerrank
The factorial of the integer n, written n!, is defined as: Calculate and print the factorial of a given integer. For example, if , we calculate and get . Function Description Complete the extraLongFactorials function in the editor below. It should print the result and return. extraLongFactorials has the following parameter(s)
Hackerrank
You will be given two arrays of integers and asked to determine all integers that satisfy the following two conditions: 1. The elements of the first array are all factors of the integer being considered 2. The integer being considered is a factor of all elements of the second array
Hackerrank
In Insertion Sort Part 1, you inserted one element into an array at its correct sorted position. Using the same approach repeatedly, can you sort an entire array? Guideline: You already can place an element into a sorted array. How can you use that code to build up a sorted
Hackerrank
Sorting One common task for computers is to sort data. For example, people might want to see all their files on a computer sorted by size. Since sorting is a simple problem with many different possible solutions, it is often used to introduce the study of algorithms. Insertion Sort These
Hackerrank
An English text needs to be encrypted using the following encryption scheme. First, the spaces are removed from the text. Let be the length of this text. Then, characters are written into a grid, whose rows and columns have the following constraints: For example, the sentence , after removing spaces is
Hackerrank
You are choreographing a circus show with various animals. For one act, you are given two kangaroos on a number line ready to jump in the positive direction (i.e, toward positive infinity). * The first kangaroo starts at location and moves at a rate of meters per jump. * The second
Hackerrank
Given a 2D Array, : 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 We define an hourglass in to be a subset of