โ† Amazon questions

Count impossible triangles

Filed under Amazon

Given an array of integers, count the number of triplets (i, j, k) that cannot form a triangle. A triplet (a, b, c) cannot form a triangle if the sum of any two sides is not greater than the third.

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 Amazon questions

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