Add solution #551

Author: JoshCrozier

README.md

@@ -82,6 +82,7 @@
 451|[Sort Characters By Frequency](./0451-sort-characters-by-frequency.js)|Medium|
 459|[Repeated Substring Pattern](./0459-repeated-substring-pattern.js)|Easy|
 541|[Reverse String II](./0541-reverse-string-ii.js)|Easy|
+551|[Student Attendance Record I](./0551-student-attendance-record-i.js)|Easy|
 565|[Array Nesting](./0565-array-nesting.js)|Medium|
 566|[Reshape the Matrix](./0566-reshape-the-matrix.js)|Easy|
 606|[Construct String from Binary Tree](./0606-construct-string-from-binary-tree.js)|Easy|

solutions/0551-student-attendance-record-i.js

@@ -0,0 +1,26 @@
+/**
+ * 551. Student Attendance Record I
+ * https://leetcode.com/problems/student-attendance-record-i/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+var checkRecord = function(s) {
+  return !s.includes('LLL') && (s.indexOf('A') === s.lastIndexOf('A'));
+};