Minimum Window Substring (Leetcode Hard) | Hashmap Interview Questions

preview_player
Показать описание

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. Here you will learn about Minimum Window Substring problem using hashmaps and 2 pointer approach. In this question :

1. You are given two strings s1 and s2 containing lowercase english alphabets.
2. You have to find the smallest substring of s1 that contains all the characters of s2.
3. If no such substring exists, print blank string("").

Рекомендации по теме
Комментарии
Автор

sir, your explanation is damn perfect.
every time search for a coding solution, I wish I found pepcoding there.

alfiyazahra
Автор

Very Engaging and DETAILED explanation! I am naturally Extra Focused during his videos.

pranjalgusain
Автор

Sir aap great ho sir. Mene ek course lia tha, uss course ne itna confuse kar dia ki khud pe doubt hone laga.Firr aapki dekhi tab jaake samjh aane laga.Ab waha se questions dekh ke explanation ke liye pepcoding pe aata hoon

shoryasharma
Автор

I think no one can explain these tricky solutions better then you sir : )

TheProblemSolvers
Автор

Hard question and simple explaination, maza aa gya sir💯

Akshitgupta
Автор

Wow Sir !!! Mazaa hi aa gya kahin nahi mili t iski itni easy explanations .

Sir ji tussi Great ho .

ajaywadhwa
Автор

Great explanation. I was scratching my head whole day reading about this solution online.

bharathpn
Автор

"Bina baat ki cheezien acquire ho rahi hai.." :D, bhai pareshaan ho gaya kuch dhang ka acquire nahi ho raha :D.
Best way of explaining, love your videos :)

anuragagnihotri
Автор

you are the reason why i am getting interested in programming.
thank you

alonewolf
Автор

You explained this hard problem in such an easy way. Thankyou :)

shivanivishwakarma
Автор

Thank you sir, for the content🤗... But one minor correction is required...While collecting the answers, the length will be substring(j+1, i-j)....

chandankumartandi
Автор

Sir, you are the best🖤. Just understood the whole concept of the problem and approach within 6min. Great explanation

mr.k
Автор

sir you gave outstanding explanation with a simple code. love the way of your teaching
:)

shambhurajeshirke
Автор

I have seen a lot of video before landing here but you have given a very clear explanation .. great work man :)

ssr
Автор

I understood in half way you make hard question so easy.Thank you sir you are doing great job👍.

minkalchaudhary
Автор

The concept is very tricky and very useful for other problems as well. It gives a new perspective to solve a problem. Thank you :)

soumavanag
Автор

Sir, Your explanation is one of the greatest thank you so much.

saichaithrik
Автор

bhai likh ke deta hu mene phle bhi comment kia he ye pep coding just java me he isliye audience kam ho jati he wrna sach bolta hu sumeet sir jesa thought process built krke padhana rare he.code to koi bhi likh kar explain kr de par dhang se zero se smjha pana har kisi ke bas ki bat nhi h ... SALUTE SIR APKO !!!

priyanshukumawat
Автор

This question seems simple but isn't. GG on explaining it!

ankushgupta
Автор

watched till half and boom got the green tick!, thanks :-D

brijpatel
welcome to shbcf.ru