Find the index of the first occurrence in a string | Leetcode 28

Find the index of the first occurrence in a string
Leetcode problem number 28
JAVA interview programming playlist:
• Interview Programming ...
#java #interviewquestions #leetcode

[@anuragtripathi6609]

Need More of your videos ! Great Work

[@saurabhtiwari5731]

great explanation! Thanks for the help

[@MindsetMotivation75]

Thank you for this amazing explanation

[@BlendBox]

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

[@kumar_shanu]

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..

[@yxs7]

u are the best. thks! ❤👍

[@agyaani8060]

Loved it❤✨

[@sangameshwar78]

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

[@imvishu09]

really great!!

[@madhur7787]

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.

[@DevbrathBhattPujari]

Can you please explain more at timestamp 4:45 that why did you not take the whole length and just till index 7?

[@vikashgupta4775]

Thanks❤️

[@AkashSharma-lf5jq]

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

[@DevbrathBhattPujari]

Can you please explain more at timestamp 4:45 that why did you just took the string till index 7?

[@shreyasjain1509]

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

[@ayantika_paul]

This one is the best solution.

[@sagarmatha04]

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]

This solves all the test cases (y)

[@thewayofshaad4344]

just one line
return haystack.indexOf(needle);

[@arafathossain6207]

Can you solve this problem with robin carp rolling hash?

[@RishinderRana]

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

[@TharunReddy18]

Thnaks

[@sarthakbhargava3514]

Thanks

[@vasugaur1283]

Best😇 Explaination

[@codecurrents]

Perfect 💕

[@ankittripathi5796]

Thanks mam

[@AllInOne-dq9re]

nice

[@TharunReddy18]

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)

[@shanayagupta4002]

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

[@chakravarthybatna1589]

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]

Sure

[@rishabhduggar2837]

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...

[@saulcasaslorenzo2243]

Ur wrong you have to sum the i to the length of needle; if(haystack.substring(i, i+ needle.length) === needle){...}

[@harnekarora5658]

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]

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

[@harnekarora5658]

@@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

[@vikaspathak8706]

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]

Thanks Bro

[@Omneeshkushwah9695]

Please upload daily leetcode problems

[@TechnosageLearning]

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

[@sandeepnarwal8782]

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

[@whois2517]

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

[@akgpian]

It will be O(MN) right ?

[@foudilbenouci482]

(n-m) m

[@sahilbambardestudy1469]

code plz!😀

[@SanjayChandramohan-lq3wp]

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

[@knixkcodes]

Sorry didn't understand. Please decease the pace.

[@Rob-J-BJJ]

theres a replay button my brother

[@gauravkumarkalra1156]

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

[@TechnosageLearning]

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

[@Naveenkumar-p4i]

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

[@ChaudharySaab05]

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

[@hybi666]

Thanks