ELMO 2025 Problem 2

A contest has $2025$ problems. Elmo initially knows that the answers are $1$ , $2$ , $\dots$ , $2025$ in some order. Every minute, Elmo selects a problem that has not been answered correctly, inputs an answer to it, and is told whether the answer is correct or incorrect. Elmo wins the contest if and only if he answers all $2025$ problems correctly in at most $2024$ attempts each. Can Elmo guarantee that he wins the contest?

Andrew Lin and Calvin Wang