Maximum Candies You Can Get from Boxes | 2 Ways | Simple Intuition | Leetcode 1298 |codestorywithMIK

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



Duration: 0:00
7,027 views
362


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

Hi Everyone, this is the 77th video of our Playlist "Graphs : Popular Interview Problems".
Now we will be solving a good Graph practice problem - Minimum Operations to Make Array Values Equal to K | Detailed Thought Process | Leetcode 3375 | codestorywithMIK

The video contains my detailed thought process.

Problem Name : Maximum Candies You Can Get from Boxes | 2 Ways to solve | Simple Intuition | Leetcode 1298 | codestorywithMIK
Company Tags :
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Graph/BFS_DFS/Maximum Candies You Can Get from Boxes.cpp
Leetcode Link : https://leetcode.com/problems/maximum-candies-you-can-get-from-boxes


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...  
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 :
DFS Approach (Depth-First Search):
The DFS approach explores each box recursively. If a box is locked, it's added to foundBoxes; if it's open, it's processed immediately, and all its contained boxes and newly obtained keys are handled recursively. It ensures each box is only visited once and attempts to open previously inaccessible boxes if keys are found later.

BFS Approach (Breadth-First Search):
The BFS approach uses a queue to process boxes level by level. Initially open boxes are enqueued, and for each processed box, its keys and contained boxes are evaluated. If a new box becomes openable, it's added to the queue. This ensures boxes are unlocked and collected in the earliest possible order.


✨ Timelines✨
00:00 - Introduction
0:20 - Motivation
0:51 - Problem Explanation
6:17 - Simple intuitive visualisation
12:09 - One More Example
16:05 - Story To Code
25:46 - Coding DFS
33:17 - Coding BFS

#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-06-10What are Monotonic Data Structures | Monotonic Stack | Template | codestorywithMIK
2025-06-10Introduction to Monotonic Data Structures | Roadmap | Applications | codestorywithMIK
2025-06-10Write Down Your Dream | codestorywithMIK
2025-06-08Burden of being Average | codestorywithMIK
2025-06-08Debug by Day, Deadlift by Night | codestorywithMIK
2025-06-07Achanak se yaad agaya | Leetcode POTD | codestorywithMIK
2025-06-07A Message | Travel Tales | codestorywithMIK
2025-06-06Using a Robot to Print the Lexicographically Smallest String | Thought Process | Leetcode 2434 | MIK
2025-06-04Find the Lexicographically Largest String From the Box I | Another Approach | Leetcode 3403 | MIK
2025-06-04Find the Lexicographically Largest String From the Box I | Thought Process | Leetcode 3403 | MIK
2025-06-02Maximum Candies You Can Get from Boxes | 2 Ways | Simple Intuition | Leetcode 1298 |codestorywithMIK
2025-06-01Distribute Candies Among Children II | 4 Approaches | Detailed | Leetcode 2929 | codestorywithMIK
2025-05-31DP bole to Dynamic Programming 🥹 | codestorywithMIK
2025-05-29Maximize the Number of Target Nodes After Connecting Trees II | Full Dry Run | Leetcode 3373 | MIK
2025-05-27Maximize the Number of Target Nodes After Connecting Trees I | BFS | DFS | Leetcode 3372 | MIK
2025-05-27Are bhai 🥹❤️🙏
2025-05-27How it feels being good at DSA + Dev 🔥🔥 | codestorywithMIK
2025-05-27Maje hi Maje | DSA | HLD | LLD | codestorywithMIK
2025-05-26Divisible and Non-divisible Sums Difference | Constant Time | Leetcode 2894 | codestorywithMIK
2025-05-25Struggling With Logic in Coding ? Watch This Before Your Next LeetCode Question | codestorywithMIK
2025-05-25Avoid using Global Variables | codestorywithMIK