Hongjje DevLeetcode Solution — 861. Score After Flipping MatrixIt is a problem of creating a maximum value by flip operation. If you understand greedy, you can solve it easily. The time complexity is…2 min read·20 hours ago----
Hongjje DevLeetcode Solution — 2473. Minimum Cost to Buy ApplesThis is the problem of finding the least cost when purchasing apples in each city. It can be solved using Dijkstra. The time complexity is…2 min read·1 day ago----
Hongjje DevLeetcode Solution — 2373. Largest Local Values in a MatrixIt is a problem of making max the selected matrix in 3x3. We used the offset principle as a simple problem. The time complexity is O(n²).1 min read·2 days ago----
Hongjje DevLeetcode Solution — 3075. Maximize Happiness of Selected ChildrenIt is the biggest issue of distributing happiness to k children. You just have to sort and choose the one with the larger value. The time…1 min read·5 days ago----
Hongjje DevLeetcode Solution — 506. Relative RanksIt is a matter of ranking in order of the score. You can sort it out and tie it in order. The time complexity is O(n).1 min read·5 days ago----
Hongjje DevLeetcode Solution — 2816. Double a Number Represented as a Linked ListIt is a matter of doubling the number expressed as a linked list. It can be multiplied using stack. The time complexity is O(n).1 min read·6 days ago----
Hongjje DevLeetcode Solution — 2487. Remove Nodes From Linked ListIt is a problem that leaves only a large number on the Linked List. It can be easily solved using the monotonic stack. The time complexity…2 min read·May 6, 2024----
Hongjje DevLeetcode Solution — 1885. Count Pairs in Two ArraysIt is a problem of finding all numbers with pairs greater than or equal to 0. It can be solved using sorting and two pointers. The time…2 min read·May 5, 2024----
Hongjje DevLeetcode Solution — 237. Delete Node in a Linked ListIt is a problem of deleting nodes without being given a head in the linked list. You can solve it with the idea of shifting. The time…1 min read·May 5, 2024----
Hongjje DevLeetcode Solution — 881. Boats to Save PeopleIt is a matter of finding the minimum that satisfies the condition. It can be solved by using two pointers as a greedy problem. The time…1 min read·May 4, 2024----