An Interest In:
Web News this Week
- April 3, 2024
- April 2, 2024
- April 1, 2024
- March 31, 2024
- March 30, 2024
- March 29, 2024
- March 28, 2024
November 6, 2022 01:45 am GMT
Original Link: https://dev.to/salahelhossiny/orderly-queue-3k9i
Orderly Queue
You are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string..
Return the lexicographically smallest string you could have after applying the mentioned step any number of moves.
class Solution: def orderlyQueue(self, s: str, k: int) -> str: if k == 1: return min(s[i:] + s[:i] for i in range(len(s))) else: return ''.join(sorted(s))
Original Link: https://dev.to/salahelhossiny/orderly-queue-3k9i
Share this article:
Tweet
View Full Article
Dev To
An online community for sharing and discovering great ideas, having debates, and making friendsMore About this Source Visit Dev To