Find Beautiful Indices in the Given Array | Part I | Part II | Same Code | KMP | Weekly Contest 380
126Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 33rd Video of our Playlist "Strings : Popular Interview Problems".
In this video we will try to solve two very good string problems based on KMP -
Find Beautiful Indices in the Given Array I (Leetcode 3006)
Find Beautiful Indices in the Given Array II (Leetcode 3008)
I will explain the intuition so easily that you will never forget and start seeing this as cakewalk EASYYY.
We will do live coding after explanation and see if we are able to pass all the test cases.
Also, please note that my Github solution link below contains both C++ as well as JAVA code.
Problem Name : Find Beautiful Indices in the Given Array I (Leetcode 3006) | Find Beautiful Indices in the Given Array II (Leetcode 3008)
Company Tags : will soon update
My solutions on Github(C++ & JAVA) :
Part-I : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I.cpp
Part-II : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20II.cpp
Leetcode Link :
- https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i/
- https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-ii/
My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK
Approach Summary : The approach involves applying KMP for both string a and b on s and finding the occurrences in two separate vector i_indices and j_indices.
Now, Pick i from i_indices one by one and check for j in j_indices which satisfies |i-j| less than equal to k. You can optimally do it using lower bound.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ Timelines✨
00:00 - Introduction
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge#leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview#interviewtips #interviewpreparation #interview_ds_algo #hinglish #github #design #data #google #video #instagram #facebook #leetcode #computerscience #leetcodesolutions #leetcodequestionandanswers #code #learning #dsalgo #dsa #2024 #newyear