Digit Rotation Escape

Challenge says:

“Return the first rotation number if one is found.”

That phrasing sounds like:

  • Count how many rotations are divisible

  • Return that count

But that’s not what the test cases actually expect.

They actually expect…
Return the index (0‑based) of the first rotation that is divisible.

Can you please link to the url of the challeng you are doing.

this is from daily challenges 2026-04-05

https://www.freecodecamp.org/learn/daily-coding-challenge/2026-04-05