The July Problem

CodeChefOpen on judge ↗

Problem description. The Longest Increasing Sub-sequence is one of the most famous DP problems(Please do read about it ). But since the first years haven't seen many DP problems yet, they wanted an easier problem. Srinivas, the legendary playboy from 3rd year, decided to give them an easy task. He calls this new problem – ‘The Strongest-cum-Longest Problem’. The ‘Strongest-cum-Longest’ subseque

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