AnagramList | Topcoder Archive

Problem Statement

An anagram of a string is any string that contains the same characters in any order. For example, the anagrams of "tree" are, in alphabetical order: "eert", "eetr", "eret", "erte", "eter", "etre", "reet", "rete", "rtee", "teer", "tere" and "tree".

You will be given a String s and an int i. Return the i^th (0-based) anagram of s when listed in alphabetical order. If there is no such anagram, return an empty String.

Definition

Class:: AnagramList
Method:: getAnagram
Parameters:: String, int
Returns:: String
Method signature:: String getAnagram(String s, int i)
(be sure your method is public)

Constraints

s will contain between 1 and 20 characters, inclusive.
Each character of s will be a lowercase letter ('a'-'z').
i will be between 0 and 2000000000 (2*109), inclusive.

Examples

```
"tree"
```
```
1
```
```
Returns: "eetr"
```
An example from the problem statement.
```
"tree"
```
```
6
```
```
Returns: "reet"
```
Another example from the problem statement.
```
"tree"
```
```
12
```
```
Returns: ""
```
As you can see in the problem statement, the list of anagrams of "tree" only has 12 elements, so none of them has index 12.
```
"abcabfebda"
```
```
5000
```
```
Returns: "aadfcabbbe"
```

"sdoijgfasdkhaiw"

2000000000

Returns: "adsdghwiiokfjas"

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.