Longest Nice Substring

Find the longest substring of s such that for every letter appearing in that substring, both its lowercase and uppercase forms also appear; if multiple substrings tie, return the earliest one, or an empty string if none. (s length ≤ 100, letters are A–Z/a–z.)