LeetCode
1.[LeetCode] Daily LeetCode: 2160, 876
To solve this problem, all we should think is that a given number has four digits and should use a greedy method.
2.[LeetCode] Daily LeetCode: 1221
To solve this problem, we need to design this problem by using greedy algorithm.
3.[LeetCode] Daily LeetCode: 1323
We need to understand the concept and the details of this problem.
4.[LeetCode] Daily LeetCode: 2656
As always, I tried two different ways to solve this problem.
5.[LeetCode] Daily LeetCode: 485, 1295
Since this is an easy problem, I chose to iterate over the list nums without using the max() function.
6.[LeetCode] Daily LeetCode: 1827, 977
To solve this question, we need to analyze what conditions we have to derive.
7.[LeetCode] TIL LeetCode: 1089
This was not an easy question, whether it was valued as the easy question.
8.[LeetCode] TIL LeetCode: 88
There are so many ways to solve this problem, and I will go over from the very beginning to a little more complex approach.
9.[LeetCode] TIL LeetCode: 27, 26
Read the given instructions carefully. Two arguments are given: an integer array nums and an integer val.
10.[LeetCode] TIL LeetCode: 1346
The problem's concept is pretty straightforward.
11.[LeetCode] TIL LeetCode: 941
This problem is a well-known problem for people who are studying algorithms.
12.[LeetCode] TIL LeetCode: 1299, 26(review)
We aim to bring the maximum of the next numbers in the array except the current number.
13.[LeetCode] TIL LeetCode: 283, 905
There is not much complicated logic here, we will solve the same problem in two different ways to get used to in-place problems.
14.[LeetCode] TIL LeetCode: 1051, 27(review)
A simple way to solve this problem is by comparing two arrays.
15.[LeetCode] TIL LeetCode: 414
In this problem, we are going to compare the array's value and find the third biggest number.
16.[LeetCode] TIL LeetCode: 448, 977(review)
The concept is pretty straightforward, in which we have to return missing integers, where the array nums of n integers are in the range [1, n].