Substring With Largest Variance | Full Dry Run | Leetcode-2272 | AMAZON, GOOGLE | Explanation
Qns based on variation of Kadane's Algorithm :-
Qn-1 : https://practice.geeksforgeeks.org/problems/maximum-sum-rectangle2948/1
This question will help you to solve Leetcode-363(Max Sum of Rectangle No Larger Than K)
It's based on Kadane's Algo in 2-D Array
My Github Link - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/02b428345398ca09be935de3d5b9f37d9bd00e72/DP/Maximum%20Sum%20Rectangular%20Submatrix%20in%20Matrix%20dynamic%20programming(2-D%20kadane).cpp#L17
Qn-2 : Leetcode-918 (Maximum Sum Circular Subarray)
My Github Link - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/02b428345398ca09be935de3d5b9f37d9bd00e72/Arrays/Maximum%20Sum%20Circular%20Subarray.cpp#L12
Qn-3 : Max Sum of Rectangle No Larger Than K
This question is an application of "Maximum sum Rectangle in 2-D matrix (2-D Kadane's Algorithm)"
My Github Link - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/02b428345398ca09be935de3d5b9f37d9bd00e72/DP/Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K.cpp#L6
Qn-4 : Leetcode - 152 (Maximum Product Subarray)
//Smart variation of Kadane's Algorithm
My Github Link - https://github.com/MAZHARMIK/Interview_DS_Algo/blob/02b428345398ca09be935de3d5b9f37d9bd00e72/DP/Maximum%20Product%20Subarray.cpp#L6
Qn-5 : Leetcode - 53 (Maximum Subarray)
The actual classic Kadane's Algorithm
https://github.com/MAZHARMIK/Interview_DS_Algo/blob/02b428345398ca09be935de3d5b9f37d9bd00e72/Arrays/Maximum_Subarray.cpp#L64
----------------------------------------------------------------------------------------------------------------------------------
Hi everyone, this is the 16th video of our Strings playlist.
In this video we will try to solve an excellent problem and a good variation of Kadane's Algorithm “Substring With Largest Variance”.
We will write very easy and clean code with intuition building and understanding each line of code.
We will do live coding after explanation and see if we are able to pass all the test cases.
Problem Name : Substring With Largest Variance
Company Tags : AMAZON, GOOGLE
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Substring%20With%20Largest%20Variance.cpp
Leetcode Link : https://leetcode.com/problems/substring-with-largest-variance/
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
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish