Practice Affirm Coding Question | Real Coding Interviews | Hack2hire

NewThe Learning module is now liveSee what's new

Question Bank Learning

Pricing Blog Forum

Quick Summary

Find all index triplets (i, j, k) where i < j < k and nums[i] > nums[j] > nums[k].
Return the total count of strictly decreasing subsequences of length three.
Focuses on counting combinations rather than identifying a single valid triplet.

What This Tests

Nested iteration over arrays
Combinatorial counting logic
Understanding index ordering constraints
Baseline complexity analysis

Common Patterns

Brute Force

Array Traversal

Counting

Test Cases

Input

Output

Expected