How do you analyze the time complexity of nested loops?
PICTURE THIS: OOP PILLARS
Simple meaning
Multiply independent iteration counts: an n-loop around an n-loop is O(n^2).
WHY — Complexity instead of guessing?
Why interviewers care about Complexity:
question about Complexity.
trade-offs, and what you would actually do on a DSA project - not buzzwords.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Multiply independent iteration counts:
an n-loop around an n-loop is O(n^2).
- 2If the inner loop
runs i times as i goes 1 to n, the total is still O(n^2) because the triangular sum is n(n+1)/2.
- 3If the inner loop
halves, think O(n log n) instead of blindly saying n squared.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Multiply independent iteration counts: an n-loop around an n-loop is O(n^2). If the inner loop runs i times as i goes 1 to n, the total is still O(n^2) because the triangular sum is n(n+1)/2.