Path Crossing | Leetcode 1496
155Whatsapp Community Link : https://www.whatsapp.com/channel/0029Va6kVSjICVfiVdsHgi1A
This is the 14th Video of our Playlist "Leetcode Easy".
In this video we will try to solve an easy and good practice string problem - Path Crossing (Leetcode 1496).
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 : Path Crossing
Company Tags : AMAZON
My solutions on Github(C++ & JAVA) : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/HashSet/Leetcode%20Easy/Path%20Crossing.cpp
Leetcode Link : https://leetcode.com/problems/path-crossing/
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 utilizes an unordered set (unordered_set of string) to store visited coordinates in the form of strings, where each coordinate is represented as "x_y". The method initializes the starting coordinates (x=0, y=0) and inserts the initial coordinate into the set. It then iterates through each character in the input path, updating the coordinates based on the direction (E, W, N, S), and checks if the new coordinate has been visited before. If a visited coordinate is encountered, the method returns true, indicating that a crossing has occurred. Otherwise, it adds the current coordinate to the set. If the iteration completes without finding a crossing, the method returns false. Overall, the algorithm keeps track of visited coordinates using a set and checks for crossings during the traversal of the given path.
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
✨ 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