Removal of cards

CodeChefOpen on judge ↗

You hav a deck of $N$-cards and each card has a number scribbled on it. You are given an array $A$ of length $N$ having **distinct integers**. **$A_0$ represent the number on bottom-most card and $A_{N-1}$ represent the number on top-most card**. There is a number in the array that has **the lowest value** and a number that has the **highest value**. Your goal is to **remove both the cards whic

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