423. Reconstruct Original Digits from English

LeetCodeHash TableMathStringOpen on judge ↗

Given a string s containing an out-of-order English representation of digits 0-9, return the digits in ascending order. Example 1: Input: s = "owoztneoer" Output: "012" Example 2: Input: s = "fviefuro" Output: "45" Constraints: - 1 <= s.length <= 105 - s[i] is one of the characters ["e","g","f","i","h","o","n","s","r","u","t","w","v","x","z"]. - s is guaranteed to be valid.

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI