Find the Index of First Occurrence in a String - LeetCode 28 - JavaScript

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


Step by step walk through of the solution to the popular Amazon coding interview question, Find the Index of First Occurrence in a String.

After reviewing time complexity is more like O((n - m + 1) * m), where n is the length of the haystack and m is the length of the needle.

LeetCode 28

JavaScript

0:00 Intro
0:35 Explanation
2:34 Code

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

most elegant solution and explanation, the lc editorial for this problem is pure madness, thank you so much!

kazmuz
Автор

Your explanation are always good. Thanks for making me feel like a great developer 😅

kareemlateefyomi