SuperString | Topcoder Archive

Problem Statement

We define the goodness of a string S as the number of letters that appear in S only once. For instance, the goodness of the string "CHALLENGE" is 5 because it contains 5 distinct letters 'C', 'H', 'A', 'N' and 'G'.

You are given a String[] superstring. superstring is split for convenience only, so you should concatenate all of its elements in order and treat it as a single string. You are to find the substring of superstring that has the maximal goodness. In case of a tie, return the substring that comes earliest alphabetically.

Definition

Class:: SuperString
Method:: goodnessSubstring
Parameters:: String[]
Returns:: String
Method signature:: String goodnessSubstring(String[] superstring)
(be sure your method is public)

Constraints

superstring will have between 1 and 50 elements, inclusive.
Each element of superstring will contain between 1 and 50 characters, inclusive.
Each element of superstring will contain uppercase letters ('A'-'Z') only.

Examples

```
{"CHALLENGE"}
```
```
Returns: "CHALLENG"
```
```
{"THEWORD"}
```
```
Returns: "THEWORD"
```

{"THE", "MULTI", "LINE", "TEST"}

Returns: "HEMULTI"

{"ZYXWVUTSRQPONMLKJIHGFEDCBA", "ZYXWVUTSRQPONMLKJIHGFEDCBA"}

Returns: "AZYXWVUTSRQPONMLKJIHGFEDCB"

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.