摘要： Task description 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 阅读全文

摘要： Task description A non-empty zero-indexed array A consisting of N integers is given. A permutation is a sequence containing each element from 1 to N o 阅读全文

摘要： Task description Write a function: class Solution { public int solution(int[] A); } that, given a non-empty zero-indexed array A of N integers, return 阅读全文

摘要： Task description A non-empty zero-indexed array A consisting of N integers is given. Array A represents numbers on a tape. Any integer P, such that 0 阅读全文

摘要： Task description 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 g 阅读全文

摘要： Task description A zero-indexed array A consisting of N different integers is given. The array contains integers in the range [1..(N + 1)], which mean 阅读全文

摘要： Task description A non-empty zero-indexed array A consisting of N integers is given. The array contains an odd number of elements, and each element of 阅读全文

摘要： Task description A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the 阅读全文

摘要： Task description A zero-indexed array A consisting of N integers is given. Rotation of the array means that each element is shifted right by one index 阅读全文