Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | codestorywithMIK

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



Duration: 0:00
4,012 views
220


Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 24th Video of our Playlist "Stack : Popular Interview Problems" by codestorywithMIK

In this video we will try to solve an easy stack based Problem : Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | 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 : Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | codestorywithMIK
Company Tags : META
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Stack/Minimum Add to Make Parentheses Valid.cpp
Leetcode Link : https://leetcode.com/problems/minimum-add-to-make-parentheses-valid


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 :
Stack-Based Approach:

Logic: Uses a stack to track unmatched opening parentheses (. For each closing parenthesis ), if there is a corresponding opening parenthesis in the stack, it is popped; otherwise, a counter (open) is incremented for unmatched closing parentheses.
Final Calculation: The result is the sum of unmatched closing parentheses (open) and the number of unmatched opening parentheses left in the stack (stack.size()).
Complexity:
Time: O(n)
Space: O(n) (due to stack usage)
Counter-Based Approach:

Logic: This approach uses two integer counters: size to track unmatched opening parentheses and open to count unmatched closing parentheses. It iterates through the string, incrementing size for each ( and decrementing it for each ) if there are unmatched opening parentheses (size greater than 0). If there are no unmatched opening parentheses, it increments open.
Final Calculation: The result is open + size, representing the total number of parentheses needed to balance the string.
Complexity:
Time: O(n)
Space: O(1) (constant space, as it only uses integer variables)

✨ 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




Other Videos By codestorywithMIK


2024-10-17Count Number of Maximum Bitwise-OR Subsets | Simplest Approach |Leetcode 2044 | codestorywithMIK
2024-10-17Maximum Swap | 2 Simple Approaches | Leetcode 670 | codestorywithMIK
2024-10-15Longest Happy String | Simple Thought Process | Leetcode 1405 | codestorywithMIK
2024-10-14Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK
2024-10-13Maximal Score After Applying K Operations | Standard Heap Problem | Leetcode 2530 | codestorywithMIK
2024-10-13Smallest Range Covering Elements from K Lists | Multiple Ways | Leetcode 632 | codestorywithMIK
2024-10-11Divide Intervals Into Minimum Number of Groups | Simple Intuition | Leetcode 2406 | codestorywithMIK
2024-10-11The Number of the Smallest Unoccupied Chair | Brute Force | Optimal |Leetcode 1942 |codestorywithMIK
2024-10-10Maximum Width Ramp | Brute Force | Better | Optimal | Leetcode 962 | codestorywithMIK
2024-10-09What motivates me ?
2024-10-08Minimum Add to Make Parentheses Valid | Simple Intuition | Leetcode 921 | codestorywithMIK
2024-10-07Minimum Number of Swaps to Make the String Balanced | Reason | Leetcode 1963 | codestorywithMIK
2024-10-06Minimum String Length After Removing Substrings | 3 Approaches | Leetcode 2696 | codestorywithMIK
2024-10-04Sentence Similarity III | 2 Simple Approaches | Dry Run | Leetcode 1813 | codestorywithMIK
2024-10-03Permutation in String | Multiple Approaches | Clean Dry Run | Leetcode 567 | codestorywithMIK
2024-10-02Make Sum Divisible by P | Simplest Explanation | Full Dry Run | Leetcode 1590 | codestorywithMIK
2024-10-02Divide Players Into Teams of Equal Skill | With Proof | Dry Run | Leetcode 2491 | codestorywithMIK
2024-10-02DSA Shorts with MIK - 6
2024-09-29Design a Stack With Increment Operation | Better Approach | O(1) | Leetcode 1381 | codestorywithMIK
2024-09-29Check If Array Pairs Are Divisible by k | Simplest Explanation | Leetcode 1497 | codestorywithMIK
2024-09-28DSA Shorts with MIK - 5