Given a binary string s of length N, the task is to find the lexicographically smallest string using infinite number of swaps between 0’s and… Read More
The post Lexicographically smallest Binary String formed using infinite swaps appeared first on GeeksforGeeks.