Count Complete Substrings | Sliding Window | Weekly Contest 374 | Leetcode-2953
76Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 14th Video of our Sliding Window Playlist.
In this video we will try to solve an amazing Sliding Window problem - Count Complete Substrings (Leetcode -2953).
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 : Count Complete Substrings
Company Tags : will soon update
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Sliding%20Window/Count%20Complete%20Substrings.cpp
Leetcode Link : https://leetcode.com/problems/count-complete-substrings/description/
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 Summary : The overall goal of the code is to count the number of complete substrings in a given string word such that each character in the substring occurs exactly k times. The counting is subject to two conditions :
The substring must satisfy a certain condition, implemented in the solve method, which involves counting the occurrences of characters in sliding windows of varying sizes within the given range [start, end].
The substrings are considered complete if they satisfy both the condition from the solve method and another condition checked in the countCompleteSubstrings method. This additional condition involves checking if the absolute difference between consecutive characters in the string is greater than 2.
The countCompleteSubstrings method iterates through the characters of the input string word and calls the solvemethod for each segment of the string that satisfies the second condition. The results are accumulated, and the total count of valid complete substrings is returned.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ 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