LeetCode 567: Permutation In String — Step-by-Step Visual Trace

Given two strings s1 and s2, return true if s2 contains a permutation of s1. A permutation is a rearrangement of characters, so we need to find if any substring of s2 has the same character frequencies as s1.