Quoc Trinh

  322. Coin Change - LeetCode You are given an integer array  coins  representing coins of different denominations and an integer  amount  representing a total amount of money. Return  the fewest number of coins that you need to make up that amount . If that amount of money cannot be made up by any combination of the coins, return  -1 . You may assume that you have an infinite number of each kind of coin. Example 1: Input: coins = [1,2,5], amount = 11 Output: 3 Explanation: 11 = 5 + 5 + 1 Example 2: Input: coins = [2], amount = 3 Output: -1 Explanation: We use dynamic programming for this problem:  First, we try to resolve the smaller problem! Suppose we have numbers type of coins = [1,2,5] We need to get minimum coins for amount 2 The smallest amount is 0 then we need 0 coin With amount 1 we need 1 coin With amount 2: For case: coin 1 < 2, mean coin 1 can be used, then 1 coin We ne...

One of my favorite built-in features in Windows OS is arranging the windows. This feature is very useful for me when implementing the front end, or do some translation stuff. Unfortunately, this feature is not available for Mac OS, we must use a window manager application.    Windows management in Windows 11 In my opinion, the best application for organizing workspace on Mac is Magnet. Magnet is paid application, it cost ~2$ and we buy it here  ‎Magnet on the Mac App Store (apple.com) Today I would like to introduce an alternative free solution is that  Rectangle (rectangleapp.com) . Rectangle App is free and very lightweight. It's also very fast. The following screenshot displays the windows positions and the corresponding shortcut in Rectangle.