[{"id":"2090286291","title":"Minimum Possible Maximum Waiting Time","titleSlug":"minimum-possible-maximum-waiting-time","timestamp":"1785601004","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2090286291/","langName":"Python3","runtime":"223 ms","isPending":"Not Pending","memory":"89.8 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":140,"topicTags":[]},{"id":"2090277839","title":"Minimum Initial Strength to Defeat All Monsters","titleSlug":"minimum-initial-strength-to-defeat-all-monsters","timestamp":"1785600585","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2090277839/","langName":"Java","runtime":"2 ms","isPending":"Not Pending","memory":"161.8 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":139,"topicTags":[]},{"id":"2090270843","title":"Widest Possible Fence","titleSlug":"widest-possible-fence","timestamp":"1785600249","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2090270843/","langName":"Java","runtime":"774 ms","isPending":"Not Pending","memory":"275.2 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":138,"topicTags":[]},{"id":"2090267865","title":"Count Valid Prefixes","titleSlug":"count-valid-prefixes","timestamp":"1785600118","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2090267865/","langName":"Java","runtime":"1 ms","isPending":"Not Pending","memory":"44 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":137,"topicTags":[]},{"id":"2081498452","title":"Aggregate Two Time Series","titleSlug":"aggregate-two-time-series","timestamp":"1785038834","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2081498452/","langName":"Python3","runtime":"167 ms","isPending":"Not Pending","memory":"96.3 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":136,"topicTags":[]},{"id":"2081497435","title":"Minimum Cost Path with Alternating Directions III","titleSlug":"minimum-cost-path-with-alternating-directions-iii","timestamp":"1785038768","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2081497435/","langName":"Java","runtime":"391 ms","isPending":"Not Pending","memory":"133.1 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":135,"topicTags":[]},{"id":"2081496645","title":"Count Valid Sequences","titleSlug":"count-valid-sequences","timestamp":"1785038715","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2081496645/","langName":"Java","runtime":"7 ms","isPending":"Not Pending","memory":"42.9 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":134,"topicTags":[]},{"id":"2074646289","title":"Transform Binary String Using Subsequence Sort","titleSlug":"transform-binary-string-using-subsequence-sort","timestamp":"1784556431","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2074646289/","langName":"Python3","runtime":"803 ms","isPending":"Not Pending","memory":"33.4 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":133,"topicTags":[]},{"id":"2074620644","title":"Transform Binary String Using Subsequence Sort","titleSlug":"transform-binary-string-using-subsequence-sort","timestamp":"1784555060","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2074620644/","langName":"Python3","runtime":"749 ms","isPending":"Not Pending","memory":"33.3 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":132,"topicTags":[]},{"id":"2073027847","title":"Count Dominant Nodes in a Binary Tree","titleSlug":"count-dominant-nodes-in-a-binary-tree","timestamp":"1784433961","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2073027847/","langName":"Java","runtime":"16 ms","isPending":"Not Pending","memory":"187 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":131,"topicTags":[]},{"id":"2073027078","title":"Even Number of Knight Moves","titleSlug":"even-number-of-knight-moves","timestamp":"1784433892","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2073027078/","langName":"Java","runtime":"1 ms","isPending":"Not Pending","memory":"44.2 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":130,"topicTags":[]},{"id":"2072535146","title":"Rearrange String to Avoid Character Pair","titleSlug":"rearrange-string-to-avoid-character-pair","timestamp":"1784391102","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2072535146/","langName":"Java","runtime":"2 ms","isPending":"Not Pending","memory":"45.5 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":129,"topicTags":[]},{"id":"2072529697","title":"Minimum Adjacent Swaps to Partition Array","titleSlug":"minimum-adjacent-swaps-to-partition-array","timestamp":"1784390699","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2072529697/","langName":"Java","runtime":"5 ms","isPending":"Not Pending","memory":"102.4 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":128,"topicTags":[]},{"id":"2072529431","title":"Maximum Value of an Alternating Sequence","titleSlug":"maximum-value-of-an-alternating-sequence","timestamp":"1784390686","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2072529431/","langName":"Java","runtime":"1 ms","isPending":"Not Pending","memory":"42.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":127,"topicTags":[]},{"id":"2064628620","title":"Create Grid With Exactly K Paths I","titleSlug":"create-grid-with-exactly-k-paths-i","timestamp":"1783835204","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2064628620/","langName":"Python3","runtime":"0 ms","isPending":"Not Pending","memory":"19.2 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":126,"topicTags":[]},{"id":"2064550148","title":"Maximum Consistent Columns in a Grid","titleSlug":"maximum-consistent-columns-in-a-grid","timestamp":"1783829064","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2064550148/","langName":"Java","runtime":"66 ms","isPending":"Not Pending","memory":"61.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":125,"topicTags":[]},{"id":"2064549034","title":"Minimum Total Cost to Process All Elements","titleSlug":"minimum-total-cost-to-process-all-elements","timestamp":"1783828979","status":10,"statusDisplay":"Accepted","lang":"cpp","url":"/submissions/detail/2064549034/","langName":"C++","runtime":"7 ms","isPending":"Not Pending","memory":"169.5 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":124,"topicTags":[]},{"id":"2056505771","title":"Palindromic Subarray Sum","titleSlug":"palindromic-subarray-sum","timestamp":"1783225834","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2056505771/","langName":"Java","runtime":"25 ms","isPending":"Not Pending","memory":"140 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":123,"topicTags":[]},{"id":"2056487618","title":"Subsequence After One Replacement","titleSlug":"subsequence-after-one-replacement","timestamp":"1783224096","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2056487618/","langName":"Java","runtime":"12 ms","isPending":"Not Pending","memory":"48.1 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":122,"topicTags":[]},{"id":"2056004962","title":"Maximum Valid Pair Sum","titleSlug":"maximum-valid-pair-sum","timestamp":"1783181590","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2056004962/","langName":"Java","runtime":"3 ms","isPending":"Not Pending","memory":"119.4 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":121,"topicTags":[]}]