Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK

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



Duration: 0:00
6,567 views
381


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

In this video we will try to solve a good String based Problem : Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | 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 : Separate Black and White Balls | 2 Simple Ways | Leetcode 2938 | codestorywithMIK
Company Tags : will update soon
My solutions on Github(C++ & JAVA) - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Separate Black and White Balls.cpp
Leetcode Link : https://leetcode.com/problems/separate-black-and-white-balls


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 :
Approach 1 (Straightforward Traversal):

This method traverses the string from left to right.
The goal is to move all 'white' tiles ('0') to the left while keeping 'black' tiles ('1') on the right.
As it iterates, it counts how many 'black' tiles have been encountered and, whenever a 'white' tile is found, it increments the swap count by the current number of 'black' tiles.
Time Complexity: O(n) – Single pass through the string.
Space Complexity: O(1) – Only a few variables are used, independent of input size.
Approach 2 (Reversed Traversal):

This method traverses the string from right to left.
The objective is to move all 'black' tiles ('1') to the right while keeping 'white' tiles ('0') on the left.
It counts how many 'white' tiles have been encountered, and whenever a 'black' tile is found, it adds the current number of 'white' tiles to the swap count.
Time Complexity: O(n) – Single pass through the string.
Space Complexity: O(1) – Only a few variables are used, independent of input size.

✨ 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-24Height of Binary Tree After Subtree Removal Queries |Thought Process|Leetcode 2458| codestorywithMIK
2024-10-23Remove Sub-Folders from the Filesystem | 2 Simple Approaches | Leetcode 1233 | codestorywithMIK
2024-10-22Flip Equivalent Binary Trees | Simple Recursion | Dry Run | Leetcode 951 | codestorywithMIK
2024-10-21Cousins in Binary Tree II | 2 Detailed Approaches | Dry Run | Leetcode 2641 | codestorywithMIK
2024-10-20Parsing A Boolean Expression | Cleanest Explanation | Dry Run | Leetcode 1106 | codestorywithMIK
2024-10-19Split a String Into the Max Number of Unique Substrings | Khandani Template | Dry Run |Leetcode 1593
2024-10-19Find Kth Bit in Nth Binary String | Detailed Recursion | Dry Run | Leetcode 1545 | 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