{"username":"lee215","total_solved":19,"solved_slugs":["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","trim-trailing-vowels","minimum-bitwise-or-from-grid","minimum-cost-to-split-into-ones","first-element-with-unique-frequency","longest-almost-palindromic-substring","house-robber-v","count-monobit-integers","longest-alternating-subarray-after-removing-at-most-one-element"],"solved":[{"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"},{"title_slug":"trim-trailing-vowels","title":"Trim Trailing Vowels","timestamp":"1772338911"},{"title_slug":"minimum-bitwise-or-from-grid","title":"Minimum Bitwise OR From Grid","timestamp":"1772337849"},{"title_slug":"minimum-cost-to-split-into-ones","title":"Minimum Cost to Split into Ones","timestamp":"1772337697"},{"title_slug":"first-element-with-unique-frequency","title":"First Element with Unique Frequency","timestamp":"1771128709"},{"title_slug":"longest-almost-palindromic-substring","title":"Longest Almost-Palindromic Substring","timestamp":"1771128246"},{"title_slug":"house-robber-v","title":"House Robber V","timestamp":"1771086160"},{"title_slug":"count-monobit-integers","title":"Count Monobit Integers","timestamp":"1769920095"},{"title_slug":"longest-alternating-subarray-after-removing-at-most-one-element","title":"Longest Alternating Subarray After Removing At Most One Element","timestamp":"1769919168"}]}