[{"id":"2005305265","title":"Largest Local Values in a Matrix II","titleSlug":"largest-local-values-in-a-matrix-ii","timestamp":"1779000734","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2005305265/","langName":"Python3","runtime":"6406 ms","isPending":"Not Pending","memory":"26.4 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":142,"topicTags":[]},{"id":"2005187223","title":"Count K-th Roots in a Range","titleSlug":"count-k-th-roots-in-a-range","timestamp":"1778990549","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2005187223/","langName":"Java","runtime":"2 ms","isPending":"Not Pending","memory":"42.8 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":141,"topicTags":[]},{"id":"2005187005","title":"Smallest Unique Subarray","titleSlug":"smallest-unique-subarray","timestamp":"1778990531","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2005187005/","langName":"Java","runtime":"352 ms","isPending":"Not Pending","memory":"227.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":140,"topicTags":[]},{"id":"2003648627","title":"Minimize Array Sum Using Divisible Replacements","titleSlug":"minimize-array-sum-using-divisible-replacements","timestamp":"1778834951","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2003648627/","langName":"Python3","runtime":"379 ms","isPending":"Not Pending","memory":"36.7 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":139,"topicTags":[]},{"id":"1999429532","title":"Count Valid Word Occurrences","titleSlug":"count-valid-word-occurrences","timestamp":"1778385948","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/1999429532/","langName":"Python3","runtime":"111 ms","isPending":"Not Pending","memory":"39.3 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":138,"topicTags":[]},{"id":"1999427776","title":"Minimize Array Sum Using Divisible Replacements","titleSlug":"minimize-array-sum-using-divisible-replacements","timestamp":"1778385780","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1999427776/","langName":"Java","runtime":"636 ms","isPending":"Not Pending","memory":"142.1 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":137,"topicTags":[]},{"id":"1999427412","title":"Minimum Cost to Buy Apples II","titleSlug":"minimum-cost-to-buy-apples-ii","timestamp":"1778385748","status":20,"statusDisplay":"Compile Error","lang":"java","url":"/submissions/detail/1999427412/","langName":"Java","runtime":"N/A","isPending":"Not Pending","memory":"N/A","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":136,"topicTags":[]},{"id":"1999036771","title":"Minimum Flips to Make Binary String Coherent","titleSlug":"minimum-flips-to-make-binary-string-coherent","timestamp":"1778342477","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1999036771/","langName":"Java","runtime":"8 ms","isPending":"Not Pending","memory":"47.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":135,"topicTags":[]},{"id":"1995037998","title":"Minimum Cost to Move Between Indices","titleSlug":"minimum-cost-to-move-between-indices","timestamp":"1777906632","status":15,"statusDisplay":"Runtime Error","lang":"python3","url":"/submissions/detail/1995037998/","langName":"Python3","runtime":"N/A","isPending":"Not Pending","memory":"N/A","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":134,"topicTags":[]},{"id":"1993848395","title":"Minimum Cost to Move Between Indices","titleSlug":"minimum-cost-to-move-between-indices","timestamp":"1777781386","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1993848395/","langName":"Java","runtime":"5 ms","isPending":"Not Pending","memory":"189.7 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":133,"topicTags":[]},{"id":"1993846679","title":"Maximize Fixed Points After Deletions","titleSlug":"maximize-fixed-points-after-deletions","timestamp":"1777781212","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1993846679/","langName":"Java","runtime":"52 ms","isPending":"Not Pending","memory":"134.3 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":132,"topicTags":[]},{"id":"1993846470","title":"Minimum Cost to Move Between Indices","titleSlug":"minimum-cost-to-move-between-indices","timestamp":"1777781193","status":20,"statusDisplay":"Compile Error","lang":"java","url":"/submissions/detail/1993846470/","langName":"Java","runtime":"N/A","isPending":"Not Pending","memory":"N/A","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":131,"topicTags":[]},{"id":"1988394612","title":"Count Connected Subgraphs with Even Node Sum","titleSlug":"count-connected-subgraphs-with-even-node-sum","timestamp":"1777184361","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1988394612/","langName":"Java","runtime":"36 ms","isPending":"Not Pending","memory":"47.2 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":130,"topicTags":[]},{"id":"1988394417","title":"Count Connected Subgraphs with Even Node Sum","titleSlug":"count-connected-subgraphs-with-even-node-sum","timestamp":"1777184342","status":20,"statusDisplay":"Compile Error","lang":"java","url":"/submissions/detail/1988394417/","langName":"Java","runtime":"N/A","isPending":"Not Pending","memory":"N/A","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":129,"topicTags":[]},{"id":"1988315165","title":"Minimum Operations to Make Array Non Decreasing","titleSlug":"minimum-operations-to-make-array-non-decreasing","timestamp":"1777176113","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1988315165/","langName":"Java","runtime":"3 ms","isPending":"Not Pending","memory":"87.6 MB","hasNotes":null,"notes":"[ Time taken: 41d 4hrs 30m 51s ]","flagType":"WHITE","frontendId":128,"topicTags":[]},{"id":"1982297307","title":"Count Good Integers on a Grid Path","titleSlug":"count-good-integers-on-a-grid-path","timestamp":"1776571683","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1982297307/","langName":"Java","runtime":"30 ms","isPending":"Not Pending","memory":"47.5 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":127,"topicTags":[]},{"id":"1982297230","title":"Multi Source Flood Fill","titleSlug":"multi-source-flood-fill","timestamp":"1776571676","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1982297230/","langName":"Java","runtime":"80 ms","isPending":"Not Pending","memory":"100.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":126,"topicTags":[]},{"id":"1955388805","title":"Construct Uniform Parity Array I","titleSlug":"construct-uniform-parity-array-i","timestamp":"1774153296","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1955388805/","langName":"Java","runtime":"0 ms","isPending":"Not Pending","memory":"45.2 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":125,"topicTags":[]},{"id":"1955385438","title":"Minimum Removals to Achieve Target XOR","titleSlug":"minimum-removals-to-achieve-target-xor","timestamp":"1774152960","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1955385438/","langName":"Java","runtime":"102 ms","isPending":"Not Pending","memory":"49.9 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":124,"topicTags":[]},{"id":"1955385293","title":"Construct Uniform Parity Array II","titleSlug":"construct-uniform-parity-array-ii","timestamp":"1774152946","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/1955385293/","langName":"Java","runtime":"5 ms","isPending":"Not Pending","memory":"121.1 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":123,"topicTags":[]}]