โ† Infosys questions
CodingHigh

Largest index difference in strictly decreasing subsequences

Filed under Infosys

Find the maximum difference between ending and starting indices (j - i) such that i <= j and the subarray from index i to j is strictly decreasing.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Infosys questions

Collected from public candidate posts and coding forums. Updated Nov 2026.