Problem You are given N counters, initially set to 0, and you have two possible operations on them: increase(X) − counter X is increased by 1, max counter − all counters are set to the maximum value of any counter. A non-empty array A of M integers is given. This array represents consecutive…
Problem Math-hater is short for a person who has given up on mathematics. Three math-haters are trying to take all math problems for the practice test. Math-haters are taken from question 1 to the last question as follows. Haters Answers Math-hater 1 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, … Math-hater 2…
Problem A small frog wants to get to the other side of a river. The frog is initially located on one bank of the river (position 0) and wants to get to the opposite bank (position X+1). Leaves fall from a tree onto the surface of the river. You are given an array A consisting of N integers…
Problem A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D. Count the minimal number of jumps that the small frog must perform to reach its…
Problem function solution(A); that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. For example, given A = 1, 3, 6, 4, 1, 2, the function should return 5. Given A = 1, 2, 3, the function should return 4. Given A = −1, −3, the function…
