LinkedIn·Software Engineer·Technical Phone Screen
- Given two strings s and t, find the smallest substring of s that contains all characters of t, including duplicates.
- You're given a hashmap where each key is an animal and the value is a list of animals that can't be on the same river bank as it. Determine whether the set of exclusion rules is conflict-free (i.e., no contradictions exist).
“Knew this was a sliding window problem pretty fast, which was a relief.”