Neee help with Python code with best performance T$1$

Write a function solution that, given a string $S$ consisting of $N$ characters, returns the alphabetically smallest string that can be obtained by removing exactly one letter from $S.$

Examples:

Given $S=$ "acb", by removing one letter, you can obtain $"$ac$","$ab$"$ or $"$cb$".$ Your function should return $"$ab$"($after removing $\text{'}$c$\text{'})$ since it is alphabetically smaller than $"$ac$"$ and $"$bc$".$

Given $S=$ "hot", your function should return $"$ho$",$ which is alphabetically smaller than $"$ht$"$ and $"$ot$".$

Given $S=$ "codility", your function should return "cdility", which can be obtained by removing the second letter.

Given $S=$ "aaaa", your function should return "aaa". Any occurrence of $\text{'}$a$\text{'}$ can be removed.

Write an efficient algorithm for the following assumptions:

$N$ is an integer within the range $2.\mathrm{.}100,000$;

string $S$ is made only of lowercase letters $(a-z).$