Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK

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



Duration: 0:00
5,280 views
328


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

Hi Everyone, this is the 41st video of our Playlist "Greedy Technique : Popular Interview Problems".
Now we will be solving a good greedy based problem - Minimum Equal Sum of Two Arrays After Replacing Zeros | Crystal Clear Intuition | Leetcode 2918 | codestorywithMIK

I will explain it in full detail so that it becomes easy to understand. We will find the reason behind everything so that we understand why we did what we did.
And we will do a complete dry run

Problem Name : Minimum Equal Sum of Two Arrays After Replacing Zeros | Crystal Clear Intuition | Leetcode 2918 | codestorywithMIK
Company Tags : will update later
Code Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Greedy/Minimum Equal Sum of Two Arrays After Replacing Zeros.cpp
Leetcode Link : https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros


My DP Concepts Playlist :    • Roadmap for DP | How to Start DP ? | ...  
My Graph Concepts Playlist :    • Graph Concepts & Qns - 1 : Graph will...  
My Segment Tree Concepts Playlist :    • Segment Tree | Introduction | Basics ...  
My Recursion Concepts Playlist :    • Introduction | Recursion Concepts And...  
Trie Playlist -    • Word Search II (Google, Amazon, Meta,...  
Difference Array Technique: Concepts & Qns :    • Introduction | What | How | Differenc...  
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 :
The approach focuses on minimizing the total sum of two arrays by replacing each zero with the smallest possible positive integer, which is 1. It then calculates the adjusted sums of both arrays.
If one array's sum is still smaller and has no zeros left to adjust, it's impossible to make the sums equal—hence, return -1.
Otherwise, the maximum of the two adjusted sums is the minimum equal sum achievable. This ensures the most efficient use of zero replacements.

✨ Timelines✨
00:00 - Introduction
0:17 - Motivation
0:50 - Problem Explanation
3:22 - Thought Process + Observations
8:55 - Important Conditions
15:02 - 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-05-15Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK
2025-05-15Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK
2025-05-14Longest Unequal Adjacent Groups Subsequence I | Simple Intuition | Leetcode 2900 | codestorywithMIK
2025-05-14Total Characters in String After Transformations II | Binary Exponentiation | Leetcode 3337 | MIK
2025-05-14Matrix Exponentiation | n Degree Linear Recurrence | Super Detailed | codestorywithMIK
2025-05-12Total Characters in String After Transformations I | Made Easy | Leetcode 3335 | codestorywithMIK
2025-05-11Finding 3-Digit Even Numbers | 2 Simple Approaches | Leetcode 2094 | codestorywithMIK
2025-05-10Three Consecutive Odds | Important Motivation | 2 Approaches | Leetcode 1550 | codestorywithMIK
2025-05-10Dungeon Game | Brute Force | Recursion | Memo | Bottom Up | Leetcode 174 | DP On Grids | MIK
2025-05-10This Is Your Sign to Keep Going |Motivation | codestorywithMIK
2025-05-09Minimum Equal Sum of Two Arrays After Replacing Zeros | Made Easy | Leetcode 2918 | codestorywithMIK
2025-05-09Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK
2025-05-07Find Minimum Time to Reach Last Room II | Using Same Code | Leetcode 3342 | codestorywithMIK
2025-05-07No Loop Needed | Find Min & Max in 1 Line using STL | C++ Competitive Programming Hack
2025-05-06Find Minimum Time to Reach Last Room I | Detailed Explanation | Leetcode 3341 | codestorywithMIK
2025-05-05Build Array from Permutation | Follow Up Qn | Detailed Explanation | Leetcode 1920 |codestorywithMIK
2025-05-04Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK
2025-05-03Number of Equivalent Domino Pairs | Multiple Approaches | Dry Run | Leetcode 1128 | codestorywithMIK
2025-05-02Minimum Domino Rotations For Equal Row | Important Lesson | Dry Run |Leetcode 1007 |codestorywithMIK
2025-05-02Push Dominoes | Simplest Intuition | Complete Dry Run | Leetcode 838 | codestorywithMIK
2025-05-01Maximum Number of Tasks You Can Assign | Detailed Explanation | Leetcode 2071 | codestorywithMIK