Algorithms

Lily has a chocolate bar that she wants to share it with Ron for his birthday. Each of the squares has an integer on it. She decides to share a contiguous segment of the bar selected such that the length of the segment matches Ron's birth month and

Maria plays college basketball and wants to go pro. Each season she maintains a record of her play. She tabulates the number of times she breaks her season record for most points and least points in a game. Points scored in the first game establish her record for the season,

HackerLand University has the following grading policy: * Every student receives a  in the inclusive range from  to . * Any  less than  is a failing grade. Sam is a professor at the university and likes to round each student's  according to these rules: * If the difference between the  and the

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

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

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

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

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,

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

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