The color is nice, however, it will be even better if we do not have the border color. Such as following:

2762. Continuous Subarrays 2762. Continuous Subarrays It was the 3rd question of the weekly 352 code competition of LC . The key trick is finding the min/max value in a sliding window. I had a previous post Sliding window min/max, priority queue & Monotonic Queue. Multiset This has the time complexity…

2719. Count of Integers This is the 4th hard question of the LC 348 weekly contest question. 2719. Count of Integers Explanation If we can change the problem to the following, it will be easier: _count(num, min_sum, max_sum) = number of numbers in [0, num] whose digit sum is in [min_sum…

A super nice blog Large Transformer Model Inference Optimization is a super nice blog written by Lilian. Must read if you are interested in this topic. I was planning to write a similar one, however, when I saw this blog, I gave up.

Certainly! Here are some advanced Vim tips that can enhance your productivity and efficiency: 1. Marks and Jumps: — Use lowercase marks (`ma`, `mb`, etc.) to bookmark locations within a file. Jump to a mark with ```a` (backtick + mark) or `a’` (single quote + mark). — Use uppercase marks…

In this article, I’d like to put some interesting open source LLM code links. From the star number change, we can have some interesting observations: Llama-cpp is more popular than the original Llama. Does this mean quite many people are checking the possibility of local deployment of the llama model…

Last year, I planted some water melon at my backyard. It was surprisingly success as I can wait until the water melon if fully ripe. In this article, I’d like to record this process for this year in case anyone wants to have a try. April 13, 2023 11:20 pm Put the seed into a…

2642. Design Graph With Shortest Path Calculator Floyd–Warshall This is the 4th question of today (April 15, 2023) ’s biweekly LC contest. We can use Floyd–Warshall algorithm to solve this problem as n is small which is only 100. Python class Graph: def __init__(self, n: int, edges: List[List[int]])…

2218. Maximum Value of K Coins From Piles — This problem is very similar to the 0–1 Knapsack problem. 0–1 Knapsack For each item, we can pick up 0 or 1 This one Define each pile, we can pick up 0, 1, ..., m where m is total number of item in this pile. Code int INF = 0x3f3f3f3f; class Solution { public…