{"username":"lee215","total_solved":19,"solved_slugs":["maximum-alternating-subarray-sum-with-one-deletion","count-good-strings","longest-subarray-divisible-by-k-with-at-most-one-negation-i","transform-array-using-pair-operations","number-of-intersecting-interval-pairs-i","number-of-intersecting-interval-pairs-ii","maximum-pulse-value-after-one-subarray-rotation","lexicographically-largest-power-array","minimum-operations-to-make-every-element-palindromic","count-shadow-pairs-i","count-subarrays-with-distant-sums","minimum-days-to-score-exactly-n-points","minimum-cost-path-with-at-most-k-turns","count-robot-groups","count-good-cyclic-rotations","count-integers-appearing-in-a-single-block","lexicographically-largest-string-after-pair-transformations","minimum-bishop-moves-to-reach-target","longest-subarray-with-at-most-k-distinct-prime-factors"],"solved":[{"title_slug":"maximum-alternating-subarray-sum-with-one-deletion","title":"Maximum Alternating Subarray Sum With One Deletion","timestamp":"1791086655"},{"title_slug":"count-good-strings","title":"Count Good Strings","timestamp":"1791086605"},{"title_slug":"longest-subarray-divisible-by-k-with-at-most-one-negation-i","title":"Longest Subarray Divisible by K with At Most One Negation I","timestamp":"1790438495"},{"title_slug":"transform-array-using-pair-operations","title":"Transform Array Using Pair Operations","timestamp":"1790438466"},{"title_slug":"number-of-intersecting-interval-pairs-i","title":"Number of Intersecting Interval Pairs I","timestamp":"1789922542"},{"title_slug":"number-of-intersecting-interval-pairs-ii","title":"Number of Intersecting Interval Pairs II","timestamp":"1789922254"},{"title_slug":"maximum-pulse-value-after-one-subarray-rotation","title":"Maximum Pulse Value After One Subarray Rotation","timestamp":"1789921831"},{"title_slug":"lexicographically-largest-power-array","title":"Lexicographically Largest Power Array","timestamp":"1789921705"},{"title_slug":"minimum-operations-to-make-every-element-palindromic","title":"Minimum Operations to Make Every Element Palindromic","timestamp":"1789272451"},{"title_slug":"count-shadow-pairs-i","title":"Count Shadow Pairs I","timestamp":"1789272109"},{"title_slug":"count-subarrays-with-distant-sums","title":"Count Subarrays with Distant Sums","timestamp":"1789229040"},{"title_slug":"minimum-days-to-score-exactly-n-points","title":"Minimum Days to Score Exactly N Points","timestamp":"1789228942"},{"title_slug":"minimum-cost-path-with-at-most-k-turns","title":"Minimum Cost Path With At Most K Turns","timestamp":"1788668124"},{"title_slug":"count-robot-groups","title":"Count Robot Groups","timestamp":"1788667547"},{"title_slug":"count-good-cyclic-rotations","title":"Count Good Cyclic Rotations","timestamp":"1788667363"},{"title_slug":"count-integers-appearing-in-a-single-block","title":"Count Integers Appearing in a Single Block","timestamp":"1788062725"},{"title_slug":"lexicographically-largest-string-after-pair-transformations","title":"Lexicographically Largest String After Pair Transformations","timestamp":"1788019490"},{"title_slug":"minimum-bishop-moves-to-reach-target","title":"Minimum Bishop Moves to Reach Target","timestamp":"1788019422"},{"title_slug":"longest-subarray-with-at-most-k-distinct-prime-factors","title":"Longest Subarray With at Most K Distinct Prime Factors","timestamp":"1787458885"}]}