The answer
You would use three nested loops (i, j = i+1, k = j+1). This results in an O(N^3) time complexity.
Using Nested Loops for Generating Pairs
How do I generate triplets?
More FAQs in Using Nested Loops for Generating Pairs
Use a nested loop where the outer loop tracks index 'i', and the inner loop starts at index 'j = i + 1'.
It ensures you do not pair an element with itself, and it prevents generating redundant, mirrored pairs (e.g., checking [0,1] and then [1,0]).
Although the inner loop shrinks, the overall time complexity is still bounded by O(N^2) Quadratic Time.
Still have questions?
Browse all our FAQs or reach out to our support team
Want to upskill yourself?
Your learning library
Small steps. Big possibilities.
Find your next course. Build something great.