Big Sorting | HackerRank
CORRECTION: Technically there is an upper limit on the number of unique sizes - there can only be as many unique sizes as the number of strings in the unsorted list. Therefore there would be at most 2 * 10^5 sizes, instead of 10^6. Not that it changes too much.
Source: https://www.hackerrank.com/challenges...
Code (Python): https://gist.github.com/Shaddyjr/45e7...
Code (JavaScript): https://gist.github.com/Shaddyjr/000a...
Intro: 0:00
Solution Walkthrough: 0:58
Code Walkthrough: 2:30
As a way to improve my coding skills and technical interview prep, I practice HackerRank problems and try my best to show in-depth solutions. This allows viewers to see my thought process and problem-solving techniques. I also delve into tutorials about building out data structures, algorithms, and various other relevant and practical topics.
I mainly code in JavaScript and Python. I also occasionally detour onto other challenges, like those from my own technical interviews, daily coding challenges, or just fun coding puzzles I come across.
Смотрите видео Big Sorting | HackerRank онлайн без регистрации, длительностью часов минут секунд в хорошем качестве. Это видео добавил пользователь Glitched Failure 31 Май 2023, не забудьте поделиться им ссылкой с друзьями и знакомыми, на нашем сайте его посмотрели 735 раз и оно понравилось 12 людям.