Max Chunks To Make Sorted LeetCode solution in C++

1
class Solution {
2
 public:
3
  int maxChunksToSorted(vector<int> &arr) {
4
    // using chaining technique
5
    int maxi = INT_MIN;
6
    int ans = 0;
7

8
    for (int i = 0; i < size(arr); i++)
9

10
    {
11
      maxi = max(maxi, arr[i]);
12

13
      if (maxi == i) {
14
        //.. found partition
15
        ans++;
16
      }
17
    }
18
    return ans;
19
  }
20
};