I'll keep updating for full summary and better solutions. For more problem solutions, you can see my LintCode, GoogleKickStart, GoogleCodeJamIO repositories. For more challenging problem solutions, you can also see my GoogleCodeJam, MetaHackerCup repositories. Hope you enjoy the journey of ...
I'll keep updating for full summary and better solutions. For more problem solutions, you can see my LintCode, GoogleKickStart, GoogleCodeJamIO repositories. For more challenging problem solutions, you can also see my GoogleCodeJam, MetaHackerCup repositories. Hope you enjoy the journey of ...
LeetCode 1366 Rank Teams by Votes Medium We have at most votes[0].length() rounds and it is less than 26. So we can use a 26 * 26 array to record the votes each letter gets in each round. Then we can use this array to sort the original character set.Greedy...
178 178.Rank_Scores Sql Notes 179 179.Largest_Number Java Python C++ Coming soon 180 180.Consecutive_Numbers Sql Notes 181 181.Employees_Earning_More_Than_Thei... Sql Coming soon 182 182.Duplicate_Emails Sql Coming soon 183 183.Customers_Who_Never_Order Sql Notes 184 184.Department_Highest...
1331 Rank Transform of an Array C++ Python O(nlogn) O(n) Easy 1333 Filter Restaurants by Vegan-Friendly, Price and Distance C++ Python O(rlogr) O(r) Medium Sort 1337 The K Weakest Rows in a Matrix C++ Python O(m * n) O(k) Easy OrderedDict, Quick Select 1343 Number of Sub-ar...
1331 Rank Transform of an Array C++ Python O(nlogn) O(n) Easy 1333 Filter Restaurants by Vegan-Friendly, Price and Distance C++ Python O(rlogr) O(r) Medium Sort 1337 The K Weakest Rows in a Matrix C++ Python O(m * n) O(k) Easy OrderedDict, Quick Select 1343 Number of Sub-ar...
1331 Rank Transform of an Array C++ Python O(nlogn) O(n) Easy 1333 Filter Restaurants by Vegan-Friendly, Price and Distance C++ Python O(rlogr) O(r) Medium Sort 1337 The K Weakest Rows in a Matrix C++ Python O(m * n) O(k) Easy OrderedDict, Quick Select 1343 Number of Sub-ar...