Determine if Two Strings Are Close (Google,Microsoft,Atlassian…) : Explanation➕Live Coding

Channel:

codestorywithMIK

Subscribers:

92,300

Published on December 2, 2022 5:39:14 AM ● Video Link: https://www.youtube.com/watch?v=KbdCp4nUDiQ

Duration: 24:23

709 views

50

This is the 9th Video on our Strings Playlist.
In this video we will try to solve the Problem "Determine if Two Strings Are Close".

Generally people don't explain the intuition behind this solution, but I made sure to add the intuition to my video.Please watch and enjoy.
We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Determine if Two Strings Are Close
Company Tags : Google, Microsoft, Atlassian, Morgan Stanely, Adobe, Uber
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/strings/Determine%20if%20Two%20Strings%20Are%20Close.cpp
Leetcode Link : https://leetcode.com/problems/determine-if-two-strings-are-close/


My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/channel/UCaw58edcO3ZqMw76Bvs0kGQ

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish