Search results for subset

Find largest subset of increasing pair in an array of integers

Posted by CMaster (http://codingplayground.blogspot.com)

Question:

Given an array of integers A[N], find the maximum value of (j-k) such that A[k] <= A[j] & j>k

Answer |

Technical Questions | array subset All

« previous1 next »