<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 {
public:
    int maxTurbulenceSize(vector<int>& arr) {
         int ans = 0;
         for(int i = 0 ; i < arr.size() ; i++){
              //int choise1 = longest subarray we can have of the nature bg sml bg sml
              //int choise2 = longesy subarray we can have of the nature sml bg
              int choise1 = 1 + fun(i+1,arr,true);   //next should be big
              int choise2 = 1 + fun(i+1,arr,false);  //next should be small
              ans = max(ans , max(choise1,choise2));
         }
         return ans;
    }
    int fun(int idx , vector<int>&arr , bool flag){
          if(idx >= arr.size()){
             return 0;
          }
          if(flag == true){
               if(arr[idx-1] < arr[idx]){
                   return 1 + fun(idx+1,arr,false);
               }   
               else return 0;
          }
          else if(flag == false){
               if(arr[idx-1] > arr[idx]){
                   return 1 + fun(idx+1,arr,true);
               }
               else return 0;
          }
          return -1;
    }
};
43300