Choose ten bounded interval shifts and report the resulting longest increasing subsequence length.
All challenges
Keywordssequence
Transform one integer sequence into another with pair operations when possible.
Transform one valid parenthesis sequence into another using limited structural operations.
Sort a permutation using cyclic shifts of one chosen segment length.
Construct a completely multiplicative +/-1 function with small prefix imbalance.