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..

Recursive Digit Sum We define super digit of an integer xxx using the following rules: Given an integer, we need to find the super digit of the integer. If has only 111 digit, then its super digit is xxx. Otherwise, the super digit of xxx is equal to the super digit of the sum of the digits of xxx. For example, the super digit of 9875 will be calculated as: super_digit(9875) 9+8+7+5 = 29 super_d..

Tower Breakers Two players are playing a game of Tower Breakers! Player always moves first, and both players always play optimally.The rules of the game are as follows: Initially there are nnn towers. Each tower is of height mmm. The players move in alternating turns. In each turn, a player can choose a tower of height xxx and reduce its height to yyy, where 1

Counting Sort 1 Comparison Sorting Quicksort usually has a running time of nnn x log(n)log(n)log(n), but is there an algorithm that can sort even faster? In general, this is not possible. Most sorting algorithms are comparison sorts, i.e. they sort a list just by comparing the elements to one another. A comparison sort algorithm cannot beat nnn x log(n)log(n)log(n) (worst-case) running time, sin..