← All problemsSign in

Hack it

Alco is doing an ethical hacking course. He has to hack into his friend Ding's accounts. Alco already knows that Ding follows a certain kind of pattern when he sets his passwords. It is a pattern containing only +'s and -'s (+ represents increasing and - represents decreasing). The pattern's length is N. An array of numbers 1 2 3 .... N+1 is formed. Alco needs to find a permutation of the array

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