Okay thank you, I added a note at the bottom that any letters may be used.

Hi Tasnim, hopefully my changes made this a little clearer! Thank you for your comment.

Yeah, the test was checking if your path was going in steps of 1, but the error message was wrong. I confirm that you do need to start from [0,0]. Thank you for spotting it out!

Let's check the value for each :

U C X E R V X X E --> 1 + 3 + 10 + 1 + 1 + 4 + 10 + 10 + 1 = 41
And the other :

J N Y F B L R K --> 8 + 1 + 10 + 4 + 3 + 1 + 1 + 10 = 38

The first one realize a better score than the second one. So you should return UCKERVXXE

You have to first get the biggest score an then, get the shortest. And if there is still several string, return the index of the first biggest.

Was that clear ?

*sigh*. Proper formatting. That being said, calculate the total seconds first.

Add your current (not working) solution as a spoiler in a comment. Please use proper markdown for formatting:

```javascript
// code
```

See the (resolved) issue below:

(don't worry for fractions of second)

Floor the values.