<p>Given an integer array <code>arr</code>, return <em>the length of a maximum size turbulent subarray of</em> <code>arr</code>.</p>

<p>A subarray is <strong>turbulent</strong> if the comparison sign flips between each adjacent pair of elements in the subarray.</p>

<p>More formally, a subarray <code>[arr[i], arr[i + 1], ..., arr[j]]</code> of <code>arr</code> is said to be turbulent if and only if:</p>

<ul>
	<li>For <code>i &lt;= k &lt; j</code>:

	<ul>
		<li><code>arr[k] &gt; arr[k + 1]</code> when <code>k</code> is odd, and</li>
		<li><code>arr[k] &lt; arr[k + 1]</code> when <code>k</code> is even.</li>
	</ul>
	</li>
	<li>Or, for <code>i &lt;= k &lt; j</code>:
	<ul>
		<li><code>arr[k] &gt; arr[k + 1]</code> when <code>k</code> is even, and</li>
		<li><code>arr[k] &lt; arr[k + 1]</code> when <code>k</code> is odd.</li>
	</ul>
	</li>
</ul>

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

<pre>
<strong>Input:</strong> arr = [9,4,2,10,7,8,8,1,9]
<strong>Output:</strong> 5
<strong>Explanation:</strong> arr[1] &gt; arr[2] &lt; arr[3] &gt; arr[4] &lt; arr[5]
</pre>

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

<pre>
<strong>Input:</strong> arr = [4,8,12,16]
<strong>Output:</strong> 2
</pre>

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

<pre>
<strong>Input:</strong> arr = [100]
<strong>Output:</strong> 1
</pre>

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

<ul>
	<li><code>1 &lt;= arr.length &lt;= 4 * 10<sup>4</sup></code></li>
	<li><code>0 &lt;= arr[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def maxTurbulenceSize(self, arr: List[int]) -> int:
        if len(arr) == 1:
            return 1
        left = 0 
        right = 1 
        beg = 0
        bl = None
        while(right < len(arr) and arr[left] == arr[right]):
            right +=1
        if right >= len(arr):
            return 1
        beg = right - 1
        left = beg  
        if arr[left] > arr[right]:
            bl = 1
        elif arr[left] < arr[right]:
            bl = 0
        else:
            bl = -1
        ml = 0 
        while(left < right and left < len(arr)):
            print(left,right, bl, ml)
            if bl == 1:
                ml = max(ml, right - beg + 1)
                left +=1
                right +=1
                if right >= len(arr):
                    break
                if arr[left] < arr[right]:
                    bl = 0
                else:
                    bl = -1
            elif bl == 0:
                ml = max(ml, right - beg + 1)
                left +=1
                right +=1
                if right >= len(arr):
                    break
                if arr[left] > arr[right]:
                    bl = 1
                else:
                    bl = -1
            else:
                ml = max(ml, right - beg + 1)
                while(right < len(arr) and arr[left] == arr[right]):
                    right +=1
                if right >= len(arr):
                    break
                beg = right - 1
                left = beg 
                if arr[left] > arr[right]:
                    bl = 1
                elif arr[left] < arr[right]:
                    bl = 0
        ml = max(ml, right - beg + 1)
        return ml - 1

20800