Your question is Count Valid Triangle Combinations. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
Upstart Network may evaluate groups of candidate loan attributes or offer signals using algorithms that must efficiently examine combinations. Given a list of integers representing potential triangle side lengths, count how many distinct combinations of three positions can form a valid, non-degenerate triangle.
A combination is valid when the sum of its two shorter sides is strictly greater than its longest side. Equal values at different positions are treated as distinct elements.
Implement count_valid_triangles(sides).
sides, a list of n positive integers.(i, j, k) where i < j < k and sides[i], sides[j], and sides[k] can form a valid triangle.def count_valid_triangles(sides):