Thanks for the feedback, the changes has been published

Sorry for the issue, the description has been fixed. Thank you for the feedback.

Sorry for the issue, now the Description is correct. Thanks

Just a detail but in your solution setup

//Writte here your code

should be

// Write your code here

The description error

"Given a string and a number (n), generate an array in which each position will be that same string but modifying the letter of its first position (0) by the one in its n position."

is still incorrect

Hello there:

• be carefour with variable names, prueba-> caseTest, casoX -> case,

• in the random test, variable n is never used

• no side cases tested, like empty string, all words same...

Thank you for the feedback, the issue has been resolved.

Thank you very much for notifying us of this error, the description has been fixed.

Thank you very much for notifying us of this error, the description has been fixed.

In the following example:

Given the string = "hello world" and n=1

Should return:

["eello world", "Hlllo world", "Hello world", "Heloo world","Hellw world", "Hello oorld", "Hello wrrld", "Hello wolld", "Hello wordd", "Hello worlH"]

Why is the second string "Hlllo world" instead of "hlllo world"? The original string did not have an uppercase 'h'.

In the following example:

Input:

hello, 2

Output:

[lello, hollo, hehlo, heleo, helll]

Why is the second string 'hollo' instead of 'hlllo'? The given offset is 2, not 3.

Issues:

Given a string and a number (n), generate an array in which each position will be that same string but modifying the letter of its first position (0) by the one in its n position.

This does not accurately describe the operation. It is not modifying the first and nth positions for every string.

Sample tests are not working.

Suggestion:

I would mention the spaces in the main description of the task, not only in the "restrictions" section; it's fairly fundamental to solving the problem.

Java Update

Java Translation