{"id":"01JHBWYW00WZ5W85YCQ97DPRG5","start_date":"Sun, 12 Jan 2025 00:00:00 GMT","scores":{"784631335062863932":514,"879472568992686120":481,"869320557672423455":84,"1026962130383159498":54,"1200169029755744310":225,"995825492475265155":114,"151481550163279872":53},"players":{"784631335062863932":{"discord_user_id":"784631335062863932","lc_username":"DavidJSolano"},"879472568992686120":{"discord_user_id":"879472568992686120","lc_username":"NateGries1"},"869320557672423455":{"discord_user_id":"869320557672423455","lc_username":"karnikaavelumani"},"1026962130383159498":{"discord_user_id":"1026962130383159498","lc_username":"randyydoo"},"1200169029755744310":{"discord_user_id":"1200169029755744310","lc_username":"believer_07"},"995825492475265155":{"discord_user_id":"995825492475265155","lc_username":"tomasohCHOM"},"151481550163279872":{"discord_user_id":"151481550163279872","lc_username":"johnnyblaze1999"}},"questions":{"check-if-a-parentheses-string-can-be-valid":{"name":"check-if-a-parentheses-string-can-be-valid","date":"2025-01-12","title":"Check if a Parentheses String Can Be Valid","difficulty":"Medium","url":"https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/","number":2116},"minimum-length-of-string-after-operations":{"name":"minimum-length-of-string-after-operations","date":"2025-01-13","title":"Minimum Length of String After Operations","difficulty":"Medium","url":"https://leetcode.com/problems/minimum-length-of-string-after-operations/","number":3223},"find-the-prefix-common-array-of-two-arrays":{"name":"find-the-prefix-common-array-of-two-arrays","date":"2025-01-14","title":"Find the Prefix Common Array of Two Arrays","difficulty":"Medium","url":"https://leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/","number":2657},"minimize-xor":{"name":"minimize-xor","date":"2025-01-15","title":"Minimize XOR","difficulty":"Medium","url":"https://leetcode.com/problems/minimize-xor/","number":2429},"bitwise-xor-of-all-pairings":{"name":"bitwise-xor-of-all-pairings","date":"2025-01-16","title":"Bitwise XOR of All Pairings","difficulty":"Medium","url":"https://leetcode.com/problems/bitwise-xor-of-all-pairings/","number":2425},"neighboring-bitwise-xor":{"name":"neighboring-bitwise-xor","date":"2025-01-17","title":"Neighboring Bitwise XOR","difficulty":"Medium","url":"https://leetcode.com/problems/neighboring-bitwise-xor/","number":2683},"minimum-cost-to-make-at-least-one-valid-path-in-a-grid":{"name":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid","date":"2025-01-18","title":"Minimum Cost to Make at Least One Valid Path in a Grid","difficulty":"Hard","url":"https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/","number":1368}},"submissions":{"784631335062863932":{"check-if-a-parentheses-string-can-be-valid":{"id":"1505829595","date":"Sun, 12 Jan 2025 05:31:32 GMT"},"minimum-length-of-string-after-operations":{"id":"1507700712","date":"Mon, 13 Jan 2025 21:29:12 GMT"},"find-the-prefix-common-array-of-two-arrays":{"id":"1508145455","date":"Tue, 14 Jan 2025 08:45:13 GMT"},"minimize-xor":{"id":"1509088895","date":"Wed, 15 Jan 2025 06:14:26 GMT"},"bitwise-xor-of-all-pairings":{"id":"1510027179","date":"Thu, 16 Jan 2025 04:02:23 GMT"},"neighboring-bitwise-xor":{"id":"1511911921","date":"Fri, 17 Jan 2025 21:39:51 GMT"},"minimum-cost-to-make-at-least-one-valid-path-in-a-grid":{"id":"1512979264","date":"Sat, 18 Jan 2025 22:34:10 GMT"}},"879472568992686120":{"check-if-a-parentheses-string-can-be-valid":{"id":"1506509555","date":"Sun, 12 Jan 2025 18:42:43 GMT"},"minimum-length-of-string-after-operations":{"id":"1506995957","date":"Mon, 13 Jan 2025 07:12:51 GMT"},"find-the-prefix-common-array-of-two-arrays":{"id":"1507952721","date":"Tue, 14 Jan 2025 04:52:52 GMT"},"minimize-xor":{"id":"1509682130","date":"Wed, 15 Jan 2025 18:23:23 GMT"},"bitwise-xor-of-all-pairings":{"id":"1510010359","date":"Thu, 16 Jan 2025 03:39:04 GMT"},"neighboring-bitwise-xor":{"id":"1511157901","date":"Fri, 17 Jan 2025 05:18:14 GMT"}},"869320557672423455":{"minimum-length-of-string-after-operations":{"id":"1507018302","date":"Mon, 13 Jan 2025 07:41:04 GMT"}},"1026962130383159498":{"minimum-length-of-string-after-operations":{"id":"1507728871","date":"Mon, 13 Jan 2025 22:21:16 GMT"}},"1200169029755744310":{"bitwise-xor-of-all-pairings":{"id":"1510131293","date":"Thu, 16 Jan 2025 06:07:27 GMT"},"minimize-xor":{"id":"1510123168","date":"Thu, 16 Jan 2025 05:58:34 GMT"},"neighboring-bitwise-xor":{"id":"1511211678","date":"Fri, 17 Jan 2025 06:20:31 GMT"}},"995825492475265155":{"bitwise-xor-of-all-pairings":{"id":"1510885332","date":"Thu, 16 Jan 2025 21:11:55 GMT"},"minimum-cost-to-make-at-least-one-valid-path-in-a-grid":{"id":"1512915097","date":"Sat, 18 Jan 2025 20:34:53 GMT"}},"151481550163279872":{"neighboring-bitwise-xor":{"id":"1511937328","date":"Fri, 17 Jan 2025 22:34:58 GMT"}}},"synced_at":"Sun, 19 Jan 2025 00:01:11 GMT"}