Onlearn
DSA
Data Science
Projects
Get started
Start with DSA Fundamentals
Programming Fundamentals
Start
Back to modules
Module 10 · 0/12
Module 10
Sliding Window & Two Pointer
0/12
1
8
3
Finding Longest Subarrays (Standard Sliding Window)
0/5
1
Longest Substring Without Repeating Characters
Med.
2
Max Consecutive Ones III
Med.
3
Fruit Into Baskets
Med.
4
Longest Substring with At Most K Distinct Characters
Med.
5
Longest Repeating Character Replacement
Med.
Counting Subarrays and Fixed Window
0/4
1
Binary Subarray with Sum
Easy
2
Count Number of Nice Subarrays
Med.
3
Number of Substrings Containing All Three Characters
Med.
4
Maximum Points You Can Obtain from Cards
Med.
Minimum Window and Advanced Constraints
0/3
1
Subarrays with K Different Integers
Hard
2
Minimum Window Substring
Hard
3
Minimum Window Subsequence
Hard