← All problemsSign in

Insider Subsequences

You are given an array $A$ with $N$ positive integers. An $x$-insider of this array is a [subsequence](https://en.wikipedia.org/wiki/Subsequence) of $A$ such that $x$ is **strictly** in between any two consecutive elements of the subsequence. More formally, a subsequence $S = [s_0, s_1, \dots s_{k-1}]$ of the array $A$ is an $x$-insider if for every integer $i$ such that $1 \leq i \leq k-1$, ei

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