Blogs Hub

by Sumit Chourasia | May 11, 2020 | Category :coding | Tags : leetcodestringडेटा-संरचनाalgorithmआसान

Student Attendance Record I - मिनी टीवी

You are given a string representing an attendance record for a student. The record only contains the following three characters:

'A' : Absent.

'L': Late.

'P' : Present.

A student could be rewarded if his attendance record doesn't contain more than one 'A' (absent) or more than two continuous 'L' (late).

You need to return whether the student could be rewarded according to his attendance record.

Example 1:

``````Input: "PPALLP"

Output: True

``````

Example 2:

``````Input: "PPALLL"

Output: False``````

Solution:

``````using System;
using System.Collections.Generic;
using System.Text;

{
public class CheckRecordSoln
{
public bool CheckRecord(string s)
{
int absent = 0;
for (int i = 0; i < s.Length; i++)
{
if(s[i] == 'A')
{
absent++;
}
else
{
if (i < s.Length - 2)
{
if(s[i] == 'L' && s[i+1] == 'L' && s[i+2] == 'L')
{
return false;
}
}
}
}

return absent <= 1;
}
}
}
``````

Time Complexity: O(n)

Space Complexity: O(1)

Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia
Contributed By: Sumit Chourasia