Wee Subsequence
CodeChefOpen on judge ↗
A sequence is called a *Wee* sequence if the difference between its adjacent elements is alternating positive and negative. The first difference can be positive and negative while the rest will follow the strict pattern accordingly. Now understanding a *Wee* sequence, given an array $A$ you have to find the longest *Wee* subsequence in $A$. In other words, choose the largest subset of elements
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.
Sign in to chat with the tutor and save your progress.
Sign in to start