Problem
Given strings S and T, print the shortest substring of S containing all characters of T (may be in any order, all must appear). If there are multiple, print the first. If impossible, print "None".
Input format
Input
input.txt
- String S (1–50) - String T (1–10)
Output format
Output
output.txt
- The minimal window substring or "None"
Example
input
adobecodebanc abc
output
banc
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
adobecodebanc abc
Expected output
banc
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc