falling_subsequence

CodeChefOpen on judge ↗

Jacob is adamant on doing more. As an attempt to learn about finding sub-sequences he takes up the following question. You are given an unsorted array/list containing 6 whole numbers. Find the size of the longest continuous decreasing sub-sequence/sub-array. Print 1 if you don't find any continuous decreasing sub-sequence. ###Sample Input 1 : {3,7,4,5,2,1} ###Sample Output 1 : 3 ###EXPLA

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