Solving Amazon's 2020 Most Asked Interview Question

🎧 Join the community Discord: / discord
💰 Support me on Patreon: / michaelmuinos
🔗Follow me on LinkedIn: / michael-muinos
📂Follow me on Github: github.com/Mic...
Check out my interview prep platform for learning the patterns!
📢 Interview Prep Platform: algoswithmicha...
Amazon's most asked coding question for 2020 according to the LeetCode platform was "Reorder Data in Log Files". This problem is a string based problem which in just the past 6 months has been asked at Amazon over 330 times.
For this problem, we must sort log strings based on a variety of rules. There are two types of log strings: letter logs and digit logs. Letter logs contain a unique id separated with a space to the rest of the log portion. The log portion contains only lowercase letters; however, a digit log contains only digits. The rules we must implement our comparator class by are as follows:
letter logs always come before digit logs, letter logs are sorted lexicographically, if letter logs are equal we must sort by the id lexicographically, and digit logs should maintain their order.
The time complexity for our algorithm is big oh O(N*log(N)) where N is the number of elements we have in our array. Under the hood, the array sort uses a dual pivot quick sort algorithm which is due to the use of sorting primitives. If we were not sorting primitives, the sort function would use TimSort. The space complexity is big oh O(log(N)) since quick sort must utilize recursive calls to apply sorting.
----------------------------------------------------
LAKEY INSPIRED - Blue Boi
/ lakeyinspired
/ @lakeyinspired

[@sagardafle]

Love the visual animations. This can be USP of your channel. Keep it up!!

[@leenaverma2418]

I like your video series on frequently asked question on amazon,google.. etc.. and the best part of it is you replay to everyone for there doubts..keep it up good work..

[@solomoon4784]

btw you can use string.split(" ", 2) to divide a log in to the id and the main part so you dont have to find the first occurence of a space and then use substring.

[@firstburrito]

This may exclude additional parts of the log in some languages

[@atift5465]

i may be being repetitive here but i love the visual explanations.. just saw your vids first time and subscribing! keep up the good quality content!

[@AlgosWithMichael]

I'm glad, I like doing in depth animations

[@sergten]

Great explanation. One thing to keep in mind while implementing the algorithm in a language other than Java is that returning 0 does not guarantee the stable order. One might need to research other sorting facilities to satisfy the digital logs order rule.

[@AlgosWithMichael]

Very good point

[@manojpatil7351]

Me getting more frustrated after writing a 200 line code and wasting 3 hours on this problem only to see your efficient solution and completely different approach !!! Just wow

[@Soccerguyz]

I got a similar question to this last month for my first round at Amazon. Although it was slightly different

[@pl5778]

love the new visuals during explanation. Keep up the great work!

[@AlgosWithMichael]

Thanks so much!

[@balaeinstein8710]

thanks a lot bro. Wishing your channel for rapid growth

[@AlgosWithMichael]

I appreciate that, thank you for watching!

[@z4zebraa]

Great explanation !! Im trying to figure out the -1 part can someone help return digit1 ? (digit2? 0 : 1) : -1;
-1 will be executed when digit1 is a letter log(not a digit log) then why do we want to return -1?

[@urbirooj5413]

Nice video. Keep up the good work!

[@AlgosWithMichael]

Thank you!

[@MayaBello]

your videos are seriously amazing!!! 👏🏿👏🏿👏🏿👏🏿

[@AlgosWithMichael]

Thank you so much 😀

[@MangoDrankE]

Fantastic video. Really helped understand how to use comparator

[@AlgosWithMichael]

Glad you enjoyed it!

[@yitingg7942]

Hi Michael, what I can't understand is if(isDigit1 && isDigit2) return 0; why do we return 0 if they are both digit.

[@Hadi4029]

@@joshualopes7250 ....which only works in Java. In C# it changes the ordering, for example.

[@seriouslyIamnobody]

This is gold! Keep it up!

[@AlgosWithMichael]

Thanks, will do!

[@SarveshKumar-nh3pd]

Really appreciate your work! thanks a lot!

[@AlgosWithMichael]

My pleasure!

[@Play-Date-Care]

Very clean solution!

[@AlgosWithMichael]

Thank you, I think so too :p

[@nribackpacker]

@8:44 WTF lol..BTW great solution thank you for sharing

[@AlgosWithMichael]

LOL thanks dude!

[@SunilGupta-vc8jw]

could u share the leetcode link for this problem?

[@AlgosWithMichael]

Search on LeetCode "Reorder data in log files" and you should find it

[@z41n70]

Woooooo life saver thank you

[@neetibhatt3983]

awesome Explanation....

[@AlgosWithMichael]

Glad you liked it!

[@TheTsarSniper]

thats a beautiful hat, just subscribed

[@AlgosWithMichael]

Nothing compared to that beard

[@DrJavyMartinez]

Love your work. If I paid ya, could you do a private lesson? DM me if so

[@AlgosWithMichael]

I appreciate that! I don't do private lessons currently :(