EdgeCase
Lexicographically Maximum Subsequence
1100
greedy
strings
Solve on Codeforces
Login to submit
C++
Python
Java
C
Rust
Run (Ctrl+↵)
stdin
custom input
output
Run your code to see output here.
AI Assistant
Analysis
Test Cases
✕
Use "AI Analyze" or "Gen Tests" to get started.