Beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \nGoing forward, keep track of how many values satisfy the condition arr[i] > arr[i+1]. T
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nGoing forward, keep track of how many values satisfy the condition arr[i] > arr[i+1]. The moment this condition breaks, reset your count and store the maximum value in a variable. Print it at the end.\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int findLengthOfLCIS(vector<int>& arr) {\n        int size=1,ans=1;\n        arr.push_back(arr[arr.size()-1]-1);\n        for(int i=1;i<arr.size();i++)\n        {\n            if(arr[i]>arr[i-1])\n            {\n                size++;\n                ans=max(ans,size);\n            }\n            else{\n                size=1;\n            }\n        }\n        return ans;\n    }\n};\n```
['C++']