The Sliding window is a problem-solving technique for problems that involve arrays/lists. These problems are easy to solve using a brute force approach in O(n^2) or O(n^3). Using the ‘sliding window’ technique, we can reduce the time complexity to O(n). - SO / How to Solve Sliding Window Problems

• Sliding Window Technique
• 3. Longest Substring Without Repeating Characters
  • Sliding Window Algorithm - Longest Substring Without Repeating Characters (LeetCode)