Given a string s, return the lexicographically smallest string that can be made if you can make at most one swap between two characters in the string.
Constraints
n ≤ 10,000 where n is the length of s.https://binarysearch.com/problems/Lexicographic-Swap
Input
cbcaOutput
abccExplanation
We swap the first "c" and "a"
Given two strings s0 and s1, return the number of substrings where s1 contains any anagram of s0.
You are given two non-empty strings a and b that are the same length. Partition them into substrings such that each pair of a and b’s substring is the same s...
You are given three lowercase alphabet strings a, b and target. Strings a and b have the same length and are defined to be equivalent: a[i] = b[i]. For examp...
Given two lowercase alphabet strings a and b, return the length of a minimum substring in a that contains all the characters of b.
Leave a comment