Java Substring Comparisons

Java Substring Comparisons

Difficulty	Max Score	Success Ratio
Easy	10	91.95%

We define the following terms:

• Lexicographical Order, also known as alphabetic or dictionary order, orders characters as follows:

[SVG image]
For example, ball < cat, dog < dorm, Happy < happy, Zoo < ball.

• A substring of a string is a contiguous block of characters in the string. For example, the substrings of abc are a, b, c, ab, bc, and abc.

Given a string, [SVG image] , and an integer, [SVG image] , complete the function so that it finds the lexicographically smallest and largest substrings of length [SVG image] .

Function Description

Complete the getSmallestAndLargest function in the editor below.

getSmallestAndLargest has the following parameters:

• string s: a string
• int k: the length of the substrings to find

Returns

• string: the string ' + "\n" + ' where and are the two substrings Input Format

The first line contains a string denoting [SVG image] .

The second line contains an integer denoting [SVG image] .

Constraints

• [SVG image]
• [SVG image] consists of English alphabetic letters only (i.e., [a-zA-Z]). Sample Input 0

welcometojava
3

Sample Output 0

ava
wel

Explanation 0

String [SVG image] has the following lexicographically-ordered substrings of length [SVG image] :

[SVG image] 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.

💡 Hints

➡️ Approach

✅ Detailed Solution

View Solution : Java Substring Comparisons

Submissions	Leaderboard	Discussions	Editorial
📝 My Submission	🏆 Track our position	🤔 Help from Community	✍️ Editorial