FastPrep
Problem · String

Modify the String

Learn this problem
● MediumYahooOA

Problem statement

Given a string input_str of length n, choose any character that occurs at least twice and delete any one occurrence. Repeat this until all remaining characters are distinct. Return the lexicographically maximum string that can be formed this way.

Function

getString(input_str: String) → String

Complete the function getString in the editor below.

getString has the following parameters:

  • string input_str: a string of length n

Returns

string: the result of the operations, as described

Examples

Example 1

input_str = "aabcb"return = "acb"
The length of the string, n = 5. Some of the strings that can be formed are:
  • "acb" - delete the first occurrences of 'a' and 'b'
  • "abc" - delete the first occurrence of 'a' and the second occurrence of 'b'
It can be proven that the lexicographically maximum string that can be obtained is "acb".

Constraints

  • input_str contains only lowercase English letters
  • 1 ≤ n ≤ 10^5

More Yahoo problems

drafts saved locally
public String getString(String input_str) {
  // write your code here
}
input_str"aabcb"
expected"acb"
checking account