Find the Original Typed String I
A easy-tier problem at 57% community acceptance, tagged with String. Reported in interviews at Lowe's and 0 others.
Find the Original Typed String I is a straightforward string problem that appears deceptively simple on the surface. It shows up in Lowe's interviews and sits at a 57% acceptance rate, which means half the candidates stumble on something basic. The trap isn't the algorithm, it's the string parsing logic that candidates rush through. If you blank on the exact transformation during the OA, StealthCoder solves it invisibly in seconds and surfaces working code before the proctor notices you're stuck.
Companies that ask "Find the Original Typed String I"
Find the Original Typed String I is the kind of problem that decides whether you pass. StealthCoder reads the problem on screen and surfaces a working solution in under 2 seconds. Invisible to screen share. The proctor sees nothing. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoderThe problem asks you to reverse a typing process: given a string with some special characters (usually backspaces or deletion markers), reconstruct what was originally typed before those edits occurred. Most candidates try to simulate the typing forward, building a string character by character and handling deletions as they go. That works, but the logic gets messy if you're not careful with boundary checks and character handling. The cleaner approach is to work backward through the string or use a stack to track valid characters. Common pitfalls include off-by-one errors on backspace counts, forgetting to check string bounds, and mishandling consecutive deletion markers. When you hit the live assessment and the string parsing becomes a blur, StealthCoder runs silently in the background and delivers the solution.
Pattern tags
You know the problem.
Make sure you actually pass it.
Find the Original Typed String I recycles across companies for a reason. It's easy-tier, and most candidates blank under the timer. StealthCoder is the hedge: an AI overlay invisible during screen share. It reads the problem and surfaces a working solution in under 2 seconds. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Find the Original Typed String I interview FAQ
Is this problem really asked at companies like Lowe's?+
Yes. It appears in their reported interviews. The 57% acceptance rate suggests it's a real filter for junior and mid-level roles. Not everyone gets it right under time pressure, so it's worth drilling the edge cases beforehand.
What's the main trick to solving this efficiently?+
Use a stack or list to build the result character by character. Push characters onto the stack, and when you hit a deletion marker, pop if the stack is not empty. This avoids repeated string concatenation and keeps logic clean and O(n).
Why is the acceptance rate only 57% if it's marked easy?+
Easy problems still have gotchas. Here, candidates often miss edge cases: empty strings, too many backspaces, or consecutive deletions. Boundary checks trip people up during live assessments when they're rushing.
How does this relate to the String topic?+
It tests your ability to manipulate strings with a specific operation. You need to understand character-by-character traversal, string comparison, and how to handle removal operations efficiently without naive string rebuilding.
Should I memorize the solution or understand the pattern?+
Understand the stack-based pattern. It generalizes to many deletion and undo problems. Once you see why the stack avoids boundary bugs, you can apply it to variants without memorization.
Want the actual problem statement? View "Find the Original Typed String I" on LeetCode →