Problem
Given a string S (lowercase only) and a dictionary of words, determine if S can be segmented into space-separated sequence of dictionary words, using recursion.
Input format
Input
input.txt
- The first line contains a string S (length 1 to 30, lowercase only) - The second line contains an integer N (1 ≤ N ≤ 10) - Next N lines: each contains a word (1 to 10 lowercase letters)
Output format
Output
output.txt
- "YES" if S can be segmented, "NO" otherwise
Example
input
applepenapple 2 apple pen
output
YES
💬 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
applepenapple 2 apple pen
Expected output
YES
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