Loading…
Loading…
Tutorials, deep-dives, and insights on Java, DSA, System Design, AI, and more.
Turn O(n²) substring and subarray problems into O(n). The fixed and variable sliding window templates in Java, with six worked interview problems.
Big O is how you talk about algorithm efficiency in interviews. Here's what each notation means and how to analyse code on the spot.