kkyy/lc-go
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

update problem set

Browse source
This commit is contained in:
Yiyang Kang 2026-03-27 12:46:40 +09:00
parent efc7e67367
commit 42ae7148e2
Signed by: kkyy
SSH key fingerprint: SHA256:lJSbAzC3MvrSORdvIVK6h/3g+rVKJNzM7zq0MgA9WKY
1 changed files with 10 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

15
problemset.jsonl
View file

@ -3360,13 +3360,13 @@
{"id":3639,"frontendId":3355,"title":"Zero Array Transformation I","titleSlug":"zero-array-transformation-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","prefix-sum"]}
{"id":3640,"frontendId":3347,"title":"Maximum Frequency of an Element After Performing Operations II","titleSlug":"maximum-frequency-of-an-element-after-performing-operations-ii","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","sliding-window","sorting","prefix-sum"]}
{"id":3642,"frontendId":3322,"title":"Premier League Table Ranking III","titleSlug":"premier-league-table-ranking-iii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
{"id":3643,"frontendId":3356,"title":"Zero Array Transformation II","titleSlug":"zero-array-transformation-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","binary-search","prefix-sum"]}
{"id":3643,"frontendId":3356,"title":"Zero Array Transformation II","titleSlug":"zero-array-transformation-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","prefix-sum"]}
{"id":3644,"frontendId":3364,"title":"Minimum Positive Sum Subarray ","titleSlug":"minimum-positive-sum-subarray","difficulty":"EASY","paidOnly":false,"tags":["array","sliding-window","prefix-sum"]}
{"id":3645,"frontendId":3373,"title":"Maximize the Number of Target Nodes After Connecting Trees II","titleSlug":"maximize-the-number-of-target-nodes-after-connecting-trees-ii","difficulty":"HARD","paidOnly":false,"tags":["tree","depth-first-search","breadth-first-search"]}
{"id":3646,"frontendId":3351,"title":"Sum of Good Subsequences","titleSlug":"sum-of-good-subsequences","difficulty":"HARD","paidOnly":false,"tags":["array","hash-table","dynamic-programming"]}
{"id":3647,"frontendId":3362,"title":"Zero Array Transformation III","titleSlug":"zero-array-transformation-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy","sorting","heap-priority-queue","prefix-sum"]}
{"id":3647,"frontendId":3362,"title":"Zero Array Transformation III","titleSlug":"zero-array-transformation-iii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","greedy","sorting","heap-priority-queue","prefix-sum"]}
{"id":3648,"frontendId":3363,"title":"Find the Maximum Number of Fruits Collected","titleSlug":"find-the-maximum-number-of-fruits-collected","difficulty":"HARD","paidOnly":false,"tags":["array","dynamic-programming","matrix"]}
{"id":3649,"frontendId":3376,"title":"Minimum Time to Break Locks I","titleSlug":"minimum-time-to-break-locks-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","depth-first-search","bitmask"]}
{"id":3649,"frontendId":3376,"title":"Minimum Time to Break Locks I","titleSlug":"minimum-time-to-break-locks-i","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","backtracking","bit-manipulation","breadth-first-search","bitmask"]}
{"id":3650,"frontendId":3328,"title":"Find Cities in Each State II","titleSlug":"find-cities-in-each-state-ii","difficulty":"MEDIUM","paidOnly":true,"tags":["database"]}
{"id":3651,"frontendId":3379,"title":"Transformed Array","titleSlug":"transformed-array","difficulty":"EASY","paidOnly":false,"tags":["array","simulation"]}
{"id":3652,"frontendId":3359,"title":"Find Sorted Submatrices With Maximum Element at Most K","titleSlug":"find-sorted-submatrices-with-maximum-element-at-most-k","difficulty":"HARD","paidOnly":true,"tags":["array","stack","matrix","monotonic-stack"]}
@ -3397,7 +3397,7 @@
{"id":3690,"frontendId":3398,"title":"Smallest Substring With Identical Characters I","titleSlug":"smallest-substring-with-identical-characters-i","difficulty":"HARD","paidOnly":false,"tags":["array","binary-search","enumeration"]}
{"id":3691,"frontendId":3402,"title":"Minimum Operations to Make Columns Strictly Increasing","titleSlug":"minimum-operations-to-make-columns-strictly-increasing","difficulty":"EASY","paidOnly":false,"tags":["array","greedy","matrix"]}
{"id":3692,"frontendId":3455,"title":"Shortest Matching Substring","titleSlug":"shortest-matching-substring","difficulty":"HARD","paidOnly":false,"tags":["two-pointers","string","binary-search","string-matching"]}
{"id":3693,"frontendId":3385,"title":"Minimum Time to Break Locks II","titleSlug":"minimum-time-to-break-locks-ii","difficulty":"HARD","paidOnly":true,"tags":["array","depth-first-search","graph"]}
{"id":3693,"frontendId":3385,"title":"Minimum Time to Break Locks II","titleSlug":"minimum-time-to-break-locks-ii","difficulty":"HARD","paidOnly":true,"tags":["array","breadth-first-search","graph"]}
{"id":3694,"frontendId":3353,"title":"Minimum Total Operations","titleSlug":"minimum-total-operations","difficulty":"EASY","paidOnly":true,"tags":["array"]}
{"id":3695,"frontendId":3358,"title":"Books with NULL Ratings","titleSlug":"books-with-null-ratings","difficulty":"EASY","paidOnly":true,"tags":["database"]}
{"id":3696,"frontendId":3448,"title":"Count Substrings Divisible By Last Digit","titleSlug":"count-substrings-divisible-by-last-digit","difficulty":"HARD","paidOnly":false,"tags":["string","dynamic-programming"]}
@ -3757,6 +3757,7 @@
{"id":4090,"frontendId":3746,"title":"Minimum String Length After Balanced Removals","titleSlug":"minimum-string-length-after-balanced-removals","difficulty":"MEDIUM","paidOnly":false,"tags":["string","stack","counting"]}
{"id":4091,"frontendId":3705,"title":"Find Golden Hour Customers","titleSlug":"find-golden-hour-customers","difficulty":"MEDIUM","paidOnly":false,"tags":[]}
{"id":4095,"frontendId":3791,"title":"Number of Balanced Integers in a Range","titleSlug":"number-of-balanced-integers-in-a-range","difficulty":"HARD","paidOnly":false,"tags":["dynamic-programming"]}
{"id":4097,"frontendId":3877,"title":"Minimum Removals to Achieve Target XOR","titleSlug":"minimum-removals-to-achieve-target-xor","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming","bit-manipulation"]}
{"id":4098,"frontendId":3738,"title":"Longest Non-Decreasing Subarray After Replacing at Most One Element","titleSlug":"longest-non-decreasing-subarray-after-replacing-at-most-one-element","difficulty":"MEDIUM","paidOnly":false,"tags":["array","dynamic-programming"]}
{"id":4099,"frontendId":3766,"title":"Minimum Operations to Make Binary Palindrome","titleSlug":"minimum-operations-to-make-binary-palindrome","difficulty":"MEDIUM","paidOnly":false,"tags":["array","two-pointers","binary-search","bit-manipulation"]}
{"id":4100,"frontendId":3765,"title":"Complete Prime Number","titleSlug":"complete-prime-number","difficulty":"MEDIUM","paidOnly":false,"tags":["math","enumeration","number-theory"]}
@ -3849,9 +3850,11 @@
{"id":4214,"frontendId":3833,"title":"Count Dominant Indices","titleSlug":"count-dominant-indices","difficulty":"EASY","paidOnly":false,"tags":["array","enumeration"]}
{"id":4216,"frontendId":3838,"title":"Weighted Word Mapping","titleSlug":"weighted-word-mapping","difficulty":"EASY","paidOnly":false,"tags":["array","string","simulation"]}
{"id":4217,"frontendId":3843,"title":"First Element with Unique Frequency","titleSlug":"first-element-with-unique-frequency","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","counting"]}
{"id":4218,"frontendId":3879,"title":"Maximum Distinct Path Sum in a Binary Tree","titleSlug":"maximum-distinct-path-sum-in-a-binary-tree","difficulty":"MEDIUM","paidOnly":true,"tags":["hash-table","tree","depth-first-search","binary-tree"]}
{"id":4219,"frontendId":3854,"title":"Minimum Operations to Make Array Parity Alternating","titleSlug":"minimum-operations-to-make-array-parity-alternating","difficulty":"MEDIUM","paidOnly":false,"tags":["array","greedy"]}
{"id":4220,"frontendId":3863,"title":"Minimum Operations to Sort a String","titleSlug":"minimum-operations-to-sort-a-string","difficulty":"MEDIUM","paidOnly":false,"tags":["string"]}
{"id":4221,"frontendId":3844,"title":"Longest Almost-Palindromic Substring","titleSlug":"longest-almost-palindromic-substring","difficulty":"MEDIUM","paidOnly":false,"tags":["two-pointers","string","dynamic-programming"]}
{"id":4222,"frontendId":3878,"title":"Count Good Subarrays","titleSlug":"count-good-subarrays","difficulty":"HARD","paidOnly":false,"tags":["array","stack","bit-manipulation","monotonic-stack"]}
{"id":4224,"frontendId":3847,"title":"Find the Score Difference in a Game","titleSlug":"find-the-score-difference-in-a-game","difficulty":"MEDIUM","paidOnly":false,"tags":["array","simulation"]}
{"id":4226,"frontendId":3848,"title":"Check Digitorial Permutation","titleSlug":"check-digitorial-permutation","difficulty":"MEDIUM","paidOnly":false,"tags":["math","counting"]}
{"id":4227,"frontendId":3832,"title":"Find Users with Persistent Behavior Patterns","titleSlug":"find-users-with-persistent-behavior-patterns","difficulty":"HARD","paidOnly":false,"tags":[]}
@ -3870,5 +3873,7 @@
{"id":4250,"frontendId":3851,"title":"Maximum Requests Without Violating the Limit","titleSlug":"maximum-requests-without-violating-the-limit","difficulty":"MEDIUM","paidOnly":true,"tags":["array","hash-table","greedy","sliding-window","sorting"]}
{"id":4252,"frontendId":3866,"title":"First Unique Even Element","titleSlug":"first-unique-even-element","difficulty":"EASY","paidOnly":false,"tags":["array","hash-table","counting"]}
{"id":4253,"frontendId":3868,"title":"Minimum Cost to Equalize Arrays Using Swaps","titleSlug":"minimum-cost-to-equalize-arrays-using-swaps","difficulty":"MEDIUM","paidOnly":false,"tags":["array","hash-table","greedy","counting"]}
{"id":4256,"frontendId":3875,"title":"Construct Uniform Parity Array I","titleSlug":"construct-uniform-parity-array-i","difficulty":"EASY","paidOnly":false,"tags":["array","math"]}
{"id":4258,"frontendId":3876,"title":"Construct Uniform Parity Array II","titleSlug":"construct-uniform-parity-array-ii","difficulty":"MEDIUM","paidOnly":false,"tags":["array","math"]}
{"id":4261,"frontendId":3865,"title":"Reverse K Subarrays","titleSlug":"reverse-k-subarrays","difficulty":"MEDIUM","paidOnly":true,"tags":["array","two-pointers"]}
{"id":4269,"frontendId":3874,"title":"Valid Subarrays With Exactly One Peak","titleSlug":"valid-subarrays-with-exactly-one-peak","difficulty":"MEDIUM","paidOnly":true,"tags":[]}
{"id":4269,"frontendId":3874,"title":"Valid Subarrays With Exactly One Peak","titleSlug":"valid-subarrays-with-exactly-one-peak","difficulty":"MEDIUM","paidOnly":true,"tags":["array","math"]}