Hongjje DevLeetcode Solution — 1404. Number of Steps to Reduce a Number in Binary Representation to OneIt is a problem of finding the number of operations that make binary digits 1 according to the rule. You can get it by using sliding…2 min read·11 hours ago----
Hongjje DevLeetcode Solution — 1208. Get Equal Substrings Within BudgetIt is a problem of finding the maximum length of a substring that meets a specific condition. It can be solved using sliding window. The…2 min read·1 day ago----
Hongjje DevLeetcode Solution — 1608. Special Array With X Elements Greater Than or Equal XIt is a problem of finding x that satisfies a specific condition. It can be solved using sorting. The time complexity is O(nlogn).1 min read·2 days ago----
Hongjje DevLeetcode Solution — 552. Student Attendance Record IIIt is a matter of finding the number of all cases. It can be solved using dynamic programming. The time complexity is O(n).2 min read·4 days ago----
Hongjje DevLeetcode Solution — 140. Word Break IIIt’s a matter of finding all the strings that can be made out of words in the dictionary. It can be solved using backtracking. The time…2 min read·4 days ago----
Hongjje DevLeetcode Solution — 78. SubsetsIt’s a matter of getting all subsets. You can solve it by using the bit. The time complexity is O(2^n).1 min read·May 21, 2024----
Hongjje DevLeetcode Solution — 1863. Sum of All Subset XOR TotalsIt is a problem of finding the sum of XORs of all subsets. It can be solved with backtracking. The time complexity is O(2^n).1 min read·May 20, 2024----
Hongjje DevLeetcode Solution — 2331. Evaluate Boolean Binary TreeIt is a problem of finding the result value when the operation is completed on the binary tree. You can calculate it using DFS. The time…1 min read·May 16, 2024----
Hongjje DevLeetcode Solution — 2812. Find the Safest Path in a GridIt’s a matter of finding a path that is as far away as possible from the thief. It can be solved using priority_queue. The time complexity…2 min read·May 15, 2024----
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·May 13, 2024----