[Mock Interview]

Introductions were made, and the L3 level role was discussed.

A question was posed regarding a list of tournament-style teams represented by numbers.

The task was to compare pairs of adjacent numbers and determine if they represented valid matchups. A valid pair was defined as the top seed playing the lowest seed (e.g., 1st seed plays 8th seed, 2nd seed plays 7th seed, and so on).

If any game had a team incorrectly paired (e.g., a 1st seed playing a 2nd seed in the first round), the bracket was considered invalid, and the function should return false.

There is an N-player tournament. Players have ranks from 1 to N, and each player has a unique rank. Assume that the best player always wins, where the best player is the player with rank 1.

The tournament is a knockout tournament.

A draw is valid when, in each round:

• The best (based on rank) player plays with the worst player.
• The second best player plays with the second worst player.
• And so on.

Given a draw, find out whether it is a valid draw.