[{"id":"2140228077","title":"Minimum Operations to Make Every Element Palindromic","titleSlug":"minimum-operations-to-make-every-element-palindromic","timestamp":"1789272451","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2140228077/","langName":"Java","runtime":"295 ms","isPending":"Not Pending","memory":"118.8 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":130,"topicTags":[]},{"id":"2140224419","title":"Count Shadow Pairs I","titleSlug":"count-shadow-pairs-i","timestamp":"1789272109","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2140224419/","langName":"Java","runtime":"65 ms","isPending":"Not Pending","memory":"186.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":129,"topicTags":[]},{"id":"2139754751","title":"Count Subarrays with Distant Sums","titleSlug":"count-subarrays-with-distant-sums","timestamp":"1789229040","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2139754751/","langName":"Java","runtime":"139 ms","isPending":"Not Pending","memory":"89.1 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":128,"topicTags":[]},{"id":"2139753057","title":"Minimum Days to Score Exactly N Points","titleSlug":"minimum-days-to-score-exactly-n-points","timestamp":"1789228942","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2139753057/","langName":"Java","runtime":"35 ms","isPending":"Not Pending","memory":"46 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":127,"topicTags":[]},{"id":"2139752812","title":"Minimum Days to Score Exactly N Points","titleSlug":"minimum-days-to-score-exactly-n-points","timestamp":"1789228929","status":20,"statusDisplay":"Compile Error","lang":"java","url":"/submissions/detail/2139752812/","langName":"Java","runtime":"N/A","isPending":"Not Pending","memory":"N/A","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":126,"topicTags":[]},{"id":"2132419657","title":"Minimum Cost Path With At Most K Turns","titleSlug":"minimum-cost-path-with-at-most-k-turns","timestamp":"1788668124","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2132419657/","langName":"Java","runtime":"294 ms","isPending":"Not Pending","memory":"47.9 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":125,"topicTags":[]},{"id":"2132413037","title":"Count Robot Groups","titleSlug":"count-robot-groups","timestamp":"1788667547","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2132413037/","langName":"Java","runtime":"2 ms","isPending":"Not Pending","memory":"99.9 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":124,"topicTags":[]},{"id":"2132410793","title":"Count Good Cyclic Rotations","titleSlug":"count-good-cyclic-rotations","timestamp":"1788667363","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2132410793/","langName":"Java","runtime":"3 ms","isPending":"Not Pending","memory":"71.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":123,"topicTags":[]},{"id":"2124601864","title":"Count Integers Appearing in a Single Block","titleSlug":"count-integers-appearing-in-a-single-block","timestamp":"1788062725","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2124601864/","langName":"Java","runtime":"0 ms","isPending":"Not Pending","memory":"43.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":122,"topicTags":[]},{"id":"2124601485","title":"Minimum Operations to Form Subset Sum I","titleSlug":"minimum-operations-to-form-subset-sum-i","timestamp":"1788062692","status":20,"statusDisplay":"Compile Error","lang":"java","url":"/submissions/detail/2124601485/","langName":"Java","runtime":"N/A","isPending":"Not Pending","memory":"N/A","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":121,"topicTags":[]},{"id":"2124090080","title":"Lexicographically Largest String After Pair Transformations","titleSlug":"lexicographically-largest-string-after-pair-transformations","timestamp":"1788019490","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2124090080/","langName":"Java","runtime":"94 ms","isPending":"Not Pending","memory":"134.8 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":120,"topicTags":[]},{"id":"2124088878","title":"Minimum Bishop Moves to Reach Target","titleSlug":"minimum-bishop-moves-to-reach-target","timestamp":"1788019422","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2124088878/","langName":"Java","runtime":"1 ms","isPending":"Not Pending","memory":"43.9 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":119,"topicTags":[]},{"id":"2116899983","title":"Longest Subarray With at Most K Distinct Prime Factors","titleSlug":"longest-subarray-with-at-most-k-distinct-prime-factors","timestamp":"1787458885","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2116899983/","langName":"Java","runtime":"201 ms","isPending":"Not Pending","memory":"92.1 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":118,"topicTags":[]},{"id":"2108506123","title":"Maximum Gap Between Stations","titleSlug":"maximum-gap-between-stations","timestamp":"1786853038","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2108506123/","langName":"Java","runtime":"57 ms","isPending":"Not Pending","memory":"48.4 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":117,"topicTags":[]},{"id":"2107957965","title":"K-th Digit in Infinite String","titleSlug":"k-th-digit-in-infinite-string","timestamp":"1786809987","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2107957965/","langName":"Java","runtime":"2 ms","isPending":"Not Pending","memory":"42.6 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":116,"topicTags":[]},{"id":"2107956923","title":"Minimum Operations to Make a Rotated Palindrome I","titleSlug":"minimum-operations-to-make-a-rotated-palindrome-i","timestamp":"1786809930","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2107956923/","langName":"Java","runtime":"260 ms","isPending":"Not Pending","memory":"44.5 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":115,"topicTags":[]},{"id":"2090842326","title":"Count of Unfinished Tasks After Each Shift","titleSlug":"count-of-unfinished-tasks-after-each-shift","timestamp":"1785643611","status":10,"statusDisplay":"Accepted","lang":"java","url":"/submissions/detail/2090842326/","langName":"Java","runtime":"19 ms","isPending":"Not Pending","memory":"142.7 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":114,"topicTags":[]},{"id":"2090841965","title":"Count Subarrays With Even Odd Ratio II","titleSlug":"count-subarrays-with-even-odd-ratio-ii","timestamp":"1785643586","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2090841965/","langName":"Python3","runtime":"259 ms","isPending":"Not Pending","memory":"27.9 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":113,"topicTags":[]},{"id":"2090800865","title":"Reverse Pairs","titleSlug":"reverse-pairs","timestamp":"1785641852","status":10,"statusDisplay":"Accepted","lang":"python3","url":"/submissions/detail/2090800865/","langName":"Python3","runtime":"459 ms","isPending":"Not Pending","memory":"28.7 MB","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":112,"topicTags":[]},{"id":"2090655710","title":"Minimum Initial Strength to Defeat All Monsters","titleSlug":"minimum-initial-strength-to-defeat-all-monsters","timestamp":"1785636912","status":15,"statusDisplay":"Runtime Error","lang":"python3","url":"/submissions/detail/2090655710/","langName":"Python3","runtime":"N/A","isPending":"Not Pending","memory":"N/A","hasNotes":false,"notes":"","flagType":"WHITE","frontendId":111,"topicTags":[]}]