You are given a string s representing an attendance record for a student, where each character indicates their attendance on that day:

• 'A': Absent.

• 'L': Late.

• 'P': Present.

The student is eligible for an attendance award if they satisfy both of the following conditions:

• The student was absent ('A') for strictly fewer than $2$ days in total.

• The student was never late ('L') for $3$ or more consecutive days.

Return true if the student is eligible for the attendance award, or false otherwise.

Constraints:

• $1 \leq$ s.length $\leq 1000$

• s[i] is either 'A', 'L', or 'P'.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.