
This lecture explains what the term 'sliding' actually means in the context of the sliding window functionality.
This lecture explains re-iterates what a fixed-size sliding window is and what the use cases are.
This lecture explains a basic sliding window.
This lecture explains how to calculate the average from a subarray.
This lecture just does an in-depth explanation of the loop.
This lecture discusses the sliding window and how to use it for finding distinct values in a window. Moreover, you learn exactly what a 'distinct count' is because many coding challenges explain this in confusing ways. This lecture demonstrates that understanding a coding challenge is a skill set in an of itself.
This lecture explains what 'maintaining state' means in the context of a function or app.
Find the longest substring with no duplicates.
This lecture explains how to find the minimum sum of numbers positioned in a sliding window.
This lecture is for a coding challenge that involves a sliding window.
This lecture covers a challenge that is a lot more difficult than it appears on the surface. You must keep track of indices of each negative number to have it represented in the appropriate window. This efficiency will be required to pass any coding interview that asks this a similar question.
Demonstrating the fixed-size sliding window.
This lecture explains how to get the max value in a series of windows.
This lecture really goes in depth with using a queue, looping for windows and dictionaries.
This lecture explains the use of a queue, result and dictionary to figure out the sliding window coding challenge.
This lecture focuses on using the queue, a dictionary for mapping and creating an array for the results.
In this lecture, we explore other ways to solve without a dictionary.
Are you a Swift developer looking to level up your algorithmic skills and crack real-world coding challenges? This course is your focused guide to mastering one of the most powerful techniques in problem-solving: the fixed-size sliding window.
Sliding window algorithms are essential for solving problems that involve subarrays, sequences, or contiguous chunks of data. They're common in technical interviews, coding competitions, and practical development scenarios — yet many developers struggle to implement them efficiently and confidently. This course changes that.
In "Sliding Window Coding Patterns: From Novice to Ninja", you'll learn how to:
Identify problems that require fixed-size window solutions
Apply efficient window logic using Swift arrays, dictionaries, and queues
Optimize performance by maintaining state across sliding windows
Write reusable and concise Swift functions for sliding window problems
This course includes real coding challenges that walk you through problems like:
Finding maximum/minimum sums in a window
Calculating averages of subarrays
Tracking frequencies and detecting patterns
Identifying unique or repeating values in fixed windows
Each lesson is hands-on, with step-by-step explanations and clear illustrations of how the sliding window is formed, moved, and analyzed.
If you already know basic Swift programming and want to build real algorithmic muscle — especially for interviews or personal growth — this course will help you gain clarity and confidence, one window at a time.