{"id":"01JC9NXK00HSQPH7B95NZYJ0WN","start_date":"Sun, 10 Nov 2024 00:00:00 GMT","scores":{"407963398207176715":464,"784631335062863932":461,"995825492475265155":193,"358448184160419850":89,"201383410420154368":530,"879472568992686120":244,"1200169029755744310":171,"219639423577358336":53,"674490747319484447":51,"831245698745499688":84},"players":{"407963398207176715":{"discord_user_id":"407963398207176715","lc_username":"PillowGit"},"784631335062863932":{"discord_user_id":"784631335062863932","lc_username":"DavidJSolano"},"995825492475265155":{"discord_user_id":"995825492475265155","lc_username":"tomasohCHOM"},"358448184160419850":{"discord_user_id":"358448184160419850","lc_username":"lyyeric"},"201383410420154368":{"discord_user_id":"201383410420154368","lc_username":"tmbkoren"},"879472568992686120":{"discord_user_id":"879472568992686120","lc_username":"NateGries1"},"1200169029755744310":{"discord_user_id":"1200169029755744310","lc_username":"believer_07"},"219639423577358336":{"discord_user_id":"219639423577358336","lc_username":"MarkRGarcia"},"674490747319484447":{"discord_user_id":"674490747319484447","lc_username":"janiljohn"},"831245698745499688":{"discord_user_id":"831245698745499688","lc_username":"elenavm"}},"questions":{"shortest-subarray-with-or-at-least-k-ii":{"name":"shortest-subarray-with-or-at-least-k-ii","date":"2024-11-10","title":"Shortest Subarray With OR at Least K II","difficulty":"Medium","url":"https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-ii/","number":3097},"prime-subtraction-operation":{"name":"prime-subtraction-operation","date":"2024-11-11","title":"Prime Subtraction Operation","difficulty":"Medium","url":"https://leetcode.com/problems/prime-subtraction-operation/","number":2601},"most-beautiful-item-for-each-query":{"name":"most-beautiful-item-for-each-query","date":"2024-11-12","title":"Most Beautiful Item for Each Query","difficulty":"Medium","url":"https://leetcode.com/problems/most-beautiful-item-for-each-query/","number":2070},"count-the-number-of-fair-pairs":{"name":"count-the-number-of-fair-pairs","date":"2024-11-13","title":"Count the Number of Fair Pairs","difficulty":"Medium","url":"https://leetcode.com/problems/count-the-number-of-fair-pairs/","number":2563},"minimized-maximum-of-products-distributed-to-any-store":{"name":"minimized-maximum-of-products-distributed-to-any-store","date":"2024-11-14","title":"Minimized Maximum of Products Distributed to Any Store","difficulty":"Medium","url":"https://leetcode.com/problems/minimized-maximum-of-products-distributed-to-any-store/","number":2064},"shortest-subarray-to-be-removed-to-make-array-sorted":{"name":"shortest-subarray-to-be-removed-to-make-array-sorted","date":"2024-11-15","title":"Shortest Subarray to be Removed to Make Array Sorted","difficulty":"Medium","url":"https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/","number":1574},"find-the-power-of-k-size-subarrays-i":{"name":"find-the-power-of-k-size-subarrays-i","date":"2024-11-16","title":"Find the Power of K-Size Subarrays I","difficulty":"Medium","url":"https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/","number":3254}},"submissions":{"407963398207176715":{"shortest-subarray-with-or-at-least-k-ii":{"id":"1449084321","date":"Sun, 10 Nov 2024 23:13:34 GMT"},"most-beautiful-item-for-each-query":{"id":"1450880631","date":"Tue, 12 Nov 2024 18:27:36 GMT"},"prime-subtraction-operation":{"id":"1451038919","date":"Tue, 12 Nov 2024 22:31:24 GMT"},"count-the-number-of-fair-pairs":{"id":"1451090752","date":"Wed, 13 Nov 2024 00:21:30 GMT"},"minimized-maximum-of-products-distributed-to-any-store":{"id":"1452078960","date":"Thu, 14 Nov 2024 00:15:49 GMT"},"shortest-subarray-to-be-removed-to-make-array-sorted":{"id":"1453050328","date":"Fri, 15 Nov 2024 00:28:01 GMT"}},"784631335062863932":{"prime-subtraction-operation":{"id":"1450023170","date":"Mon, 11 Nov 2024 22:52:32 GMT"},"shortest-subarray-with-or-at-least-k-ii":{"id":"1450207424","date":"Tue, 12 Nov 2024 04:19:11 GMT"},"most-beautiful-item-for-each-query":{"id":"1450249110","date":"Tue, 12 Nov 2024 05:12:22 GMT"},"count-the-number-of-fair-pairs":{"id":"1452061002","date":"Wed, 13 Nov 2024 23:35:41 GMT"},"minimized-maximum-of-products-distributed-to-any-store":{"id":"1453023809","date":"Thu, 14 Nov 2024 23:20:30 GMT"},"shortest-subarray-to-be-removed-to-make-array-sorted":{"id":"1453048953","date":"Fri, 15 Nov 2024 00:24:19 GMT"},"find-the-power-of-k-size-subarrays-i":{"id":"1454492212","date":"Sat, 16 Nov 2024 16:59:18 GMT"}},"995825492475265155":{"most-beautiful-item-for-each-query":{"id":"1450163726","date":"Tue, 12 Nov 2024 03:18:15 GMT"},"count-the-number-of-fair-pairs":{"id":"1451097973","date":"Wed, 13 Nov 2024 00:36:10 GMT"}},"358448184160419850":{"most-beautiful-item-for-each-query":{"id":"1450254112","date":"Tue, 12 Nov 2024 05:18:45 GMT"}},"201383410420154368":{"most-beautiful-item-for-each-query":{"id":"1450339698","date":"Tue, 12 Nov 2024 07:00:55 GMT"},"count-the-number-of-fair-pairs":{"id":"1451379999","date":"Wed, 13 Nov 2024 07:32:53 GMT"},"minimized-maximum-of-products-distributed-to-any-store":{"id":"1452206880","date":"Thu, 14 Nov 2024 04:10:12 GMT"},"shortest-subarray-to-be-removed-to-make-array-sorted":{"id":"1453260857","date":"Fri, 15 Nov 2024 06:36:44 GMT"},"prime-subtraction-operation":{"id":"1453297253","date":"Fri, 15 Nov 2024 07:27:20 GMT"},"shortest-subarray-with-or-at-least-k-ii":{"id":"1453277785","date":"Fri, 15 Nov 2024 06:59:19 GMT"},"find-the-power-of-k-size-subarrays-i":{"id":"1454203561","date":"Sat, 16 Nov 2024 09:44:01 GMT"}},"879472568992686120":{"prime-subtraction-operation":{"id":"1450344630","date":"Tue, 12 Nov 2024 07:06:47 GMT"},"most-beautiful-item-for-each-query":{"id":"1450410441","date":"Tue, 12 Nov 2024 08:40:33 GMT"},"minimized-maximum-of-products-distributed-to-any-store":{"id":"1452868771","date":"Thu, 14 Nov 2024 18:42:02 GMT"},"count-the-number-of-fair-pairs":{"id":"1452852520","date":"Thu, 14 Nov 2024 18:22:42 GMT"}},"1200169029755744310":{"count-the-number-of-fair-pairs":{"id":"1451389219","date":"Wed, 13 Nov 2024 07:47:05 GMT"},"minimized-maximum-of-products-distributed-to-any-store":{"id":"1452321580","date":"Thu, 14 Nov 2024 06:35:04 GMT"}},"219639423577358336":{"count-the-number-of-fair-pairs":{"id":"1452039890","date":"Wed, 13 Nov 2024 22:49:25 GMT"}},"674490747319484447":{"shortest-subarray-to-be-removed-to-make-array-sorted":{"id":"1453899286","date":"Fri, 15 Nov 2024 23:57:39 GMT"}},"831245698745499688":{"find-the-power-of-k-size-subarrays-i":{"id":"1454140973","date":"Sat, 16 Nov 2024 07:53:02 GMT"}}},"synced_at":"Sun, 17 Nov 2024 00:00:07 GMT"}