Lexicographically Least Substring

View as PDF

Submit solution

All submissions

Best submissions

Points: 5

Time limit: 2.0s

Memory limit: 64M

Problem types

Brute Force Practice 2

You have a string (indexed from $0$ $0$ ) with no more than $50$ $50$ lowercase characters. Find the lexicographically least substring with a length of at least $K$ $K$ . A string $S$ $S$ is said to be lexicographically smaller than a string $T$ $T$ if $|S| < |T|$ $| S | < | T |$ and $S$ $S$ is a prefix of $T$ $T$ or $S_k < T_k$ $S_{k} < T_{k}$ and $S_i = T_i$ $S_{i} = T_{i}$ $(0 \le i < k, 0 \le k < \min(|S|, |T|))$ $(0 \leq i < k, 0 \leq k < min (| S |, | T |))$ . Here, $|X|$ $| X |$ denotes the length of the string.

Input Specification

The first line will have the string.

The second line will have $K$ $K$ .

Output Specification

Print the lexicographically least substring of length at least $K$ $K$ .

Sample Input

Copy

iloveprogramming
4

Sample Output

Copy

ammi

Comments

0

31501357 commented on Jan. 16, 2020, 7:10 p.m. ← edited →

I did length of only $K$ $K$ and passed, test cases are weak.

23

injust commented on Jan. 16, 2020, 7:32 p.m.

I think you might want to review the definition of lexicographical order.

0

31501357 commented on Aug. 14, 2020, 3:06 a.m.

Oh yeah.

35

p1geon commented on Jan. 17, 2020, 2:26 a.m.

He a little confused, but he got the spirit.

8

bobhob314 commented on Dec. 25, 2014, 4:25 p.m.

Python hax always provide a nice meme