Today, I completed HackerRank's "Java Substring Comparisons" challenge. The task involved finding the lexicographically smallest and largest substrings of length k from a given string. Using a simple ...

- So if left substring have alphabet same as right substring , they will cancel each other out and no change is needed - if alphabet in right substring don't exist in left substring , the value will ...