{"username":"lee215","total_solved":20,"solved_slugs":["count-of-unfinished-tasks-after-each-shift","count-subarrays-with-even-odd-ratio-ii","reverse-pairs","minimum-possible-maximum-waiting-time","minimum-initial-strength-to-defeat-all-monsters","widest-possible-fence","count-valid-prefixes","aggregate-two-time-series","minimum-cost-path-with-alternating-directions-iii","count-valid-sequences","transform-binary-string-using-subsequence-sort","count-dominant-nodes-in-a-binary-tree","even-number-of-knight-moves","rearrange-string-to-avoid-character-pair","minimum-adjacent-swaps-to-partition-array","maximum-value-of-an-alternating-sequence","create-grid-with-exactly-k-paths-i","maximum-consistent-columns-in-a-grid","minimum-total-cost-to-process-all-elements","palindromic-subarray-sum"],"solved":[{"title_slug":"count-of-unfinished-tasks-after-each-shift","title":"Count of Unfinished Tasks After Each Shift","timestamp":"1785643611"},{"title_slug":"count-subarrays-with-even-odd-ratio-ii","title":"Count Subarrays With Even Odd Ratio II","timestamp":"1785643586"},{"title_slug":"reverse-pairs","title":"Reverse Pairs","timestamp":"1785641852"},{"title_slug":"minimum-possible-maximum-waiting-time","title":"Minimum Possible Maximum Waiting Time","timestamp":"1785601004"},{"title_slug":"minimum-initial-strength-to-defeat-all-monsters","title":"Minimum Initial Strength to Defeat All Monsters","timestamp":"1785600585"},{"title_slug":"widest-possible-fence","title":"Widest Possible Fence","timestamp":"1785600249"},{"title_slug":"count-valid-prefixes","title":"Count Valid Prefixes","timestamp":"1785600118"},{"title_slug":"aggregate-two-time-series","title":"Aggregate Two Time Series","timestamp":"1785038834"},{"title_slug":"minimum-cost-path-with-alternating-directions-iii","title":"Minimum Cost Path with Alternating Directions III","timestamp":"1785038768"},{"title_slug":"count-valid-sequences","title":"Count Valid Sequences","timestamp":"1785038715"},{"title_slug":"transform-binary-string-using-subsequence-sort","title":"Transform Binary String Using Subsequence Sort","timestamp":"1784556431"},{"title_slug":"count-dominant-nodes-in-a-binary-tree","title":"Count Dominant Nodes in a Binary Tree","timestamp":"1784433961"},{"title_slug":"even-number-of-knight-moves","title":"Even Number of Knight Moves","timestamp":"1784433892"},{"title_slug":"rearrange-string-to-avoid-character-pair","title":"Rearrange String to Avoid Character Pair","timestamp":"1784391102"},{"title_slug":"minimum-adjacent-swaps-to-partition-array","title":"Minimum Adjacent Swaps to Partition Array","timestamp":"1784390699"},{"title_slug":"maximum-value-of-an-alternating-sequence","title":"Maximum Value of an Alternating Sequence","timestamp":"1784390686"},{"title_slug":"create-grid-with-exactly-k-paths-i","title":"Create Grid With Exactly K Paths I","timestamp":"1783835204"},{"title_slug":"maximum-consistent-columns-in-a-grid","title":"Maximum Consistent Columns in a Grid","timestamp":"1783829064"},{"title_slug":"minimum-total-cost-to-process-all-elements","title":"Minimum Total Cost to Process All Elements","timestamp":"1783828979"},{"title_slug":"palindromic-subarray-sum","title":"Palindromic Subarray Sum","timestamp":"1783225834"}]}