Longest Binary Subsequence Less Than or Equal to K | 2 Ways | Leetcode 2311 | codestorywithMIK

Subscribers:
105,000
Published on ● Video Link: https://www.youtube.com/watch?v=ca04hcfuGlY



Duration: 0:00
6,692 views
410


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A

Hi Everyone, this is the 44th video of our Playlist "Greedy Playlist : Popular Interview Problems".
Now we will be solving a good Greedy based problem - Longest Binary Subsequence Less Than or Equal to K | 2 Ways | Leetcode 2311 | codestorywithMIK


I will explain it in full detail so that it becomes easy to understand. I have broken it down into steps which can help us understand and build our thought process.

Problem Name : Longest Binary Subsequence Less Than or Equal to K | 2 Ways | Leetcode 2311 | codestorywithMIK
Company Tags : will update later
Code Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Longest Binary Subsequence Less Than or Equal to K.cpp
Leetcode Link : https://leetcode.com/problems/maximum-manhattan-distance-after-k-changes/description/


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | Topic...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will no m...  
My Segment Tree Concepts Playlist :    • Segment Tree | Introduction | Basics | Bui...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And Ques...  
Trie Playlist -    • Word Search II (Google, Amazon, Meta, Micr...  
Difference Array Technique: Concepts & Qns :    • Introduction | What | How | Difference Arr...  
Monotonic Data Structure Concepts & Qns :    • Monotonic Data Structures Concepts & Qns  
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  

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


Video Summary :
✅ Recursive Version
Recursively decide for each character (from right to left) whether to take or skip.
Only take '1' if its bit value fits within k.
Subtract the bit’s value from k when taking to ensure valid subsequences.
Maximizes the count of characters taken under the constraint.

✅ Greedy Bitwise Version
Traverse the string from right to left, preferring low-bit positions.
Always include '0's (cost nothing), and include '1's if their bit cost fits in k.
Update k and shift power (bit weight) accordingly.
Efficiently builds the longest valid subsequence by prioritizing cheap bits first.


✨ Timelines✨
00:00 - Introduction
0:09 - Motivation
0:25 - Problem Explanation
1:44 - Thought Process - Simple Recursion (take and skip)
7:49 - Optimal Thought Process
14:38 - Dry Run
21:10 - Coding it up

#MIK #mik #Mik
#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




Other Videos By codestorywithMIK


2025-07-06Maximum Number of Events That Can Be Attended | Detailed Approach | Leetcode 1353 | codestorywithMIK
2025-07-05Finding Pairs With a Certain Sum | Simple Explanation | Leetcode 1865 | codestorywithMIK
2025-07-05Leetcode Hard | No problem | codestorywithMIK
2025-07-04Find Lucky Integer in an Array | 3 Approaches | In Place | Leetcode 1394 | codestorywithMIK
2025-07-03Find the K-th Character in String Game I | Two Approaches | Leetcode 3304 | codestorywithMIK
2025-07-02Find the Original Typed String II | Multiple Approaches | Detailed | Leetcode 3333 |codestorywithMIK
2025-06-30Find the Original Typed String I | Straight Forward | Leetcode 3330 | codestorywithMIK
2025-06-29Longest Harmonious Subsequence | Test your IQ | Leetcode 594 | codestorywithMIK
2025-06-28The voice beyond the face | codestorywithMIK
2025-06-28Find Subsequence of Length K With the Largest Sum | 2 Approaches | Leetcode 2099 | codestorywithMIK
2025-06-26Longest Binary Subsequence Less Than or Equal to K | 2 Ways | Leetcode 2311 | codestorywithMIK
2025-06-25Kth Smallest Product of Two Sorted Arrays | Detailed Explanation | Leetcode 2040 | codestorywithMIK
2025-06-23Find All K-Distant Indices in an Array | Easy | Leetcode 2200 | codestorywithMIK
2025-06-22Sum of k-Mirror Numbers | Super Detailed | Minute Details | Leetcode 2081 | codestorywithMIK
2025-06-21Divide a String Into Groups of Size k | Easy | Leetcode 2138 | codestorywithMIK
2025-06-20It’s what I do that defines me | codestorywithMIK
2025-06-20Maximum Manhattan Distance After K Changes | Detailed Explanation | Leetcode 3443 | codestorywithMIK
2025-06-18Partition Array Such That Maximum Difference Is K | Simple Thought Process | Leetcode 2294 | MIK
2025-06-17Count the Number of Arrays with K Matching Adjacent Elements | Detailed Approach | Leetcode 3405
2025-06-16Minimize the Maximum Adjacent Element Difference | Detailed Explanation | Leetcode 3357 | MIK
2025-06-15Maximum Difference Between Increasing Elements | Easy | Leetcode 2016 | codestorywithMIK