Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2953. Count Complete Substrings
Count the number of contiguous substrings where every distinct character appears exactly k times and every adjacent pair of characters differs by at most 2 positions in the alphabet. With word length up to 1e5, you must efficiently combine per-character frequency constraints with the local adjacency restriction to enumerate valid substrings.
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.