Hash Tables & Sets – Time & Space Complexity

Hash Tables & Sets – Time & Space Complexity

Learn how Python dictionaries and sets work under the hood, analyze the Big‑O time and space complexity of operations, and compare hash tables with lists for optimal data access and storage.

Sliding Window Algorithm – Fixed & Variable Length

Sliding Window Algorithm – Fixed & Variable Length

Master the sliding window technique for solving subarray and substring problems. Learn when to use fixed vs variable windows, common patterns, and how to optimize with two-pointer strategies.

Two Pointers Algorithm – Intuition & Patterns

Two Pointers Algorithm – Intuition & Patterns

Understand the two pointers technique and how it simplifies array and string problems by reducing nested loops. Learn key patterns, types of pointer movement, and when to apply this strategy effectively.

Lists, Arrays & Strings: Big‑O Overview

Lists, Arrays & Strings: Big‑O Overview

Understand Python lists and strings through the lens of Big‑O analysis. Learn the difference between static and dynamic arrays, explore time and space complexity for key operations, and use practical cheat sheets to master list and string behaviors.

Time and Space Complexity

Time and Space Complexity

Explore data structure classifications, grasp time and space complexity basics, and use Big-O cheat sheets to gauge runtime expectations in coding problems.