Minimum Window Substring | Leetcode #76

This video explains a very important and most frequently asked programming interview question which is based on sliding window. This is about finding the minimum window substring which contains all the characters with respective frequencies in the window in another string.
----------------------------------------------------------------------------------------------------------------------------------------------------------------
🟣 JOIN our 𝐋𝐈𝐕𝐄 𝐢𝐧𝐭𝐞𝐫𝐯𝐢𝐞𝐰 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 𝐩𝐫𝐨𝐠𝐫𝐚𝐦 through whatsapp query: [phone]
🟣 𝐂𝐡𝐞𝐜𝐤𝐨𝐮𝐭 𝐚𝐥𝐥 𝐨𝐮𝐫 𝐂𝐨𝐮𝐫𝐬𝐞𝐬: techdose.co.in/
🔵 LinkedIn: / surya-pratap-kahar-47b...
🔴INSTAGRAM: / surya.pratap.k
🟢 𝐓𝐞𝐜𝐡𝐝𝐨𝐬𝐞-𝟏𝟎𝟎 𝐬𝐡𝐞𝐞𝐭: docs.google.co...
---------------------------------------------------------------------------------------------------------------------------------------------------------------
𝐂𝐎𝐃𝐄 𝐋𝐈𝐍𝐊: gist.github.co...

[@tommyshelby6277]

Legend is back with reinforcements, you saved my 6.006 course

[@vignarajgnanaskanthan2462]

Time limit exceeded for 2 cases

[@AryakCbobey]

Thanks for your explanation. How is this (n+m). and how can you ignore the frequency mapper as the question doesn't ask you to ignore and for every match of the character it is invoked.

[@MohammedHasmi577]

Sir ye konsa tab and app use kr rahe ho bata skte ho?

[@VivekSharma-yl9ki]

it's not O (m+n ) , it's O(m*n)