Solve min window & animal conflicts

Question

LeetCode 76. Minimum Window Substring: Given strings s and t, return the smallest substring of s that contains every character of t (including duplicates). Validate a hashmap where each key is an animal and its value is a list of animals that cannot share the same river bank; determine whether the exclusions are conflict-free.

https://leetcode.com/problems/minimum-window-substring/description/open_in_new