Longest Nice Substring Problem

Longest Nice Substring Problem — ExecCode Easy DSA Practice

Solve the Longest Nice Substring problem on ExecCode. Free online easy DSA practice in Hashing. Write and run code in Java, C++, Python — no signup required to run.

Description A string s is nice if, for every letter of the alphabet that s contains, it appears both in uppercase and lowercase. For example, "abABB" is nice because 'A' and 'a' appear, and 'B' and 'b' appear. However, "abA" is not because 'b' appears, but 'B' does not. Given a…

Practice Longest Nice Substring free on ExecCode. Browse more ExecCode DSA problems.