Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 552. Student Attendance Record II
Count the number of length-n strings over {A,P,L} with fewer than 2 'A's and no three consecutive 'L's, returning the result mod 1e9+7. The core challenge is to compute this efficiently for n up to 1e5 using DP or linear-recurrence/matrix-exponentiation techniques.
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.