2124 - Check if All A's Appears Before All B's (Easy)
Problem Link
https://leetcode.com/problems/check-if-all-as-appears-before-all-bs
Problem Statement
Given a string s consisting of only the characters 'a' and 'b', return true if every'a' appears before every'b'in the string. Otherwise, return false.
Example 1:
Input: s = "aaabbb"
Output: true
Explanation:
The 'a's are at indices 0, 1, and 2, while the 'b's are at indices 3, 4, and 5.
Hence, every 'a' appears before every 'b' and we return true.Example 2:
Input: s = "abab"
Output: false
Explanation:
There is an 'a' at index 2 and a 'b' at index 1.
Hence, not every 'a' appears before every 'b' and we return false.Example 3:
Input: s = "bbb"
Output: true
Explanation:
There are no 'a's, hence, every 'a' appears before every 'b' and we return true.Constraints:
1 <= s.length <= 100s[i]is either'a'or'b'.
Approach 1: Substring Check
We need to check whether all the characters appear before all the characters. A valid string can contain only characters, only characters, or some characters followed by some characters.
The string becomes invalid if a appears before an . Because the string contains only and , this situation must create the adjacent pattern somewhere in the string. Therefore, we can simply check whether is present. If is not in the string, every appears before every , so the result is true. Otherwise, it is false.
The time complexity is and the space complexity is .
class Solution:
def checkString(self, s: str) -> bool:
return "ba" not in s2122 - Recover the Original Array
Recover the original array by testing candidate offsets and pairing each shifted value with its required counterpart.
2127 - Maximum Employees to Be Invited to a Meeting
Find the largest possible meeting by analyzing favorite-person cycles and chains that feed into mutual pairs.