Halloween Sale
Unlock all premium questions for over 30% off
Count Decreasing Triples
Easy
Question
You are given an integer array nums. Return how many index triplets (i, j, k) satisfy both i < j < k and nums[i] > nums[j] > nums[k], that is, how many ways there are to pick three positions, left to right, whose values strictly decrease.
...
Asked at:Affirm
More Affirm interview questions
- Convert Prefix to Postfixeasy
- Design Persistent Stackmedium
- Group Loans Under Top-Level Companymedium
- Summarize Recent Transactionseasy
- List Redeemable Offersmedium
- Live Fraud Monitoreasy
- Cross-Day Purchase Trust Scoringmedium
- Sum of Island Maximamedium
OfferRetriever
Master technical interviews with real questions from top companies. Build your confidence and career.
LEGAL
© 2026 Purple Business Holdings LLC. All rights reserved. See Terms of Service.