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:

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

Рекомендации по теме

Комментарии

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?

jaisingh

class Solution {
public:
int nums) {
int maxi=0;
int n = nums.size(), count1=1, count2=1;
for(int i=1;i<n;i++) {
if(nums[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;
}
};

HariKrishnan-ffhf

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

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

3105. Longest Strictly Increasing or Strictly Decreasing Subarray | LEETCODE WEEKLY 392

3105 Longest Strictly Increasing or Strictly Decreasing Subarray || Brute to Optimized ✅

3105. Longest Strictly Increasing or Strictly Decreasing Subarray (Leetcode Easy)

3105. Longest Strictly Increasing or Strictly Decreasing Subarray #leetcodequestionandanswers #java

leetcode 3105 Longest Strictly Increasing or Strictly Decreasing Subarray - DP

3105. Longest Strictly Increasing or Strictly Decreasing Subarray | Weekly 392

3105. Longest Strictly Increasing or Strictly Decreasing Subarray | Array | Sliding Window (O(n))

3105. Longest Strictly Increasing or Strictly Decreasing Subarray | Weekly Contest 392 | Leetcode

3105. Longest Strictly Increasing or Strictly Decreasing Subarray

3105. Longest Strictly Increasing or Strictly Decreasing Subarray | LeetCode Weekly 392 Contest |C++

3105. Longest Strictly Increasing or Strictly Decreasing Subarray| LeetCode weekly contest 392 |

3105. Longest Strictly Increasing or Strictly Decreasing Subarray || Leetcode Weekly Contest 392

leetcode contest 392 3105. Longest Strictly Increasing or Strictly Decreasing Subarray

Leetcode 2073: Time Needed to Buy Tickets

DECODE DSA #LEVEL UP #CONTEST SOL#leetcode#challenge#Longest Strictly Inc/Dec Subarray#LC-3105

Leetcode 1700: Number of Students Unable to Eat Lunch

3046. Split the Array (Leetcode Easy)

3039. Apply Operations to Make String Empty | String | Hash Table | Observation Questions🧐

3107. Minimum Operations to Make Median of Array Equal to K | Adhoc | Sorting

CTAS Budget Worksheet Completion

992. Subarrays with K Different Integers | Sliding Window | 2 Pointers | FAANG

3097. Shortest Subarray With OR at Least K II | Sliding Window | 2 Pointers | Bit Manipulation