Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1415. The k-th Lexicographical String of All Happy Strings of Length n
Find the k-th lexicographically smallest length-n string over {a,b,c} with no two adjacent characters equal, or return empty if fewer than k exist. Use combinatorial counting (total = 3 * 2^{n-1}) to construct the answer character-by-character by skipping blocks of size 2^{remaining-1} rather than enumerating all strings.
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.