3105. Longest Strictly Increasing or Strictly Decreasing Subarray | Array | Sliding Window

In this video, I'll talk about how to solve Leetcode 3105. Longest Strictly Increasing or Strictly Decreasing Subarray | Array | Sliding Window
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
📱Telegram : t.me/aryan_mittal_group
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@learningmaths786]

Very good Aryan

[@jaisingh64]

2N is same as N no?

[@ARYANMITTAL]

Broooooo ❤️❤️❤️

[@jaisingh64]

bro cant we use sliding window logic and take two function strictly inc and strictly dec and get the max from the values we from from the two function?

[@learningmaths786]

Yeah sure we can do it but it takes 2 pass 2*n

[@ARYANMITTAL]

Don't Trust Leetcode on this - kzbin.info7hb7OWEa_w0?feature=share

[@ARYANMITTAL]

Problem A: kzbin.info/www/bejne/bambknabgbWLd6M Problem B: kzbin.info/www/bejne/jYCQfaxpn5h0i5Y Problem C: kzbin.info/www/bejne/iaKokKSsept5mKs Problem D: kzbin.info/www/bejne/g528eo2oiseYeZY

[@vikash-sinhaCS]

vai kon sa tab/device use krte ho!!!!!!

[@ARYANMITTAL]

Bhai Sam Sung S6 lite🙇, sasta tikao 🤌🏻

[@HariKrishnan-ff4hf]

class Solution { public: int longestMonotonicSubarray(vector& nums) { int maxi=0; int n = nums.size(),count1=1,count2=1; for(int i=1;i nums[i-1]) {//increasing count1++; } else{ maxi=max(maxi,count1); count1=1; } if(nums[i] < nums[i-1]) {//decreasing count2++; } else{ maxi=max(maxi,count2); count2=1; } } maxi=max({maxi,count1,count2}); return maxi; } };