{"id":"01KW5RD80064M06CEW0ZZE38K9","start_date":"Sun, 28 Jun 2026 00:00:00 GMT","scores":{"623701809755717673":62,"784631335062863932":411,"202254335369936897":68},"players":{"623701809755717673":{"discord_user_id":"623701809755717673","lc_username":"timothyou"},"784631335062863932":{"discord_user_id":"784631335062863932","lc_username":"DavidJSolano"},"202254335369936897":{"discord_user_id":"202254335369936897","lc_username":"JeremHerring"}},"questions":{"number-of-strings-that-appear-as-substrings-in-word":{"name":"number-of-strings-that-appear-as-substrings-in-word","date":"2026-06-29","title":"Number of Strings That Appear as Substrings in Word","difficulty":"Easy","url":"https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/","number":1967},"number-of-substrings-containing-all-three-characters":{"name":"number-of-substrings-containing-all-three-characters","date":"2026-06-30","title":"Number of Substrings Containing All Three Characters","difficulty":"Medium","url":"https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/","number":1358},"maximum-element-after-decreasing-and-rearranging":{"name":"maximum-element-after-decreasing-and-rearranging","date":"2026-06-28","title":"Maximum Element After Decreasing and Rearranging","difficulty":"Medium","url":"https://leetcode.com/problems/maximum-element-after-decreasing-and-rearranging/","number":1846},"find-the-safest-path-in-a-grid":{"name":"find-the-safest-path-in-a-grid","date":"2026-07-01","title":"Find the Safest Path in a Grid","difficulty":"Medium","url":"https://leetcode.com/problems/find-the-safest-path-in-a-grid/","number":2812},"find-a-safe-walk-through-a-grid":{"name":"find-a-safe-walk-through-a-grid","date":"2026-07-02","title":"Find a Safe Walk Through a Grid","difficulty":"Medium","url":"https://leetcode.com/problems/find-a-safe-walk-through-a-grid/","number":3286},"network-recovery-pathways":{"name":"network-recovery-pathways","date":"2026-07-03","title":"Network Recovery Pathways","difficulty":"Hard","url":"https://leetcode.com/problems/network-recovery-pathways/","number":3620},"minimum-score-of-a-path-between-two-cities":{"name":"minimum-score-of-a-path-between-two-cities","date":"2026-07-04","title":"Minimum Score of a Path Between Two Cities","difficulty":"Medium","url":"https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/","number":2492}},"submissions":{"623701809755717673":{"number-of-strings-that-appear-as-substrings-in-word":{"id":"2050435844","date":"Mon, 29 Jun 2026 18:36:17 GMT"}},"784631335062863932":{"number-of-substrings-containing-all-three-characters":{"id":"2051672989","date":"Tue, 30 Jun 2026 20:50:35 GMT"},"number-of-strings-that-appear-as-substrings-in-word":{"id":"2050369930","date":"Mon, 29 Jun 2026 17:36:32 GMT"},"maximum-element-after-decreasing-and-rearranging":{"id":"2049357597","date":"Sun, 28 Jun 2026 21:04:52 GMT"},"find-the-safest-path-in-a-grid":{"id":"2052694214","date":"Wed, 01 Jul 2026 18:04:45 GMT"},"find-a-safe-walk-through-a-grid":{"id":"2054038065","date":"Thu, 02 Jul 2026 22:52:04 GMT"},"network-recovery-pathways":{"id":"2054925488","date":"Fri, 03 Jul 2026 17:16:16 GMT"},"minimum-score-of-a-path-between-two-cities":{"id":"2056292438","date":"Sat, 04 Jul 2026 23:13:48 GMT"}},"202254335369936897":{"find-a-safe-walk-through-a-grid":{"id":"2053676204","date":"Thu, 02 Jul 2026 15:23:45 GMT"}}},"synced_at":"Sun, 05 Jul 2026 00:00:05 GMT"}