A Success To Date

CodeChefOpen on judge ↗

Once upon a time in a Fairy land , there lived two lovers AMAN and LC . Due to some circumstances LC can go on a date with AMAN only on $Even$ $Dates$ $eg$ $2,30,14,...$ You are given an array of distinct positive integers $Dates$. Each integer in the array denoted by $Dates[i]$ represents a $Date$ on which AMAN is free to take her on a date. You being AMAN's best friend your task is to help h

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI