We define the following terms:
Lexicographical Order, also known as alphabetic or dictionary order, orders characters as follows:
For example, ball < cat, dog < dorm, Happy < happy, Zoo < ball.
ball < cat
dog < dorm
Happy < happy
Zoo < ball
Given a string, , and an integer, , complete the function so that it finds the lexicographically smallest and largest substrings of length .
Complete the getSmallestAndLargest function in the editor below.
getSmallestAndLargest has the following parameters:
The first line contains a string denoting .
The second line contains an integer denoting .
Sample Input 0
Sample Output 0
String has the following lexicographically-ordered substrings of length :
We then return the first (lexicographically smallest) substring and the last (lexicographically largest) substring as two newline-separated values (i.e., ava\nwel).
The stub code in the editor then prints ava as our first line of output and wel as our second line of output.