CorruptedMessage | Topcoder Archive

Problem Statement

Your friend just sent you a message. The message consisted of one or more copies of the same lowercase letter. For example, "aaaaa" and "xxxxxxxxx" are valid messages. Unfortunately, on its way to you the message became corrupted: exactly k letters of the original message were changed to some other letters. The message you received is s.

Given the String s and the int k, reconstruct the original message. More precisely, return a String that could have been the original message. It is guaranteed that at least one such String will always exist. If there are multiple possible answers, you may return any of them.

Definition

Class:: CorruptedMessage
Method:: reconstructMessage
Parameters:: String, int
Returns:: String
Method signature:: String reconstructMessage(String s, int k)
(be sure your method is public)

Constraints

The number of characters in s will be between 1 and 50, inclusive.
Each character in s will be a lowercase letter ('a'-'z').
k will be between 0 and the length of s, inclusive.
At least one possible original message will be consistent with s and k.

Examples

```
"hello"
```
```
3
```
```
Returns: "lllll"
```
The three corrupted characters have 0-based indices 0, 1, and 4.
```
"abc"
```
```
3
```
```
Returns: "ddd"
```
The original message can't be "aaa", "bbb", or "ccc", since we need to change exactly 3 characters. Some other possible answers include "qqq", "xxx", or "ppp".

"wwwwwwwwwwwwwwwwww"

Returns: "wwwwwwwwwwwwwwwwww"

No characters were corrupted.

```
"ababba"
```
```
3
```
```
Returns: "aaaaaa"
```
"bbbbbb" will also be accepted.
```
"zoztxtoxytyt"
```
```
10
```
```
Returns: "oooooooooooo"
```

"jlmnmiunaxzywed"

Returns: "mmmmmmmmmmmmmmm"

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.