Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1763. 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.)
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.