I solved it by myself yesterday!

hnoest question how do you think of such approaches while the contest itself even if I was given like 10 days to solve this I wouldn't have thought of an approach like this one

@mbm.editzz

3 ай бұрын

mera toh 3rd yr khatam hone ko aya hai abhi bhi nhi hua

Thanks, great explanation

brilliant solution

aryan mittal legend

you are such a genius! I wish I can be as smart as you one day!

very helpful bro

Well explained and nice test case walk-through man! Just a small suggestion: you're adding too much drama in your facial expressions on camera, kind of distractive lol

bro many many thanks to you. apne iss week 2 pointer itni ache se explain kiya ki i got this one almost instantly during the contest. You are amazing bhai.

@akuma_168

3 ай бұрын

got stuck in removing OR value from starting pointer. I just suck at bit manipulation.

@Anonymous____________A721

6 күн бұрын

@abhishek pls share your profile or your solution link I am unable to understand any code

sliding window marathon

@chase.2595

3 ай бұрын

yeah even daily problems are of sw

Thanks Aryan

BRO ISSE NAHI HOSAKTA KYA #define ll long long #include using namespace std; class Solution { public: int minimumSubarrayLength(vector& nums, int k) { mapmp; int n=nums.size(); ll ans=1e8; for(int i=0;i=k)return 1; ll x=nums[i]; ll count=1; for(int j=i+1;j=k){ ans=min(ans,mp[{i,j}]); } } } if(ans==1e8){ return -1; } return ans; } };

@soham6473

3 ай бұрын

nhi