Chef and Mangoes

CodeChefOpen on judge ↗

Chef has N mango trees in his garden with ith tree having Xi number of mangoes on it. Chef plucks mangoes in a way that he chooses a subsequence of trees such that they have number of mangoes in increasing order. Your task is to help the Chef find the length of the longest such subsequence. This means that in a subsequence of M (M ≤ N) trees with mangoes {x1, x2, x3, …......, xm} if j j i and you

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