Solution (leetcode-in-java 1.21 API)

java.lang.Object
- g1001_1100.s1003_check_if_word_is_valid_after_substitutions.Solution

```
public class Solution
extends Object
```
1003 - Check If Word Is Valid After Substitutions.
Medium

Given a string s, determine if it is valid.

A string s is valid if, starting with an empty string t = "", you can transform t into s after performing the following operation any number of times:
- Insert string "abc" into any position in t. More formally, t becomes t_left + “abc” + t_right, where t == t_left + t_right. Note that t_left and t_right may be empty.
Return true if s is a valid string, otherwise, return false.

Example 1:

Input: s = “aabcbc”

Output: true

Explanation: "" -> “abc” -> “aabcbc” Thus, “aabcbc” is valid.

Example 2:

Input: s = “abcabcababcc”

Output: true

Explanation: "" -> “abc” -> “abcabc” -> “abcabcabc” -> “abcabcababcc” Thus, “abcabcababcc” is valid.

Example 3:

Input: s = “abccba”

Output: false

Explanation: It is impossible to get “abccba” using the operation.

Constraints:
- 1 <= s.length <= 2 * 10⁴
- s consists of letters 'a', 'b', and 'c'

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean isValid(String s)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- isValid
```
public boolean isValid(String s)
```