Very useful content for Learning please subscribe and like share guys ❤😊😊

Need More of your videos ! Great Work

Thank you for this amazing explanation

great explanation! Thanks for the help

Hey, Thank you so much for now, I solve the problem of LeetCode, nice explanation 😊

class Solution { public int strStr(String haystack, String needle) { if (haystack.contains(needle)) { return haystack.indexOf(needle); } else { return -1; } } }

@ayantika_paul

7 ай бұрын

This one is the best solution.

@sagarmatha04

5 ай бұрын

indexOf already returns -1 if it doesnt find match. So you can jsut do this. public int strStr(String haystack, String needle) { return haystack.indexOf(needle); }

@yashasks1749

4 ай бұрын

This solves all the test cases (y)

@thewayofshaad4344

24 күн бұрын

just one line return haystack.indexOf(needle);

You are doing a great job, keep it up, but its a request please try to include the most efficient approach, like KMP algorithm thats required here with space and time complexity.

@TechnosageLearning

Жыл бұрын

Sure..Thanks for your suggestion..Will make a separate video on that approach as well..

This isn't an efficient solution. The complexity can be reduced to O(m + n) using KMP. Giving this answer may not fail you in the interview though but will not get you the best score either.

@TechnosageLearning

Жыл бұрын

Hello, Thankyou for the feedback. There are multiple ways to solve a problem, the aim is to get through the problem and to make everyone familiarize with an easy approach. Not every approach can be discussed or target a specific need.

@yashagrawal1663

Жыл бұрын

True

u are the best. thks! ❤👍

very easy and helpful but Mam its time is O(m*n).Is there any other method in JS for O(m+n)?

really great!!

Loved it❤✨

Thanks❤️

Thanks

this code will fail for the following input: haystack="hello" and needle = "ll" if we do needle.length+1 then (i,needle.length)+1 will not give the correct substring as it will go from (2,5) it will include the last character as well "llo" which will result in wrong output please correct me if i am wrong...

smooth explanation it would be helpelful if you can discuss time and space complexity with the approach.

@TechnosageLearning

Жыл бұрын

Thanks for the suggestion ! Will definitely start discussing space and time complexity in the upcoming videos.

Thnaks

Can you solve this problem with robin carp rolling hash?

Best😇 Explaination

Perfect 💕

this is of O(mn) complexity , any other optimized solution?

@TechnosageLearning

Жыл бұрын

Alternatively you can use JAVA method indexOf to reduce the time complexity to O(n)

Thanks mam

same approach i used in leetcode but it will give TLE for sure

@TechnosageLearning

Жыл бұрын

No..it is not giving TLE..it is accepted solution..Please try it out..Alternatively..you can use "indexOf" function to solve this problem..Will upload the new video soon using indexOf function

@shanayagupta4002

Жыл бұрын

@@TechnosageLearning okay thank you, please also tell time complexity and space complexity in solution video, thank you and ma'am here's a suggestion please try to makes makes on leetcode daily challenges.

@TechnosageLearning

Жыл бұрын

I have started discussing complexities in recent videos..Thanks for the suggestion..Will definitely consider it

nice

class Solution { public int strStr(String haystack, String needle) { return haystack.indexOf(needle); } } single line code for this problem

@TechnosageLearning

Жыл бұрын

Yes..That is also one of the approach to solve this problem...will make a separate video on that

@SAHIL-ud1gk

10 ай бұрын

Thanks Bro

Hey can anyone explain me how does "sad" comes at 0th index of "sadbutsad" word? Thanks

@whois2517

10 ай бұрын

it starts from 0 ,1 then till n so in case of sad - s=0, a=1,d=2

you are doing great work but please try to come up with at least 2 approaches like one will be brute force and other will be the optimal solution

@TechnosageLearning

10 ай бұрын

Sure

Please upload daily leetcode problems

@TechnosageLearning

Жыл бұрын

Hello Avneesh, We are trying our best. Please stay connected 🙏

here's a single word 0ms code for it class Solution { public int strStr(String haystack, String needle) { return haystack.indexOf(needle); } }

Explanation was nice but can we use methods like .charAt() , .substring() or .indexOf() in leetcode ?? Did you try entering this solution in leetcode . It doesn't work

@TechnosageLearning

9 ай бұрын

I have another video on using indexOf() to solve this problem..Please check that..It's submitting and working in leetcode successfully

@harnekarora5658

9 ай бұрын

@@TechnosageLearning ok I'll do but don't know why leetcode didn't except.indexof() even before seeing your solution I tried that method and it's the simplest one line solution but leetcode didn't allow it

It will be O(MN) right ?

@foudilbenouci482

Ай бұрын

(n-m) m

code plz!😀

This logic fails when haystack.length is less than needle's

Sorry didn't understand. Please decease the pace.

@Rob-J-BJJ

Жыл бұрын

theres a replay button my brother

This solution will get failed if haystack ="mississippi" needle ="issip"

@TechnosageLearning

10 ай бұрын

Hi..It will not fail..it will return the index as 4...Please try

Superb dear, fully mind-blowing approach!! @technosage

Thanks