Count number of substrings | gfg potd today | POTD | GFG Problem of the Day | C++ |@CodeThurst

[@CodeThurst]

Solution link:- github.com/Vishal-Ansari/LeetCode-Repo/blob/master/Count%20number%20of%20substrings.cpp

[@viholvishwassinh1709]

gfg ke video se kafi accha tha but you can explain more like if we want to find for exactly k = 3 distinct char then we first calculate atmost k means for 1,2 and 3 then we can find for k-1 means 2 means for 1,2 then substrack(1,2,3-1,2) remaining 3 which is k

[@CodeThurst]

okay bro thanks for suggestions

[@146_shashanks4]

Excellent Explanation bro😊

[@CodeThurst]

thnks alot brother... thnks for the motivation😊🥰

[@aishwaryatatiwar5183]

Very nice explanation 👏

[@CodeThurst]

thanks😊

[@nishant4595]

thanks bro great explanation

[@CodeThurst]

thnks brother

[@yashwardhansrivastava54]

bhai ek no.

[@CodeThurst]

thnks brother😊

[@Santosh_1979-y]

nice explanation bro

[@CodeThurst]

thnks brother for motivation

[@DSAbyraj1729]

sir ..why we getting TLE when using the unordered _maps

[@CodeThurst]

actually in that i was calculating map size again in each iteration that's why getting tle but while using vector i used only a cnt

[@DSAbyraj1729]

@@CodeThurst okay sir ..but size() function time complexity is o(1).right??.soo it is not big problem

[@CodeThurst]

@@DSAbyraj1729 noo its not O(1) it will be the same as the size of the map or vector thats why its recommended always to count the length or size of any data structure before getting into the loop

[@VaibhavBhardwaj-so9ye]

@@CodeThurst long long int f (string s, int k) { if(k==0) return 0; unordered_mapmp; long long ans=0; int ndistelem=0; //distinct elements in window int l=0,r=0; while(rk) { mp[s[l]]--; if(mp[s[l]]

[@DSAbyraj1729]

@@CodeThurst okay sir thank you