My Normal Life
Some notes on problems from SQL 50. https://leetcode.com/problems/average-selling-price/submissions/1424623318/?envType=study-plan-v2&envId=top-sql-50 SELECT P.product_id, IFNULL(round(sum(P.price * U.units) / sum(U.units), 2), 0) AS average_price FROM Prices AS P LEFT OUTER JOIN UnitsSold AS U ON P.
https://leetcode.com/problems/longest-happy-string/description/?envType=daily-question&envId=2024-10-16 This question requires excuting many conditions. The basic idea is: * use a min pq to allow us retrive the one with largest value * pq stores int[] in form of `(num, int that indicates the letter)' * if there are
https://leetcode.com/problems/separate-black-and-white-balls/?envType=daily-question&envId=2024-10-15 To put all zeros onto left and all ones onto right, we need to swap 0 and 1 under the condition that 1 is to the left of 0. My idea is to use 2 pointers, one starts from left
https://leetcode.com/problems/maximal-score-after-applying-k-operations/?envType=daily-question&envId=2024-10-14 We need to continuously select the largest num in the list, so Priority Queue is a good choice. We also need to keep track of index of each num in the original list, since we need to modify one after
https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/description/?envType=daily-question&envId=2024-10-13 The basic idea is to merge all the lists in num and apply window sliding on it, and it mathes perfectly. Steps: * merge all the lists into one list with elements in the form of (num, listIndex), since we
