Oracle, Recently Asked Online Assessments in 28 Oct, 2024 | Largest Subsequences

1. Largest Subsequences Problem Statement: Given a string s of length n, find the alphabetically largest subsequence of length i possible for each i where (1 <= i <= n). Note: A subsequence is a string left after deleting some or no characters from the original string without changing their order. For example, "ac" is a subsequence of "abcd" but "ca" is not. Example Consider s = "hrw". The alphabetically largest subsequence of length 1 is "w". of length 2 ...