Leetcode Problem 2434. Using a Robot to Print the Lexicographically Smallest String

2434. Using a Robot to Print the Lexicographically Smallest String

Leetcode Solutions

Create a list rightmin to track the minimum character in the suffix starting from each index in s.
Initialize an empty string t and an empty string p for the output.
Iterate through the string s from left to right.
At each step, pop characters from t and append them to p if they are lexicographically smaller or equal to both the current character in s and the minimum character in the suffix of s.
Append the current character of s to t.
After the iteration, pop all remaining characters from t and append them to p.
Return the string p.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen