{"id":"01K7AVF30062FFJGQRQYYYWJZZ","start_date":"Sun, 12 Oct 2025 00:00:00 GMT","scores":{"729832718057078814":545,"784631335062863932":491,"333447135926419456":105,"200145402849132544":105,"831245698745499688":89,"219639423577358336":63,"992190654618804276":50,"202254335369936897":89,"303740028637675524":57},"players":{"729832718057078814":{"discord_user_id":"729832718057078814","lc_username":"pythonProgrammer3"},"784631335062863932":{"discord_user_id":"784631335062863932","lc_username":"DavidJSolano"},"333447135926419456":{"discord_user_id":"333447135926419456","lc_username":"eliThomass"},"200145402849132544":{"discord_user_id":"200145402849132544","lc_username":"akankshj0527"},"831245698745499688":{"discord_user_id":"831245698745499688","lc_username":"elenavm"},"219639423577358336":{"discord_user_id":"219639423577358336","lc_username":"MarkRGarcia"},"992190654618804276":{"discord_user_id":"992190654618804276","lc_username":"pdang176"},"202254335369936897":{"discord_user_id":"202254335369936897","lc_username":"JeremHerring"},"303740028637675524":{"discord_user_id":"303740028637675524","lc_username":"GaballaGit"}},"questions":{"find-sum-of-array-product-of-magical-sequences":{"name":"find-sum-of-array-product-of-magical-sequences","date":"2025-10-12","title":"Find Sum of Array Product of Magical Sequences","difficulty":"Hard","url":"https://leetcode.com/problems/find-sum-of-array-product-of-magical-sequences/","number":3539},"find-resultant-array-after-removing-anagrams":{"name":"find-resultant-array-after-removing-anagrams","date":"2025-10-13","title":"Find Resultant Array After Removing Anagrams","difficulty":"Easy","url":"https://leetcode.com/problems/find-resultant-array-after-removing-anagrams/","number":2273},"adjacent-increasing-subarrays-detection-i":{"name":"adjacent-increasing-subarrays-detection-i","date":"2025-10-14","title":"Adjacent Increasing Subarrays Detection I","difficulty":"Easy","url":"https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/","number":3349},"adjacent-increasing-subarrays-detection-ii":{"name":"adjacent-increasing-subarrays-detection-ii","date":"2025-10-15","title":"Adjacent Increasing Subarrays Detection II","difficulty":"Medium","url":"https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii/","number":3350},"smallest-missing-non-negative-integer-after-operations":{"name":"smallest-missing-non-negative-integer-after-operations","date":"2025-10-16","title":"Smallest Missing Non-negative Integer After Operations","difficulty":"Medium","url":"https://leetcode.com/problems/smallest-missing-non-negative-integer-after-operations/","number":2598},"maximize-the-number-of-partitions-after-operations":{"name":"maximize-the-number-of-partitions-after-operations","date":"2025-10-17","title":"Maximize the Number of Partitions After Operations","difficulty":"Hard","url":"https://leetcode.com/problems/maximize-the-number-of-partitions-after-operations/","number":3003},"maximum-number-of-distinct-elements-after-operations":{"name":"maximum-number-of-distinct-elements-after-operations","date":"2025-10-18","title":"Maximum Number of Distinct Elements After Operations","difficulty":"Medium","url":"https://leetcode.com/problems/maximum-number-of-distinct-elements-after-operations/","number":3397}},"submissions":{"729832718057078814":{"find-sum-of-array-product-of-magical-sequences":{"id":"1798881738","date":"Sun, 12 Oct 2025 02:47:07 GMT"},"find-resultant-array-after-removing-anagrams":{"id":"1799888412","date":"Mon, 13 Oct 2025 02:59:52 GMT"},"adjacent-increasing-subarrays-detection-i":{"id":"1800882078","date":"Tue, 14 Oct 2025 01:43:19 GMT"},"adjacent-increasing-subarrays-detection-ii":{"id":"1802160473","date":"Wed, 15 Oct 2025 06:49:10 GMT"},"smallest-missing-non-negative-integer-after-operations":{"id":"1803118899","date":"Thu, 16 Oct 2025 06:43:29 GMT"},"maximize-the-number-of-partitions-after-operations":{"id":"1804011875","date":"Fri, 17 Oct 2025 06:42:40 GMT"}},"784631335062863932":{"find-sum-of-array-product-of-magical-sequences":{"id":"1799442555","date":"Sun, 12 Oct 2025 14:58:40 GMT"},"find-resultant-array-after-removing-anagrams":{"id":"1800403098","date":"Mon, 13 Oct 2025 14:46:15 GMT"},"adjacent-increasing-subarrays-detection-i":{"id":"1801737871","date":"Tue, 14 Oct 2025 18:50:20 GMT"},"adjacent-increasing-subarrays-detection-ii":{"id":"1802500243","date":"Wed, 15 Oct 2025 14:56:29 GMT"},"smallest-missing-non-negative-integer-after-operations":{"id":"1803009683","date":"Thu, 16 Oct 2025 04:23:15 GMT"},"maximize-the-number-of-partitions-after-operations":{"id":"1804291782","date":"Fri, 17 Oct 2025 14:49:59 GMT"},"maximum-number-of-distinct-elements-after-operations":{"id":"1805254602","date":"Sat, 18 Oct 2025 18:43:40 GMT"}},"333447135926419456":{"find-resultant-array-after-removing-anagrams":{"id":"1800797360","date":"Mon, 13 Oct 2025 22:26:01 GMT"},"adjacent-increasing-subarrays-detection-i":{"id":"1801894949","date":"Tue, 14 Oct 2025 23:47:56 GMT"}},"200145402849132544":{"find-resultant-array-after-removing-anagrams":{"id":"1800814651","date":"Mon, 13 Oct 2025 23:10:14 GMT"},"adjacent-increasing-subarrays-detection-i":{"id":"1801877717","date":"Tue, 14 Oct 2025 22:59:10 GMT"}},"831245698745499688":{"adjacent-increasing-subarrays-detection-i":{"id":"1801048082","date":"Tue, 14 Oct 2025 05:34:58 GMT"}},"219639423577358336":{"adjacent-increasing-subarrays-detection-i":{"id":"1801674469","date":"Tue, 14 Oct 2025 17:50:34 GMT"}},"992190654618804276":{"smallest-missing-non-negative-integer-after-operations":{"id":"1803849070","date":"Fri, 17 Oct 2025 02:03:46 GMT"}},"202254335369936897":{"maximize-the-number-of-partitions-after-operations":{"id":"1803959014","date":"Fri, 17 Oct 2025 05:25:23 GMT"}},"303740028637675524":{"maximum-number-of-distinct-elements-after-operations":{"id":"1805328090","date":"Sat, 18 Oct 2025 20:50:58 GMT"}}},"synced_at":"Sun, 19 Oct 2025 00:00:04 GMT"}