String window (min window substring)

#1

not passing 2 test cases

moreover can you pls tell me the faster approach to this problem

#2

@i_am_dekard_shaw Use two pointer and maps for 0(n) solution. Or use binary search for nlogn solution.

#3


pls have a look its failing test case

#4

@i_am_dekard_shaw Let me review what have you done

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.