{"id":"01JW2BTF00GN922FT6EPMFYWHZ","start_date":"Sun, 25 May 2025 00:00:00 GMT","scores":{"395038510970568704":445,"729832718057078814":560,"879472568992686120":306,"995825492475265155":577,"784631335062863932":425,"151481550163279872":97,"358448184160419850":64,"972572025270960202":111,"407963398207176715":51,"691002497690501151":188},"players":{"395038510970568704":{"discord_user_id":"395038510970568704","lc_username":"alexanderkoo04"},"729832718057078814":{"discord_user_id":"729832718057078814","lc_username":"pythonProgrammer3"},"879472568992686120":{"discord_user_id":"879472568992686120","lc_username":"NateGries1"},"995825492475265155":{"discord_user_id":"995825492475265155","lc_username":"tomasohCHOM"},"784631335062863932":{"discord_user_id":"784631335062863932","lc_username":"DavidJSolano"},"151481550163279872":{"discord_user_id":"151481550163279872","lc_username":"johnnyblaze1999"},"358448184160419850":{"discord_user_id":"358448184160419850","lc_username":"lyyeric"},"972572025270960202":{"discord_user_id":"972572025270960202","lc_username":"oscisn93"},"407963398207176715":{"discord_user_id":"407963398207176715","lc_username":"PillowGit"},"691002497690501151":{"discord_user_id":"691002497690501151","lc_username":"MariiaGrushina"}},"questions":{"longest-palindrome-by-concatenating-two-letter-words":{"name":"longest-palindrome-by-concatenating-two-letter-words","date":"2025-05-25","title":"Longest Palindrome by Concatenating Two Letter Words","difficulty":"Medium","url":"https://leetcode.com/problems/longest-palindrome-by-concatenating-two-letter-words/","number":2131},"largest-color-value-in-a-directed-graph":{"name":"largest-color-value-in-a-directed-graph","date":"2025-05-26","title":"Largest Color Value in a Directed Graph","difficulty":"Hard","url":"https://leetcode.com/problems/largest-color-value-in-a-directed-graph/","number":1857},"divisible-and-non-divisible-sums-difference":{"name":"divisible-and-non-divisible-sums-difference","date":"2025-05-27","title":"Divisible and Non-divisible Sums Difference","difficulty":"Easy","url":"https://leetcode.com/problems/divisible-and-non-divisible-sums-difference/","number":2894},"maximize-the-number-of-target-nodes-after-connecting-trees-i":{"name":"maximize-the-number-of-target-nodes-after-connecting-trees-i","date":"2025-05-28","title":"Maximize the Number of Target Nodes After Connecting Trees I","difficulty":"Medium","url":"https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-i/","number":3372},"maximize-the-number-of-target-nodes-after-connecting-trees-ii":{"name":"maximize-the-number-of-target-nodes-after-connecting-trees-ii","date":"2025-05-29","title":"Maximize the Number of Target Nodes After Connecting Trees II","difficulty":"Hard","url":"https://leetcode.com/problems/maximize-the-number-of-target-nodes-after-connecting-trees-ii/","number":3373},"find-closest-node-to-given-two-nodes":{"name":"find-closest-node-to-given-two-nodes","date":"2025-05-30","title":"Find Closest Node to Given Two Nodes","difficulty":"Medium","url":"https://leetcode.com/problems/find-closest-node-to-given-two-nodes/","number":2359},"snakes-and-ladders":{"name":"snakes-and-ladders","date":"2025-05-31","title":"Snakes and Ladders","difficulty":"Medium","url":"https://leetcode.com/problems/snakes-and-ladders/","number":909}},"submissions":{"395038510970568704":{"longest-palindrome-by-concatenating-two-letter-words":{"id":"1643556143","date":"Sun, 25 May 2025 02:16:32 GMT"},"largest-color-value-in-a-directed-graph":{"id":"1645442566","date":"Mon, 26 May 2025 23:06:50 GMT"},"divisible-and-non-divisible-sums-difference":{"id":"1645547526","date":"Tue, 27 May 2025 02:58:24 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-i":{"id":"1646552093","date":"Wed, 28 May 2025 02:20:49 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-ii":{"id":"1648346683","date":"Thu, 29 May 2025 21:11:55 GMT"},"find-closest-node-to-given-two-nodes":{"id":"1649304679","date":"Fri, 30 May 2025 23:53:24 GMT"}},"729832718057078814":{"longest-palindrome-by-concatenating-two-letter-words":{"id":"1643814947","date":"Sun, 25 May 2025 07:02:44 GMT"},"largest-color-value-in-a-directed-graph":{"id":"1644805088","date":"Mon, 26 May 2025 08:53:24 GMT"},"divisible-and-non-divisible-sums-difference":{"id":"1645525695","date":"Tue, 27 May 2025 02:19:19 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-i":{"id":"1646766997","date":"Wed, 28 May 2025 07:21:43 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-ii":{"id":"1647571566","date":"Thu, 29 May 2025 03:47:25 GMT"},"find-closest-node-to-given-two-nodes":{"id":"1649125978","date":"Fri, 30 May 2025 17:58:02 GMT"},"snakes-and-ladders":{"id":"1650114058","date":"Sat, 31 May 2025 21:46:24 GMT"}},"879472568992686120":{"longest-palindrome-by-concatenating-two-letter-words":{"id":"1644061384","date":"Sun, 25 May 2025 12:53:51 GMT"},"divisible-and-non-divisible-sums-difference":{"id":"1645848536","date":"Tue, 27 May 2025 09:13:03 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-i":{"id":"1647256664","date":"Wed, 28 May 2025 17:48:27 GMT"},"find-closest-node-to-given-two-nodes":{"id":"1648598043","date":"Fri, 30 May 2025 05:57:58 GMT"}},"995825492475265155":{"longest-palindrome-by-concatenating-two-letter-words":{"id":"1644174641","date":"Sun, 25 May 2025 15:22:53 GMT"},"largest-color-value-in-a-directed-graph":{"id":"1644556513","date":"Mon, 26 May 2025 02:41:57 GMT"},"divisible-and-non-divisible-sums-difference":{"id":"1645505192","date":"Tue, 27 May 2025 01:37:08 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-i":{"id":"1646532571","date":"Wed, 28 May 2025 01:36:46 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-ii":{"id":"1648328593","date":"Thu, 29 May 2025 20:36:05 GMT"},"find-closest-node-to-given-two-nodes":{"id":"1648442012","date":"Fri, 30 May 2025 01:33:31 GMT"},"snakes-and-ladders":{"id":"1649933107","date":"Sat, 31 May 2025 17:07:35 GMT"}},"784631335062863932":{"longest-palindrome-by-concatenating-two-letter-words":{"id":"1644456321","date":"Sun, 25 May 2025 22:07:16 GMT"},"largest-color-value-in-a-directed-graph":{"id":"1645257844","date":"Mon, 26 May 2025 18:08:19 GMT"},"divisible-and-non-divisible-sums-difference":{"id":"1646391350","date":"Tue, 27 May 2025 20:00:50 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-i":{"id":"1647457603","date":"Wed, 28 May 2025 23:23:57 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-ii":{"id":"1648368682","date":"Thu, 29 May 2025 22:04:16 GMT"},"find-closest-node-to-given-two-nodes":{"id":"1648934135","date":"Fri, 30 May 2025 13:49:31 GMT"},"snakes-and-ladders":{"id":"1649825305","date":"Sat, 31 May 2025 14:47:37 GMT"}},"151481550163279872":{"divisible-and-non-divisible-sums-difference":{"id":"1645513354","date":"Tue, 27 May 2025 01:54:27 GMT"}},"358448184160419850":{"divisible-and-non-divisible-sums-difference":{"id":"1646263734","date":"Tue, 27 May 2025 17:30:31 GMT"}},"972572025270960202":{"divisible-and-non-divisible-sums-difference":{"id":"1646335616","date":"Tue, 27 May 2025 18:45:44 GMT"},"largest-color-value-in-a-directed-graph":{"id":"1646332917","date":"Tue, 27 May 2025 18:42:31 GMT"}},"407963398207176715":{"divisible-and-non-divisible-sums-difference":{"id":"1646489915","date":"Tue, 27 May 2025 23:41:02 GMT"}},"691002497690501151":{"maximize-the-number-of-target-nodes-after-connecting-trees-i":{"id":"1648278404","date":"Thu, 29 May 2025 19:14:56 GMT"},"maximize-the-number-of-target-nodes-after-connecting-trees-ii":{"id":"1648353433","date":"Thu, 29 May 2025 21:27:16 GMT"},"find-closest-node-to-given-two-nodes":{"id":"1648734187","date":"Fri, 30 May 2025 08:58:25 GMT"}}},"synced_at":"Sun, 01 Jun 2025 00:01:30 GMT"}