Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK

Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=pXr8CF7-5_Y



Duration: 0:00
7,160 views
418


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 23rd Video of our Playlist "Bit-Manipulation : Popular Interview Problems" by codestorywithMIK

In this video we will try to solve a good bit-manipulation problem : Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK


I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.

Problem Name : Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK
Company Tags : will update
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Bit_Magic/Shortest Subarray With OR at Least K II.cpp
Leetcode Link : https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And...  
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Subscribe to my channel :    / @codestorywithmik  

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

Summary :
Bitwise Representation Tracking: We use a vec array of size 32 to keep track of the number of set bits (1s) at each bit position across elements in the current window. This allows us to dynamically calculate the bitwise OR of all elements in the window without directly recomputing it each time.

Sliding Window: We maintain a sliding window with two pointers, i (start) and j (end). We expand the window by moving j and adding nums[j] to vec.

Window Contraction: If the current OR of the window (determined from vec) meets or exceeds the target k, we check if the current window length is the minimum found so far. We then contract the window from the left by moving i and removing nums[i] from vec.

Result: The smallest window length meeting the condition is stored in result, or we return -1 if no valid window is found.

This approach efficiently computes the minimum subarray length with a bitwise OR greater than or equal to k by leveraging bit manipulation and a sliding window.


✨ Timelines✨
00:00 - Introduction

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #coding #programming #100daysofcode #developers #techjobs #datastructures #algorithms #webdevelopment #softwareengineering #computerscience #pythoncoding #codinglife #coderlife #javascript #datascience #leetcode #leetcodesolutions #leetcodedailychallenge #codinginterview #interviewprep #technicalinterview #interviewtips #interviewquestions #codingchallenges #interviewready #dsa #hindi #india #hindicoding #hindiprogramming #hindiexplanation #hindidevelopers #hinditech #hindilearning #helpajobseeker #jobseekers #jobsearchtips #careergoals #careerdevelopment #jobhunt #jobinterview #github #designthinking #learningtogether #growthmindset #digitalcontent #techcontent #socialmediagrowth #contentcreation #instagramreels #videomarketing #codestorywithmik #codestorywithmick #codestorywithmikc #codestorywitmik #codestorywthmik #codstorywithmik #codestorywihmik #codestorywithmiik #codeistorywithmik #codestorywithmk #codestorywitmick #codestorymik #codestorwithmik #weekendwithmik #weekendwithMIK #interviewtips #interviewTips #interviewGuide #interviewGuidance




Other Videos By codestorywithMIK


2024-11-17Defuse the Bomb | Detailed for Beginners | Leetcode 1652 | codestorywithMIK
2024-11-17Maximum Sum of Distinct Subarrays With Length K | Khandani Template |Leetcode 2461 |codestorywithMIK
2024-11-16Shortest Subarray with Sum at Least K | Already Studied Concept | Leetcode 862 | codestorywithMIK
2024-11-16Find the Power of K-Size Subarrays I | Why Monotonic Deque | Dry Run|Leetcode 3254 |codestorywithMIK
2024-11-15Find the Power of K-Size Subarrays I | Simple Explanation | Dry Run| Leetcode 3254 |codestorywithMIK
2024-11-14Shortest Subarray to be Removed to Make Array Sorted | Detailed | Leetcode 1574 | codestorywithMIK
2024-11-13Minimized Maximum of Products Distributed to Any Store | Leetcode 2064 | codestorywithMIK
2024-11-12Count the Number of Fair Pairs | Detailed Explanation | Leetcode 2563 | codestorywithMIK
2024-11-11Most Beautiful Item for Each Query | Simple Explanation | Leetcode 2070 | codestorywithMIK
2024-11-10Prime Subtraction Operation | Straight Forward Approach | Leetcode 2601 | codestorywithMIK
2024-11-10Shortest Subarray With OR at Least K II | Made Easy | Detailed | Leetcode 3097 | codestorywithMIK
2024-11-08Minimum Array End | How much you know about AND | Detailed | Leetcode 3133 | codestorywithMIK
2024-11-08DSA Shorts with MIK - 8
2024-11-07Maximum XOR for Each Query | Simple Explanation | Leetcode 1829 | codestorywithMIK
2024-11-06Largest Combination With Bitwise AND Greater Than Zero | Detailed | Leetcode 2275 | codestorywithMIK
2024-11-05Find if Array Can Be Sorted | Detailed Approaches | Dry Runs | Leetcode 3011 | codestorywithMIK
2024-11-04Minimum Number of Changes to Make Binary String Beautiful | 2 Ways | Leetcode 2914 |codestorywithMIK
2024-11-03Consistency is the key
2024-11-02String Compression III | Simple Simulation | Leetcode 3163 | codestorywithMIK
2024-11-01Rotate String | Something to learn | Leetcode 796 | codestorywithMIK
2024-10-30Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK