Skip to content

Practice Using a Robot to Print the Lexicographically Smallest String

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2434
LeetCode Problem

Using a Robot to Print the Lexicographically Smallest String

Hash TableStringStackGreedy

Problem Statement

The robot buffer t and output paper start empty. Repeatedly either remove the first character of s and append it to t, or remove the last character of t and append it to the paper. Continue until both s and t are empty. Return the lexicographically smallest possible output.

Source: Using a Robot to Print the Lexicographically Smallest String on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "zza"
Output
"azz"

# Example 2

Input
s = "bac"
Output
"abc"

# Example 3

Input
s = "bdda"
Output
"addb"

Constraints

1 <= s.length <= 10^5
s consists of only English lowercase letters.

Related LeetCode Problems

Practice more problems similar to Using a Robot to Print the Lexicographically Smallest String.

3 Longest Substring Without Repeating Characters Medium12 Integer to Roman Medium13 Roman to Integer Easy17 Letter Combinations of a Phone Number Medium20 Valid Parentheses Easy
← Previous Find The Original Array of Prefix XorNext → Paths in Matrix Whose Sum Is Divisible by K

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free