BloomReach - SDE 1 ( 1 year Exp ) - Coding Round

Problem 1 Convert an given array, you can only decrease the values. Need to find an array of non-decreasing nature who's some is maximum. Problem 2 Given a string S consisting only of lowercase english alphabets. You need to find number of unique subsequences of string S which are equal to string T. String T will always be "abcdefghijklmnopqrstuvwxyz" Constraints 0 <= |S| <= 100000 Example S = "abcdefghijklmnopqrstuvwxyzz" Answer: 2 Problem 3 Given a vector of size N consisting ...