#cpp
Read more stories on Hashnode
Articles with this tag
txt -> length N (string s) pat -> length M (pattern) N>=M //To calculate hash from previous hash // hash( txt[s+1 .. s+m] ) = ( d (...
📌 Find Function //For Maps map<int,int>mp; mp.insert({2,3}); mp.insert({1,5}); if(mp.find(2) != mp.end()) cout<<mp.find(2)->second; //Output =...
