Problem Brief

Last to Be Checked 🐳

In the bustling excitement of an event's beginning, attendees flock eagerly, each with their own story to tell. As time ticks on from the event's start, they queue up for an ID check, a gateway to the festivities. But there's a catch – only 10 hopefuls can stand in line at once.

Your mission? Find out when the last person's ID will be checked, measured in seconds from the event's kickoff.

For original prompt, pls refer to source images 𖡼𖤣𖥧𖡼𓋼𖤣𖥧𓋼𓍊

1Example 1

Input

moments = [1, 6, 9, 502]

Output

1201

Explanation

Explanation not found ꒰ঌ🦦໒꒱

Constraints

Limits and guarantees your solution can rely on.

Unknown for now

Draft autosaves locally

public int lastToBeChecked(int[] moments) {
    // write your code here
}

Input

moments

[1, 6, 9, 502]

Output

1201