[Clash of code] The Wall Breaker (pending approval)

Puzzles
1

Hi everyone,

I’ve just submitted a new Clash of Code proposal.

The goal is simple and focused: find the optimal wall segment to destroy based on damage constraints, with clear rules and edge cases (ties, impossible scenarios, limits).

I aimed for:

  • A clear and unambiguous statement

  • A puzzle suitable for Speed, Shortest, and Code Size

  • A difficulty that rewards careful reading and clean logic rather than tricks

I’d really appreciate any feedback, and if you like the clash, feel free to approve it :slightly_smiling_face:

Thanks!