mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 15:01:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added link to leetcode.

Browse Source
This commit is contained in:
Wilson Strasilla 2024-10-17 15:39:21 -07:00
parent 85fcd387cc
commit 0ceeb2ccec
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
strings/min_window_substring.py
View File

@ -4,6 +4,10 @@ def min_window(search_str: str, target_letters: str) -> str:
return the smallest substring of the search string that contains return the smallest substring of the search string that contains
all target char_dict. all target char_dict.
This is somewhat modified from my solution to the problem
"Minimum Window Substring" on leetcode.
https://leetcode.com/problems/minimum-window-substring/description/
>>> min_window("Hello World", "lWl") >>> min_window("Hello World", "lWl")
'llo W' 'llo W'
>>> min_window("Hello World", "f") >>> min_window("Hello World", "f")