{"username":"lee215","total_solved":19,"solved_slugs":["largest-local-values-in-a-matrix-ii","count-k-th-roots-in-a-range","smallest-unique-subarray","minimize-array-sum-using-divisible-replacements","count-valid-word-occurrences","minimum-flips-to-make-binary-string-coherent","minimum-cost-to-move-between-indices","maximize-fixed-points-after-deletions","count-connected-subgraphs-with-even-node-sum","minimum-operations-to-make-array-non-decreasing","count-good-integers-on-a-grid-path","multi-source-flood-fill","construct-uniform-parity-array-i","minimum-removals-to-achieve-target-xor","construct-uniform-parity-array-ii","maximum-points-activated-with-one-addition","count-commas-in-range-ii","count-commas-in-range","minimum-cost-to-equalize-arrays-using-swaps"],"solved":[{"title_slug":"largest-local-values-in-a-matrix-ii","title":"Largest Local Values in a Matrix II","timestamp":"1779000734"},{"title_slug":"count-k-th-roots-in-a-range","title":"Count K-th Roots in a Range","timestamp":"1778990549"},{"title_slug":"smallest-unique-subarray","title":"Smallest Unique Subarray","timestamp":"1778990531"},{"title_slug":"minimize-array-sum-using-divisible-replacements","title":"Minimize Array Sum Using Divisible Replacements","timestamp":"1778834951"},{"title_slug":"count-valid-word-occurrences","title":"Count Valid Word Occurrences","timestamp":"1778385948"},{"title_slug":"minimum-flips-to-make-binary-string-coherent","title":"Minimum Flips to Make Binary String Coherent","timestamp":"1778342477"},{"title_slug":"minimum-cost-to-move-between-indices","title":"Minimum Cost to Move Between Indices","timestamp":"1777781386"},{"title_slug":"maximize-fixed-points-after-deletions","title":"Maximize Fixed Points After Deletions","timestamp":"1777781212"},{"title_slug":"count-connected-subgraphs-with-even-node-sum","title":"Count Connected Subgraphs with Even Node Sum","timestamp":"1777184361"},{"title_slug":"minimum-operations-to-make-array-non-decreasing","title":"Minimum Operations to Make Array Non Decreasing","timestamp":"1777176113"},{"title_slug":"count-good-integers-on-a-grid-path","title":"Count Good Integers on a Grid Path","timestamp":"1776571683"},{"title_slug":"multi-source-flood-fill","title":"Multi Source Flood Fill","timestamp":"1776571676"},{"title_slug":"construct-uniform-parity-array-i","title":"Construct Uniform Parity Array I","timestamp":"1774153296"},{"title_slug":"minimum-removals-to-achieve-target-xor","title":"Minimum Removals to Achieve Target XOR","timestamp":"1774152960"},{"title_slug":"construct-uniform-parity-array-ii","title":"Construct Uniform Parity Array II","timestamp":"1774152946"},{"title_slug":"maximum-points-activated-with-one-addition","title":"Maximum Points Activated with One Addition","timestamp":"1773548130"},{"title_slug":"count-commas-in-range-ii","title":"Count Commas in Range II","timestamp":"1773547589"},{"title_slug":"count-commas-in-range","title":"Count Commas in Range","timestamp":"1773547464"},{"title_slug":"minimum-cost-to-equalize-arrays-using-swaps","title":"Minimum Cost to Equalize Arrays Using Swaps","timestamp":"1773504411"}]}