FrogJmp Count minimal number of jumps from position X to Y. 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 target. Write a function: class Solution { public..

OddOccurrencesInArray Find value that occurs in odd number of elements. A non-empty array A consisting of N integers is given. The array contains an odd number of elements, and each element of the array can be paired with another element that has the same value, except for one element that is left unpaired. For example, in array A such that: A[0] = 9 A[1] = 3 A[2] = 9 A[3] = 3 A[4] = 9 A[5] = 7 ..

CyclicRotation Rotate an array to the right by a given number of steps. An array A consisting of N integers is given. Rotation of the array means that each element is shifted right by one index, and the last element of the array is moved to the first place. For example, the rotation of array A = [3, 8, 9, 7, 6] is [6, 3, 8, 9, 7] (elements are shifted right by one index and 6 is moved to the fir..

BinaryGap Find longest sequence of zeros in binary representation of an integer. 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 binary representation of N. For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains..

Grid Challenge Given a square grid of characters in the range ascii[a-z], rearrange elements of each row alphabetically, ascending. Determine if the columns are also in ascending alphabetical order, top to bottom. Return YES if they are or NO if they are not. Example gird=[′abc′,′ade′,′efg′]gird = ['abc', 'ade', 'efg']gird=[′abc′,′ade′,′efg′] The grid is illustrated..

Simple Text Editor Implement a simple text editor. The editor initially contains an empty string, SSS. Perform QQQ operations of the following 444 types: append(W) - Append string WWW to the end of SSS. delete(k) - Delete the last kkk characters of SSS. print(k) - Print the kthk^{th}kth character of SSS. undo() - Undo the last (not previously undone) operation of type 111 or 222, reverting SSS t..