Once you said, c++ codes are available as well, can you tell me where it is, I’m stuck in middle

Congratulations for the milestone..... your videos really helps a lot

@CodeWithSunchitDudeja

Жыл бұрын

Thank you so much 😀

Love the way you explain problem & it's approach

@CodeWithSunchitDudeja

Жыл бұрын

Thanks

Hi bro, thanks for helping me get consistent! I landed an offer at Samsung R&D Institute.. Keep going 🔥

@CodeWithSunchitDudeja

Жыл бұрын

Amazing! Can we please connect over linkedin..

@prempeacefulchannel

Жыл бұрын

@@CodeWithSunchitDudeja sure, I have sent you a connection request. My name is Prem R R

Tles for a newly added testcase : s = "aaaaaaa", words = ["a","a","a",...] len(s) and len(words) and len(words[i]) = max from constraint

The credit goes to you and your hardwork bhaiya!! And congratulationssss!!!

@CodeWithSunchitDudeja

Жыл бұрын

Thanks Sanjana

Soon 1 Million .. Keep up the hard work and Consistency is Key :)

@CodeWithSunchitDudeja

Жыл бұрын

Very soon...

wonderful solution and explanation, thank you

@CodeWithSunchitDudeja

Жыл бұрын

Thanks Santosh

nice solutions

Thank you for the solution and explanation! The link to join the discord channel fails with "Unable to Accept Invite"

Keep going.... All the very best Dont forget your tagline - "The Most Consistent DSA Channel" Hoping for the best....

@CodeWithSunchitDudeja

Жыл бұрын

Thanks a ton I love the tag line

You are an amazing teacher sir ❤

@CodeWithSunchitDudeja

27 күн бұрын

Thank you! 😃

I just subscribed recently.. Your contents are great.Dont know about your recent stuff. But i hope you have a Drawing tablet now😂. It would help greatly to you and for us too. ( i dont know about others but sometime i feel like what the heck is he writting. And one more thing : try to write/draw more as you explain. Some time i just have to playback just to listen carefully what did you just said.) And lastly i m not at commenting anything negative .There is no doubt your explanation.Its good.Just try to write more.👍🏻👍🏻

@CodeWithSunchitDudeja

Жыл бұрын

I consider this as positive feedback, appreciate it

Thanks for your efforts

@CodeWithSunchitDudeja

Жыл бұрын

It's my pleasure

how to find the substring indices starting from where ? how to do that?

Thanks.

Congratulations Buddy.

@CodeWithSunchitDudeja

Жыл бұрын

Thanks for the visit

what is the complexity of this solution

Congratulations sir ♥️

@CodeWithSunchitDudeja

Жыл бұрын

Thanks @bhuwanesh

Is it an optimal solution ??

Congratulations 🎉🎉

@CodeWithSunchitDudeja

Жыл бұрын

Thanks. :)

Congratulations ❤️🎉

@CodeWithSunchitDudeja

Жыл бұрын

Thanks Aman

Nice explanation

@CodeWithSunchitDudeja

Жыл бұрын

Keep watching

top notch content

@CodeWithSunchitDudeja

Жыл бұрын

Thanks :)

congrats

Thanks

@CodeWithSunchitDudeja

Жыл бұрын

Thanks Rushikesh

s.length()-len* wali cheez smjh nhi aayi

congratulations 🥳🥳

@CodeWithSunchitDudeja

Жыл бұрын

Thank you so much 😀

consider words=['t','t','t'....] and s="ttttt..." and words.len=s.len/2 , complexity would be O(N^2) How is solution getting accepted

@deepakr4546

Жыл бұрын

I tried something similar with DFS and list instead of map(instead of frequency I just deleted the element from the list. I don't think that would make a difference as even in map its O(N) to check if all words are covered) and I got a TLE for the mentioned test case.

@santoshvarma996

Жыл бұрын

@@deepakr4546 list is o(n) but map is o(1). also think of having duplicate words, in map they are counted as one where as in list they are counted twice increasing the TC

Super bro ❤

@CodeWithSunchitDudeja

9 ай бұрын

Thanks 🤗

Subscribed 😇

@CodeWithSunchitDudeja

Жыл бұрын

Thanks Sandeep

Solution starts from 4:07

solution is ok but i guess its not optimized code, we creating map again and again

@CodeWithSunchitDudeja

Жыл бұрын

I agree we can improve it

actual video starts at 4:10

This isnt O(N) solution

Congrats.. Thanks

@hymnish_you

Жыл бұрын

Sir, you are making videos consistently since I was struggling to get a good job. Thanks a lot! Your videos are an emotion to me.

@CodeWithSunchitDudeja

Жыл бұрын

Your comments are emotion to me 💚

c++ solution : leetcode.com/problems/substring-with-concatenation-of-all-words/discuss/2423767/Most-easiest-method-sliding-window

@CodeWithSunchitDudeja

Жыл бұрын

Java here: github.com/Sunchit/Coding-Decoded/blob/master/July2021/WordLadderII.java

@AmitKumar-um8rp

Жыл бұрын

@@raunakkumar6144 use long long or long long int everywhere . It will work.

dry run s = "barfoothefoobarman", words = ["foo","bar"] 0123456789 len= 3; map={foo:1,bar:1}; i=0; i

Thanks

@CodeWithSunchitDudeja

Жыл бұрын

Welcome