Comments & Complexity Discipline

// increment i
i++;

// Shrink sliding window to maintain distinct constraint
leftPointer++;

---

Complexity Discipline

Always state:

• Time Complexity
• Space Complexity
• Why it works

Example:

We traverse once → O(n) HashMap stores at most n elements → O(n)