Skip to main content
LeetCode 551, Easy. Topics: String. View on LeetCode. Generate this problem as a practice environment: tested reference solution, 20 parametrized pytest cases, and a playground notebook:

Problem

You are given a string s representing an attendance record for a student where each character signifies whether the student was absent, late, or present on that day. The record only contains the following three characters:
  • 'A': Absent.
  • 'L': Late.
  • 'P': Present.
The student is eligible for an attendance award if they meet both of the following criteria:
  • The student was absent ('A') for strictly fewer than 2 days total.
  • The student was never late ('L') for 3 or more consecutive days.
Return true if the student is eligible for an attendance award, or false otherwise.

Examples

Constraints

  • 1 <= s.length <= 1000
  • s[i] is either ‘A’, ‘L’, or ‘P’.

Solution

Reference implementation from solution.py on GitHub, full suite in test_solution.py:

Complexity

Tags

Last modified on September 7, 2026