Smallest subarray that covers set

Medium

Let's say you're given a string, and a set of characters that you're looking for in that string.

Find the shortest substring that contains all the characters in the set.

Your function should return the start and end indices of the substring in a tuple.

For example, given the following input:

search_string = "bitttcoin"
character_set = {"i", "c"}

The function's output should be (5, 7) since all characters in the set (i and c) appear in the shortest substring coi of the search string bitttcoin.

Note that the correct substring bitttcoin is shorter than the other: bitttcoin.

Note that the order that characters appear in the substring doesn't matter.

Keep in mind that characters could be repeated in the input string.

Try it

def cover_set(search_string: str, character_set: set[str]) -> tuple[int, int]:
    # implement cover_set
    return (None, None)

1def cover_set(search_string: str, character_set: set[str]) -> tuple[int, int]:
2    # implement cover_set
3    return (None, None)
4

Solution

6 Essential Hash Tables Coding Interview Problems

Master Hash Tables by trying the coding challenges below.

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.