3171. Find Subarray With Bitwise AND Closest to K | Sliding Window | Segment Tree + Binary Search

[@ARYANMITTAL]

Apologies for a bit late Contest Tutorial, Landlord se panga ho gya tha 🫨. [Live Stream on 2nd channel today at 9pm] . - 2 Pointer Crash Course - kzbin.info/www/bejne/kIuYk4KJh910p68 - Bit Manipulation Crash Course - kzbin.info/www/bejne/enWsh4eYltmoZ7s - Binary Search Template - kzbin.info/www/bejne/i4vbkHd_ad-Sopo - Segment Tree Crash Course - kzbin.info/www/bejne/hKDJg3x9epyijbc - Fenwick Tree Crash Course - kzbin.info/www/bejne/h5abooWer5ifsLM

[@humanity7880]

Thank you❤❤ This was very helpful

[@gaurish3367]

why is the sliding window condition (rangedAnd < k) ?

[@somebruhdyyyyy5538]

After every and/j++, the RangeAnd is decreasing, so once it passes k, we have to increase it(by doing i++), else it will keep going down and won't do much help

[@gaurish3367]

@@somebruhdyyyyy5538 ohh makes sense, thanks

[@30sunique78]

I am eagerly waiting for this .... Thanks for this Aryan for Reverting Bitwise (&) Any Anthore Way ?

[@yashwantyadav3367]

+1 👌👌

[@satwiktatikonda764]

what do you think aryan bro will this contest unrated or rated?

[@krishpoptani7862]

I think it will be unrated as all questions were intuitive and similar to prev leetcode ques. So it was matter of time to solve it. But leetcode wasted my 9 mins