{"id":"01JFNTKS00N14S1Q25JS0FSJV2","start_date":"Sun, 22 Dec 2024 00:00:00 GMT","scores":{"784631335062863932":483,"879472568992686120":280,"995825492475265155":125},"players":{"784631335062863932":{"discord_user_id":"784631335062863932","lc_username":"DavidJSolano"},"879472568992686120":{"discord_user_id":"879472568992686120","lc_username":"NateGries1"},"995825492475265155":{"discord_user_id":"995825492475265155","lc_username":"tomasohCHOM"}},"questions":{"minimum-number-of-operations-to-sort-a-binary-tree-by-level":{"name":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","date":"2024-12-23","title":"Minimum Number of Operations to Sort a Binary Tree by Level","difficulty":"Medium","url":"https://leetcode.com/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/","number":2471},"find-minimum-diameter-after-merging-two-trees":{"name":"find-minimum-diameter-after-merging-two-trees","date":"2024-12-24","title":"Find Minimum Diameter After Merging Two Trees","difficulty":"Hard","url":"https://leetcode.com/problems/find-minimum-diameter-after-merging-two-trees/","number":3203},"find-largest-value-in-each-tree-row":{"name":"find-largest-value-in-each-tree-row","date":"2024-12-25","title":"Find Largest Value in Each Tree Row","difficulty":"Medium","url":"https://leetcode.com/problems/find-largest-value-in-each-tree-row/","number":515},"find-building-where-alice-and-bob-can-meet":{"name":"find-building-where-alice-and-bob-can-meet","date":"2024-12-22","title":"Find Building Where Alice and Bob Can Meet","difficulty":"Hard","url":"https://leetcode.com/problems/find-building-where-alice-and-bob-can-meet/","number":2940},"target-sum":{"name":"target-sum","date":"2024-12-26","title":"Target Sum","difficulty":"Medium","url":"https://leetcode.com/problems/target-sum/","number":494},"best-sightseeing-pair":{"name":"best-sightseeing-pair","date":"2024-12-27","title":"Best Sightseeing Pair","difficulty":"Medium","url":"https://leetcode.com/problems/best-sightseeing-pair/","number":1014},"maximum-sum-of-3-non-overlapping-subarrays":{"name":"maximum-sum-of-3-non-overlapping-subarrays","date":"2024-12-28","title":"Maximum Sum of 3 Non-Overlapping Subarrays","difficulty":"Hard","url":"https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/","number":689}},"submissions":{"784631335062863932":{"minimum-number-of-operations-to-sort-a-binary-tree-by-level":{"id":"1486013639","date":"Mon, 23 Dec 2024 06:11:32 GMT"},"find-minimum-diameter-after-merging-two-trees":{"id":"1487523652","date":"Tue, 24 Dec 2024 22:11:28 GMT"},"find-largest-value-in-each-tree-row":{"id":"1487578091","date":"Wed, 25 Dec 2024 00:53:30 GMT"},"find-building-where-alice-and-bob-can-meet":{"id":"1487557813","date":"Tue, 24 Dec 2024 23:55:41 GMT"},"target-sum":{"id":"1489276931","date":"Thu, 26 Dec 2024 23:08:45 GMT"},"best-sightseeing-pair":{"id":"1490178372","date":"Fri, 27 Dec 2024 22:18:38 GMT"},"maximum-sum-of-3-non-overlapping-subarrays":{"id":"1490427051","date":"Sat, 28 Dec 2024 07:10:58 GMT"}},"879472568992686120":{"find-largest-value-in-each-tree-row":{"id":"1487595478","date":"Wed, 25 Dec 2024 01:43:59 GMT"},"minimum-number-of-operations-to-sort-a-binary-tree-by-level":{"id":"1487615669","date":"Wed, 25 Dec 2024 02:37:56 GMT"},"target-sum":{"id":"1489338047","date":"Fri, 27 Dec 2024 01:44:53 GMT"},"best-sightseeing-pair":{"id":"1489608720","date":"Fri, 27 Dec 2024 08:38:08 GMT"}},"995825492475265155":{"target-sum":{"id":"1489115398","date":"Thu, 26 Dec 2024 18:09:07 GMT"},"best-sightseeing-pair":{"id":"1490050083","date":"Fri, 27 Dec 2024 18:26:49 GMT"}}},"synced_at":"Sun, 29 Dec 2024 00:01:50 GMT"}