Python coding challenges: "bst"

All Easy Medium Hard

All Python Basics Strings & Text Lists & Arrays Dicts & Sets Functions & Closures OOP & Classes Data Structures & Algorithms Advanced Python Iterators & Generators Decorators & Context Managers Error Handling & Exceptions Regular Expressions Math & Number Theory Bit Manipulation Dynamic Programming Trees & Binary Trees Graphs & Graph Algorithms Recursion & Backtracking Greedy Algorithms Binary Search Two Pointers & Sliding Window Stacks & Queues Heaps & Priority Queues Linked Lists Matrix & 2D Arrays Datetime & Time Calculations Data Formats & Parsing SQL & SQLite Numpy & Vectorized Computing Cryptography & Hashing

Two Pointers & Sliding Window hard

Minimum Window Substring

Implement a sliding window algorithm to find the minimum window substring containing all characters of a given pattern.

sliding-window two-pointers strings

+45 pts 35m

Two Pointers & Sliding Window hard

Minimum Window Subsequence

Given strings s and t, return the minimum window substring of s that contains t as a subsequence, or empty string if none exists.

sliding-window recursion dynamic-programming

+40 pts 35m

Showing 1–2 of 2 challenges · hard · Two Pointers & Sliding Window

Two Pointers & Sliding Window — Python coding challenges

What you will find here

This page lists two pointers & sliding window challenges — real Python problems you solve in the browser IDE with instant test feedback. Each challenge includes a clear brief, starter code, and automated checks.

Challenges vs tutorials and quizzes

Challenges test what you can build under constraints. For guided teaching, use our Python tutorials. For quick checks, try quizzes or copy snippets from code samples.

Python Coding Challenges

Minimum Window Substring

Minimum Window Subsequence

Two Pointers & Sliding Window — Python coding challenges

What you will find here

Challenges vs tutorials and quizzes

Python Coding
Challenges