String to Integer (atoi)
A medium Strings problem included in Love Babbar 450. Below: the roles whose interviews prioritise this topic, and how to practise it.
- Topic
- Strings
- Sheets
- 1
- Core for
- 13 roles
- Platform
- LeetCode
The problem
Convert a string to a 32-bit signed integer, following the rules of the standard atoi function: skip leading whitespace, handle optional sign, read digits until a non-digit is encountered.
Example 1
- Input
- "42"
- Output
- 42
Example 2
- Input
- " -42"
- Output
- -42
Example 3
- Input
- "words and 987"
- Output
- 0
Constraints
- 0 <= s.length <= 200
- s consists of digits, spaces, and '+' or '-' signs
How to think about it
Updated 2026-09-09Parse characters sequentially as a finite state automaton with four phases: skip whitespace, read at most one optional sign, collect consecutive digits, and stop on any other character. Clamping to 32-bit signed limits must be caught right before an arithmetic overflow occurs rather than after an illegal integer wraps around.
Approaches, worst first
Regex extraction with large integer parse
time O(n) · space O(n)
Match the prefix format using a regular expression to extract leading spaces, an optional sign, and digit sequences. Converting the matched text into an unbounded integer or string buffer before manual clamping incurs extra allocation overhead and regex engine execution costs.
Direct pointer scan with overflow guardWrite this one
time O(n) · space O(1)
Skip leading spaces with a pointer, record sign if '+' or '-' follows, then process digits one by one. Check if current accumulator exceeds (INT_MAX - digit) / 10 before multiplying by 10; clamp immediately to INT_MIN or INT_MAX upon overflow.
Where people lose marks · 3
- Empty string or string containing only spaces: must return 0 without accessing out-of-bounds indices.
- Sign followed by non-digits like '+-12' or '+abc' must evaluate to 0 immediately.
- 32-bit integer overflow: checking for overflow after multiplying by 10 is too late if integers overflow into negative numbers or trigger undefined behavior.
The theory behind it
Strings — the ground this problem stands on. All Strings problems
What Strings is
A string is an ordered necklace of text characters, like letters printed along a ribbon of paper. Each character sits at an exact numeric slot, holding a glyph such as a letter, punctuation mark, or digit. In many programming languages, ribbons cannot be edited after creation, meaning changing a single character requires pressing an entirely new ribbon from scratch.
When to reach for it
Reach for string techniques when inputs consist of words, DNA sequences, serialized data formats, or sentences. Clues include questions testing palindromes, anagram matches, substring patterns, parenthesis balancing, or character frequency counts. Whenever an algorithm asks to transform capitalization, parse structured tokens, or compute edits between two phrases, string representations are the core subject.
How the pattern works
Think of characters as small integer codes ranging across standard character sets. Frequency tables with fixed sizes often replace heavy hash maps when tallying occurrences. For search tasks, maintain rolling state using character indices or sliding borders. When building output text through repeated appends, accumulate pieces inside a mutable list or string builder rather than concatenating strings directly, avoiding quadratic copy overhead.
What each operation costs
| Operation | Time |
|---|---|
| read character by index | O(1) |
| concatenate two strings of total length n | O(n) |
| compare two strings of length n | O(n) |
What usually goes wrong with Strings
- Concatenating strings inside a loop using the plus operator, which silently creates full copies on each iteration and turns linear routines into quadratic slowdowns.
- Assuming all characters fall strictly within lowercase English letters without validating spaces, uppercase variants, punctuation marks, or multi-byte unicode symbols.
- Confusing substring length with end index when slicing, causing unexpected off-by-one truncations in languages that take length versus exclusive end position.
Which roles need this problem
Strings is a core topic for these 13 roles — if you're targeting one of them, this problem is early in your path, not optional.
Secondary for 7 more roles, including Data Engineer, Data Analyst, Embedded / Firmware Engineer.
Track this in your role's order
Pick your target role and all 370 problems — including this one — resequence to what that interview actually asks. Free.
Start freeMore Strings problems
Problem set and role mapping as of .