<p>A password is said to be <strong>strong</strong> if it satisfies all the following criteria:</p>

<ul>
	<li>It has at least <code>8</code> characters.</li>
	<li>It contains at least <strong>one lowercase</strong> letter.</li>
	<li>It contains at least <strong>one uppercase</strong> letter.</li>
	<li>It contains at least <strong>one digit</strong>.</li>
	<li>It contains at least <strong>one special character</strong>. The special characters are the characters in the following string: <code>&quot;!@#$%^&amp;*()-+&quot;</code>.</li>
	<li>It does <strong>not</strong> contain <code>2</code> of the same character in adjacent positions (i.e., <code>&quot;aab&quot;</code> violates this condition, but <code>&quot;aba&quot;</code> does not).</li>
</ul>

<p>Given a string <code>password</code>, return <code>true</code><em> if it is a <strong>strong</strong> password</em>. Otherwise, return <code>false</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> password = &quot;IloveLe3tcode!&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong> The password meets all the requirements. Therefore, we return true.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> password = &quot;Me+You--IsMyDream&quot;
<strong>Output:</strong> false
<strong>Explanation:</strong> The password does not contain a digit and also contains 2 of the same character in adjacent positions. Therefore, we return false.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> password = &quot;1aB!&quot;
<strong>Output:</strong> false
<strong>Explanation:</strong> The password does not meet the length requirement. Therefore, we return false.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= password.length &lt;= 100</code></li>
	<li><code>password</code> consists of letters, digits, and special characters: <code>&quot;!@#$%^&amp;*()-+&quot;</code>.</li>
</ul>

class Solution:
    def strongPasswordCheckerII(self, password: str) -> bool:
        # Check if the password has at least 8 characters
        if len(password) < 8:
            return False
        
        # Initialize flags for each requirement
        has_lower = False
        has_upper = False
        has_digit = False
        has_special = False
        
        # Define the set of special characters
        special_characters = set("!@#$%^&*()-+")
        
        # Iterate through the password to check each condition
        for i in range(len(password)):
            char = password[i]
            
            # Check for lowercase letter
            if char.islower():
                has_lower = True
            
            # Check for uppercase letter
            if char.isupper():
                has_upper = True
            
            # Check for digit
            if char.isdigit():
                has_digit = True
            
            # Check for special character
            if char in special_characters:
                has_special = True
            
            # Check for adjacent duplicate characters
            if i > 0 and password[i] == password[i - 1]:
                return False
        
        # Return true if all conditions are met
        return has_lower and has_upper and has_digit and has_special

# Example usage:
solution = Solution()
print(solution.strongPasswordCheckerII("IloveLe3tcode!"))  # Output: True
print(solution.strongPasswordCheckerII("Me+You--IsMyDream"))  # Output: False
print(solution.strongPasswordCheckerII("1aB!"))  # Output: False
28