The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, ...

Given an array of integers A of size N and an integer B. array A is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 mi

Given an integer, A. Compute and return the square root of A. If A is not a perfect square, return floor(sqrt(A)).

Rearrange a given array so that Arr[i] becomes Arr[Arr[i]] with O(1) extra space.

You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). You need to do this in place.

Find the contiguous subarray within an array, A of length N which has the largest sum.