Category: c / c++
Given a function f(x, y) and a value z, return all positive integer pairs x and y where f(x,y) == z. The function is constantly increasing, i.e.: f(x, y) …
On a N * N grid, we place some 1 * 1 * 1 cubes. Each value v = grid represents a tower of v cubes placed on top …
We define a harmounious array as an array where the difference between its maximum value and its minimum value is exactly 1. Now, given an integer array, you need …
A sequence X_1, X_2, …, X_n is fibonacci-like if: n >= 3 X_i + X_{i+1} = X_{i+2} for all i + 2 <= n Given a strictly increasing array …
Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: Output: 4 Explanation: The longest increasing subsequence is , therefore the length is 4. …
