← All problemsSign in

Binod And Binod

Binod was free with no work to do. So he asks Binod for some task. Binod gives him two different bundles of sticks, let's call them $X$ & $Y$. In bundle $X$ there are $N$ sticks arranged in a row such that $X_i$ denotes height of $i^{th}$ stick in bundle $X$. Similarly in bundle $Y$ there are $M$ sticks given, $M<=N$ such that $Y_i$ denotes height of $i^{th}$ stick in bundle $Y$. Binod also gives

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

Sign in to chat with the tutor and save your progress.

Sign in to start