Skip to main content
All Questions

A substring is balanced when every letter in it appears the same number of times. Given a string of lowercase letters, find the length of the longest balanced substring.

Unlock detailed company stats for this questionUpgrade

Community answers

No answers contributed by the community yet.

Related questions

Calculate the number of times a pattern appears in a string.Among the substrings of a lowercase string whose first letter is a vowel and whose last letter is a consonant, find the alphabetically smallest and the alphabetically largest.Given an array of integers and a number N, find the length of the longest contiguous subarray such that the difference between any two elements in the subarray is less than N.

Related courses

Course

Behavioral Interviews: A Practical Guide for Engineers

Get offers at the level you deserve. Prep for senior+ behavioral interviews at FAANG and Tier-1 companies. Made with staff and principal engineers from Meta, Netflix, Google, and more. Avoid downleveling, elevate past projects, and stop sounding like a robot.

Course

Software Engineering Interview Prep

Land your dream software engineering role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates—practice data structures, algorithms, system design, people management, behavioral interviews, and more.