Medium
Quiz
#423 Reconstruct Original Digits from English
APPROACH
The string s contains letters scrambled from English digit names ("zero" through "nine"). Determine how many times each digit 0–9 appears in s and return all digits in ascending order as a single string.
Example 1:
Input: s = "owoztneoer"
Output: "012"
Example 2:
Input: s = "fviefuro"
Output: "45"
1 of 4
1:00
What is the optimal approach for this problem?