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

[@kafuu1]

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

[@AyushGupta-rf7vu]

Bro, loved your confidence and your approach was crazy🔥🔥

[@IK-xk7ex]

I solved it by myself yesterday!

[@ekanshgupta2930]

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

[@mmbmmbmmb]

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

[@abishekupadhyay6357]

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]

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

[@Anonymous____________A721]

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

[@harchitgulati3065]

nice approach ! understood it

[@chase.2595]

aryan mittal legend

[@rahulsomani6084]

nice video bro 🤯

[@priyanshkumar17]

Thanks, great explanation

[@TON-108]

Badhiya bhai 👏👏

[@shivamgurjar8979]

brilliant solution

[@Nutrino259]

God Aryan!!!!

[@10minutes_cs]

12:43 remove the contribution of OR

[@k.satish3663]

sliding window marathon

[@chase.2595]

yeah even daily problems are of sw

[@tzuilee588]

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

[@devanshsengar1877]

very helpful bro

[@mmbmmbmmb]

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]

nhi

[@prakashnandan7337]

Thanks Aryan

[@pasuvulamaheshbabu9845]

Bro,waste of time