{"id":"01JM60W100GE5XASGWY43J3NFN","start_date":"Sun, 16 Feb 2025 00:00:00 GMT","scores":{"202254335369936897":565,"784631335062863932":527,"879472568992686120":641,"972572025270960202":571,"307725517669531668":628,"395038510970568704":461,"1026962130383159498":171,"831245698745499688":99,"995825492475265155":99,"1200169029755744310":87},"players":{"202254335369936897":{"discord_user_id":"202254335369936897","lc_username":"JeremHerring"},"784631335062863932":{"discord_user_id":"784631335062863932","lc_username":"DavidJSolano"},"879472568992686120":{"discord_user_id":"879472568992686120","lc_username":"NateGries1"},"972572025270960202":{"discord_user_id":"972572025270960202","lc_username":"oscisn93"},"307725517669531668":{"discord_user_id":"307725517669531668","lc_username":"AlexthePear"},"395038510970568704":{"discord_user_id":"395038510970568704","lc_username":"alexanderkoo04"},"1026962130383159498":{"discord_user_id":"1026962130383159498","lc_username":"randyydoo"},"831245698745499688":{"discord_user_id":"831245698745499688","lc_username":"elenavm"},"995825492475265155":{"discord_user_id":"995825492475265155","lc_username":"tomasohCHOM"},"1200169029755744310":{"discord_user_id":"1200169029755744310","lc_username":"believer_07"}},"questions":{"construct-the-lexicographically-largest-valid-sequence":{"name":"construct-the-lexicographically-largest-valid-sequence","date":"2025-02-16","title":"Construct the Lexicographically Largest Valid Sequence","difficulty":"Medium","url":"https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/","number":1718},"letter-tile-possibilities":{"name":"letter-tile-possibilities","date":"2025-02-17","title":"Letter Tile Possibilities","difficulty":"Medium","url":"https://leetcode.com/problems/letter-tile-possibilities/","number":1079},"construct-smallest-number-from-di-string":{"name":"construct-smallest-number-from-di-string","date":"2025-02-18","title":"Construct Smallest Number From DI String","difficulty":"Medium","url":"https://leetcode.com/problems/construct-smallest-number-from-di-string/","number":2375},"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"name":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","date":"2025-02-19","title":"The k-th Lexicographical String of All Happy Strings of Length n","difficulty":"Medium","url":"https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/","number":1415},"find-unique-binary-string":{"name":"find-unique-binary-string","date":"2025-02-20","title":"Find Unique Binary String","difficulty":"Medium","url":"https://leetcode.com/problems/find-unique-binary-string/","number":1980},"find-elements-in-a-contaminated-binary-tree":{"name":"find-elements-in-a-contaminated-binary-tree","date":"2025-02-21","title":"Find Elements in a Contaminated Binary Tree","difficulty":"Medium","url":"https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/","number":1261},"recover-a-tree-from-preorder-traversal":{"name":"recover-a-tree-from-preorder-traversal","date":"2025-02-22","title":"Recover a Tree From Preorder Traversal","difficulty":"Hard","url":"https://leetcode.com/problems/recover-a-tree-from-preorder-traversal/","number":1028}},"submissions":{"202254335369936897":{"construct-the-lexicographically-largest-valid-sequence":{"id":"1544827843","date":"Sun, 16 Feb 2025 07:25:36 GMT"},"letter-tile-possibilities":{"id":"1546609415","date":"Mon, 17 Feb 2025 19:19:10 GMT"},"construct-smallest-number-from-di-string":{"id":"1546846302","date":"Tue, 18 Feb 2025 01:39:14 GMT"},"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"id":"1548165806","date":"Wed, 19 Feb 2025 05:35:21 GMT"},"find-unique-binary-string":{"id":"1549974840","date":"Thu, 20 Feb 2025 18:40:02 GMT"},"find-elements-in-a-contaminated-binary-tree":{"id":"1550423236","date":"Fri, 21 Feb 2025 06:12:24 GMT"},"recover-a-tree-from-preorder-traversal":{"id":"1551491160","date":"Sat, 22 Feb 2025 07:50:12 GMT"}},"784631335062863932":{"construct-the-lexicographically-largest-valid-sequence":{"id":"1544839932","date":"Sun, 16 Feb 2025 07:41:09 GMT"},"letter-tile-possibilities":{"id":"1546041503","date":"Mon, 17 Feb 2025 09:18:46 GMT"},"construct-smallest-number-from-di-string":{"id":"1546877707","date":"Tue, 18 Feb 2025 02:31:34 GMT"},"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"id":"1548956559","date":"Wed, 19 Feb 2025 20:37:38 GMT"},"find-unique-binary-string":{"id":"1550089180","date":"Thu, 20 Feb 2025 21:16:53 GMT"},"find-elements-in-a-contaminated-binary-tree":{"id":"1550198762","date":"Fri, 21 Feb 2025 00:59:55 GMT"},"recover-a-tree-from-preorder-traversal":{"id":"1552132877","date":"Sat, 22 Feb 2025 21:53:42 GMT"}},"879472568992686120":{"construct-the-lexicographically-largest-valid-sequence":{"id":"1544907200","date":"Sun, 16 Feb 2025 09:15:40 GMT"},"letter-tile-possibilities":{"id":"1545938366","date":"Mon, 17 Feb 2025 07:05:19 GMT"},"construct-smallest-number-from-di-string":{"id":"1546982318","date":"Tue, 18 Feb 2025 04:51:25 GMT"},"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"id":"1547960832","date":"Wed, 19 Feb 2025 00:35:17 GMT"},"find-unique-binary-string":{"id":"1549348891","date":"Thu, 20 Feb 2025 06:41:39 GMT"},"find-elements-in-a-contaminated-binary-tree":{"id":"1550193582","date":"Fri, 21 Feb 2025 00:49:55 GMT"},"recover-a-tree-from-preorder-traversal":{"id":"1551230155","date":"Sat, 22 Feb 2025 00:45:40 GMT"}},"972572025270960202":{"construct-the-lexicographically-largest-valid-sequence":{"id":"1544972410","date":"Sun, 16 Feb 2025 10:39:55 GMT"},"letter-tile-possibilities":{"id":"1546790302","date":"Mon, 17 Feb 2025 23:56:40 GMT"},"construct-smallest-number-from-di-string":{"id":"1546847150","date":"Tue, 18 Feb 2025 01:40:42 GMT"},"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"id":"1548030466","date":"Wed, 19 Feb 2025 02:43:41 GMT"},"find-unique-binary-string":{"id":"1549374139","date":"Thu, 20 Feb 2025 07:08:20 GMT"},"find-elements-in-a-contaminated-binary-tree":{"id":"1550452143","date":"Fri, 21 Feb 2025 06:41:22 GMT"},"recover-a-tree-from-preorder-traversal":{"id":"1551643544","date":"Sat, 22 Feb 2025 11:27:39 GMT"}},"307725517669531668":{"construct-the-lexicographically-largest-valid-sequence":{"id":"1545597267","date":"Sun, 16 Feb 2025 22:46:13 GMT"},"letter-tile-possibilities":{"id":"1545763265","date":"Mon, 17 Feb 2025 03:34:32 GMT"},"construct-smallest-number-from-di-string":{"id":"1547017908","date":"Tue, 18 Feb 2025 05:28:34 GMT"},"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"id":"1547954763","date":"Wed, 19 Feb 2025 00:23:03 GMT"},"find-unique-binary-string":{"id":"1549070564","date":"Thu, 20 Feb 2025 00:23:26 GMT"},"find-elements-in-a-contaminated-binary-tree":{"id":"1550234840","date":"Fri, 21 Feb 2025 02:09:10 GMT"},"recover-a-tree-from-preorder-traversal":{"id":"1551251686","date":"Sat, 22 Feb 2025 01:39:59 GMT"}},"395038510970568704":{"construct-the-lexicographically-largest-valid-sequence":{"id":"1545633564","date":"Sun, 16 Feb 2025 23:42:34 GMT"},"letter-tile-possibilities":{"id":"1546755638","date":"Mon, 17 Feb 2025 22:51:51 GMT"},"construct-smallest-number-from-di-string":{"id":"1546836532","date":"Tue, 18 Feb 2025 01:21:56 GMT"},"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"id":"1549049408","date":"Wed, 19 Feb 2025 23:39:29 GMT"},"find-unique-binary-string":{"id":"1549139227","date":"Thu, 20 Feb 2025 02:29:19 GMT"},"find-elements-in-a-contaminated-binary-tree":{"id":"1551031151","date":"Fri, 21 Feb 2025 18:39:24 GMT"},"recover-a-tree-from-preorder-traversal":{"id":"1552190546","date":"Sat, 22 Feb 2025 23:42:22 GMT"}},"1026962130383159498":{"letter-tile-possibilities":{"id":"1546585334","date":"Mon, 17 Feb 2025 18:53:39 GMT"},"find-unique-binary-string":{"id":"1550014862","date":"Thu, 20 Feb 2025 19:26:51 GMT"},"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n":{"id":"1551046458","date":"Fri, 21 Feb 2025 18:57:41 GMT"}},"831245698745499688":{"find-unique-binary-string":{"id":"1549079364","date":"Thu, 20 Feb 2025 00:40:22 GMT"}},"995825492475265155":{"find-unique-binary-string":{"id":"1549073923","date":"Thu, 20 Feb 2025 00:29:50 GMT"}},"1200169029755744310":{"find-elements-in-a-contaminated-binary-tree":{"id":"1550452044","date":"Fri, 21 Feb 2025 06:41:16 GMT"}}},"synced_at":"Tue, 25 Feb 2025 14:59:48 GMT"}