Given a string of length, N finds the minimum number of characters needed to delete to make right and left shift of the remaining string equal. Examples : Input : str: "36363636" Read more →
Subsequence
3 postsGiven 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”. Read more →
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 Read more →