Asteroid Collision | Intuition | Dry Run | Leetcode-735 | Uber | Lyft | Explanation ➕ Live Coding

Subscribers:
92,300
Published on ● Video Link: https://www.youtube.com/watch?v=7isfomHzzno



Duration: 20:54
2,077 views
116


Hi everyone, this is the 12th video of our Stack playlist.
In this video we will try to solve a very good and famous stack problem "Asteroid Collision". (Leetcode-735)

We will write very easy and clean code with intuition building and understanding each line of code.
We will do live coding after explanation and see if we are able to pass all the test cases.


Problem Name : Asteroid Collision
Company Tags : Uber, Lyft
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Stack/Asteroid%20Collision.cpp
Leetcode Link : https://leetcode.com/problems/asteroid-collision/


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

╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝

#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish




Other Videos By codestorywithMIK


2023-07-27No One Can Fu***ng Stop You 🔥🔥🔥 #coding #motivation #hardwork #reels #youtubeshorts #dontgiveup
2023-07-27Maximum Running Time of N Computers | Binary Search | INTUITION | Dry Run | GOOGLE | Leetcode-2141
2023-07-25Minimum Speed to Arrive on Time | Binary Search | INTUITION | Online Assessment | Leetcode-1870
2023-07-24Peak Index in a Mountain Array | Binary Search | DRY RUN | GOOGLE | Leetcode-852
2023-07-24Thank you from the bottom of my heart ❤️ #consistency #bonding #friends #friendship #trust
2023-07-23Pow(x, n) | Reasoning | Dry Run | LINKEDIN | AMAZON | Leetcode-50 | Live Code + Explanation
2023-07-23All Possible Full Binary Trees | Recursion Tree | Memoization | GOOGLE | AMAZON | Leetcode-894
2023-07-21Knight Probability in Chessboard | Recursion | Memoization | AMAZON | DIRECTi | Leetcode-688
2023-07-21Strongly Connected Components | Kosaraju's Algorithm | Intuition | AMAZON | Graph Concepts & Qns- 38
2023-07-21Number of Longest Increasing Subsequence | Using LIS | Full Dry Run | META | Leetcode-673
2023-07-20Asteroid Collision | Intuition | Dry Run | Leetcode-735 | Uber | Lyft | Explanation ➕ Live Coding
2023-07-19Min Cost to Connect All Points | Kruskal's Algorithm | Graph Concepts & Qns - 37 | Leetcode-1584
2023-07-18Non-overlapping Intervals | 2 Approaches | Intuition | Dry Run | Leetcode-435 | GOOGLE | Explanation
2023-07-18Kruskal's Algorithm | Minimum Spanning Tree | Full Dry Run | INTUITION | Graph Concepts & Qns - 36
2023-07-18Thank you for the Trust - 6000 Subscribers #coding #leetcode #interviewpreparation #intuition
2023-07-17Maximum Alternating Subsequence Sum | BOTTOM UP | INTUITION | DP Concepts & Qns - 10 | Leetcode-1911
2023-07-16Add Two Numbers II | Follow Up Qn Also | 2 Approaches | AMAZON | MICROSOFT | Leetcode-445
2023-07-16Min Cost to Connect All Points | Prim's Algorithm | META | Graph Concepts & Qns - 35 | Leetcode-1584
2023-07-16Smallest Sufficient Team | Recur + Memo | Bit Manipulation Made Easy | AMAZON | Leetcode-1125
2023-07-15Maximum Number of Events That Can Be Attended II | Recur + Memo | 2 Ways | AMAZON | Leetcode-1751
2023-07-14Consistency is the 🔑 #consistency #motivation #motivational #coding #leetcode #reels #youtubeshorts