Problem
Given two strings S and T, find the minimum window in S which contains all characters of T (including duplicates). If no such window exists, print "-".
Input format
Input
input.txt
- Line 1: string S (up to 100 characters) - Line 2: string T (up to 50 characters)
Output format
Output
output.txt
- The smallest substring of S containing all characters of T, or "-" if 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