Minimum Changes To Make Alternating Binary String | 2 Approaches | MICROSOFT | Leetcode 1758
174Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 15th Video of our Playlist "Leetcode Easy".
In this video we will try to solve an easy and good practice string problem - Minimum Changes To Make Alternating Binary String (Leetcode 1758).
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 Changes To Make Alternating Binary String
Company Tags : MICROSOFT
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Easy%20Tagged/Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String.cpp
Leetcode Link : https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/
My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Approach-1 Summary : The code uses two counters, start_with_0 and start_with_1, to keep track of the counts for positions starting with '0' and '1', respectively. The iteration alternates between even and odd indices, and the counters are updated accordingly based on the character at each position. Finally, the result is obtained by returning the minimum value between start_with_0 and start_with_1. The logic ensures that the alternating pattern is achieved with the fewest operations possible.
Approach-2 Summary :
The code uses a counter, start_with_0, to keep track of the count of '1' at even indices. The iteration alternates between even and odd indices, and the counter is updated based on the character at each even index. Finally, the result is obtained by returning the minimum value between start_with_0 and n - start_with_0. The logic ensures that the alternating pattern is achieved with the fewest operations possible, considering only the case where the string starts with '0'.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ 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