Sort Colors- (Adobe, Amazon, Flipkart.....) : Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»

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



Duration: 14:08
120 views
20


In this video we will try to solve a very good Qn β€œDiagonal Traverse”.
It has been asked in Google and Amazon and we will see a very generalised and tricky approach to solve this Qn.

Note that this technique will help you to solve another leetcode Qn : Leetcode-1329 (Sort the Matrix Diagonally)

We will do live coding after explanation and see if we are able to pass all the test cases.

Problem Name : Diagonal Traverse

Company Tags : Adobe, Amazon, Hike, MakeMyTrip, MAQ Software, Microsoft, Morgan Stanley, Ola Cabs,
OYO Rooms, Paytm, Qualcomm, Samsung, SAP Labs, Snapdeal, Walmart, Yatra.com, Flipkart

My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/Arrays/Sort%20Colors.cpp
Leetcode Link : https://leetcode.com/problems/sort-colors/
Similar GfG Link : https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s4231/1?page=1&difficulty[]=-2&difficulty[]=-1&difficulty[]=0&curated[]=1&sortBy=submissions


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
#interviewpreparation #interview_ds_algo #hinglish




Other Videos By codestorywithMIK


2022-09-20Design A URL Shortener (Part-VIII): STEP-3 : DESIGN DEEP DIVE (HASH + COLLISION RESOLUTION) πŸ—βš™οΈπŸ‘·
2022-09-18Design A URL Shortener (Part-VII): STEP-3 : DESIGN DEEP DIVE (HASH FUNCTION) !!! πŸ—βš™οΈπŸ‘·
2022-09-17Binary Tree Pruning (O(n))- (Google, Amazon, Microsoft) : Explanation + Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-09-17Binary Tree Pruning (O(n^2)) -(Google, Amazon, Microsoft) : Explanation + Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-09-15Find Original Array From Doubled Array-(Google, Amazon…): Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-09-14Boats to Save People - (Google) : Greedy Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-09-12Bag of Tokens - (Google) : Greedy Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-09-11Design A URL Shortener (Part-VI): STEP-3 : DESIGN DEEP DIVE (DATA MODEL) !!! πŸ—βš™οΈπŸ‘·
2022-09-10Minimum Size Subarray Sum-(Google, Accolite, Amazon..):Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-09-05Design A URL Shortener (Part-V): STEP-2 : URL SHORTENING (HASH FUNCTION) !!! πŸ—βš™οΈπŸ‘·
2022-09-04Sort Colors- (Adobe, Amazon, Flipkart.....) : Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-09-02Search in Rotated Sorted Array-(Google, Amazon, Microsoft....🀩):Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-09-01Design A URL Shortener (Part-IV): STEP-2 : 301 Redirect Vs 302 Redirect Status Code !!! πŸ—βš™οΈπŸ‘·
2022-08-30Design A URL Shortener (Part-III): STEP-2 : Propose High Level Design & Get Buy-In !!! πŸ—βš™οΈπŸ‘·
2022-08-28Diagonal Traverse - (Google, Amazon) : Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-08-28Sort the Matrix Diagonally - (MICROSOFT) : Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-08-27Design A URL Shortener (Part-II): Back Of The Envelope Estimation !!! πŸ—βš™οΈπŸ‘·
2022-08-26Design A URL Shortener (Part-I): Step-1 (Understand The Problem & Establish Design Scope) !!! πŸ—βš™οΈπŸ‘·
2022-08-25Group Anagrams (without sorting) - (Google,Amazon,Apple.) : Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-08-24Group Anagrams (using sorting) - (Google,Amazon,Apple...) : Explanation βž• Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»
2022-08-22Find the Rotation Count in Rotated Sorted array-(Amazon, Flipkart, ABCO):Live Coding πŸ§‘πŸ»β€πŸ’»πŸ‘©πŸ»β€πŸ’»