Subsequence Archives

Check if binary string can be sorted

Given a binary string consisting of ‘0’ & ‘1’. You can remove any subsequence in given string but can’t pick adjacent indices. Print “POSSIBLE” if string can be sorted else print “NOTPOSSIBLE”. Examples: Input: 110 Output: POSSIBLE Explanation: If we remove characters at index 1 & 3 we are left with “1” which is sorted. Input: 101001111 Output:… Read More »

Maximize length of increasing subsequence possible by appending given sequence

Given a sequence A1,A2,A3,….,An and an empty sequence B. You need to find M minimum number of times this sequence should be appended in B, so that the length of longest increasing sequence in B is maximum possible. Examples: Input : [2,1] Output : 2 Explaination: If we append the sequence 2 times then the resulting sequence is… Read More »