{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":354046933,"defaultBranch":"main","name":"Leetcode-Challenge","ownerLogin":"Algorithms-Made-Easy","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-04-02T14:43:14.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/64302424?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1617374595.47564","currentOid":""},"activityList":{"items":[{"before":"6f92cf3f3f68ce92ed4f29dcd66dddc5bc4f8d24","after":"473e9b7c2d03bd3dcae2f96c0602e858cbaa7419","ref":"refs/heads/main","pushedAt":"2024-03-29T05:40:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"khushi3004","name":null,"path":"/khushi3004","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/46336275?s=80&v=4"},"commit":{"message":"Rename 2598. Length Of Longest Subarray with at most K Frequency to 2958. Length Of Longest Subarray with at most K Frequency","shortMessageHtmlLink":"Rename 2598. Length Of Longest Subarray with at most K Frequency to 2…"}},{"before":"6534d68862443b5d954fd01157d8cc12a23abdfb","after":"6f92cf3f3f68ce92ed4f29dcd66dddc5bc4f8d24","ref":"refs/heads/main","pushedAt":"2024-03-28T19:28:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"khushi3004","name":null,"path":"/khushi3004","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/46336275?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"0c841955de31d5f11bc3eb9d6fb9cac75450ac99","after":"6534d68862443b5d954fd01157d8cc12a23abdfb","ref":"refs/heads/main","pushedAt":"2024-03-28T19:27:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"khushi3004","name":null,"path":"/khushi3004","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/46336275?s=80&v=4"},"commit":{"message":"Create 2598. Length Of Longest Subarray with at most K Frequency","shortMessageHtmlLink":"Create 2598. Length Of Longest Subarray with at most K Frequency"}},{"before":"e99eae656a8d240bea7bdcee6da332bb299c8cb4","after":"0c841955de31d5f11bc3eb9d6fb9cac75450ac99","ref":"refs/heads/main","pushedAt":"2024-03-10T15:59:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"1c6cb32ae4e3878971b6e803b0583b0f5b2cf902","after":"e99eae656a8d240bea7bdcee6da332bb299c8cb4","ref":"refs/heads/main","pushedAt":"2024-03-10T15:57:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Create 1751. Maximum Number of Events That Can Be Attended II","shortMessageHtmlLink":"Create 1751. Maximum Number of Events That Can Be Attended II"}},{"before":"6e9885c82d37fdbabfa29e1366711c9098209c34","after":"1c6cb32ae4e3878971b6e803b0583b0f5b2cf902","ref":"refs/heads/main","pushedAt":"2024-03-02T19:36:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"fa01af57d8fa2e575c2667d4b55cbca680b457fd","after":"6e9885c82d37fdbabfa29e1366711c9098209c34","ref":"refs/heads/main","pushedAt":"2024-03-02T19:35:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Create 724. Find Pivot Index","shortMessageHtmlLink":"Create 724. Find Pivot Index"}},{"before":"5fc3f01b21d0fdcef659a95fdd5fd0f5da3384d7","after":"fa01af57d8fa2e575c2667d4b55cbca680b457fd","ref":"refs/heads/main","pushedAt":"2023-07-16T17:52:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"8f972d98672eb70412df2e6c353f9b47e20845f2","after":"5fc3f01b21d0fdcef659a95fdd5fd0f5da3384d7","ref":"refs/heads/main","pushedAt":"2023-07-16T17:23:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Create 1353. Maximum Number of Events That Can Be Attended","shortMessageHtmlLink":"Create 1353. Maximum Number of Events That Can Be Attended"}},{"before":"ceeba54d5d85570e0c04beb8dfbc50a25beed34c","after":"8f972d98672eb70412df2e6c353f9b47e20845f2","ref":"refs/heads/main","pushedAt":"2023-07-08T19:00:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"526e91e37e12e2a895cc77b58dcd6fd3a57f13d0","after":"ceeba54d5d85570e0c04beb8dfbc50a25beed34c","ref":"refs/heads/main","pushedAt":"2023-07-08T18:58:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Create 1365. How Many Numbers Are Smaller Than the Current Number","shortMessageHtmlLink":"Create 1365. How Many Numbers Are Smaller Than the Current Number"}},{"before":"4690553b0ee414e8f8e83fb7565b2046607e7a4f","after":"526e91e37e12e2a895cc77b58dcd6fd3a57f13d0","ref":"refs/heads/main","pushedAt":"2023-06-25T19:18:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"khushi3004","name":null,"path":"/khushi3004","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/46336275?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"8d6d3ac5c4768718ac50bb214bee676d593ec761","after":"4690553b0ee414e8f8e83fb7565b2046607e7a4f","ref":"refs/heads/main","pushedAt":"2023-06-25T18:07:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"khushi3004","name":null,"path":"/khushi3004","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/46336275?s=80&v=4"},"commit":{"message":"Create 530. Minimum Absolute Difference in BST","shortMessageHtmlLink":"Create 530. Minimum Absolute Difference in BST"}},{"before":"20f6cdeca86130dd37a7efaaecbb0c33cc41c41e","after":"8d6d3ac5c4768718ac50bb214bee676d593ec761","ref":"refs/heads/main","pushedAt":"2023-06-18T18:54:09.940Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"7db3b34e3158ca6bed59384266b3ac595cd38d63","after":"20f6cdeca86130dd37a7efaaecbb0c33cc41c41e","ref":"refs/heads/main","pushedAt":"2023-06-18T18:51:55.854Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Create 2328. Number of Increasing Paths in a Grid","shortMessageHtmlLink":"Create 2328. Number of Increasing Paths in a Grid"}},{"before":"bab7fef09bcd5bb6be13ffa755ea73ba97285ef8","after":"7db3b34e3158ca6bed59384266b3ac595cd38d63","ref":"refs/heads/main","pushedAt":"2023-06-12T15:04:12.893Z","pushType":"push","commitsCount":1,"pusher":{"login":"khushi3004","name":null,"path":"/khushi3004","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/46336275?s=80&v=4"},"commit":{"message":"Update 1802. Maximum Value at a Given Index in a Bounded Array","shortMessageHtmlLink":"Update 1802. Maximum Value at a Given Index in a Bounded Array"}},{"before":"1a7763d7ca37e85ed6260b9aadd335f5b42be6c7","after":"bab7fef09bcd5bb6be13ffa755ea73ba97285ef8","ref":"refs/heads/main","pushedAt":"2023-06-10T17:35:25.485Z","pushType":"push","commitsCount":1,"pusher":{"login":"khushi3004","name":null,"path":"/khushi3004","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/46336275?s=80&v=4"},"commit":{"message":"Create 1802. Maximum Value at a Given Index in a Bounded Array","shortMessageHtmlLink":"Create 1802. Maximum Value at a Given Index in a Bounded Array"}},{"before":"cd52399c9b6737a919e0462bfc4f5b130b2bfc6f","after":"1a7763d7ca37e85ed6260b9aadd335f5b42be6c7","ref":"refs/heads/main","pushedAt":"2023-06-04T12:46:10.821Z","pushType":"push","commitsCount":1,"pusher":{"login":"khushi3004","name":null,"path":"/khushi3004","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/46336275?s=80&v=4"},"commit":{"message":"Create 209. Minimum Size Subarray Sum","shortMessageHtmlLink":"Create 209. Minimum Size Subarray Sum"}},{"before":"6ea33dca8c1bb0a21eb30d5c08eeccf5feb417f7","after":"cd52399c9b6737a919e0462bfc4f5b130b2bfc6f","ref":"refs/heads/main","pushedAt":"2023-05-14T15:40:53.500Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"a4ee98cc722d57b5d9febd35c79204e1d13973fd","after":"6ea33dca8c1bb0a21eb30d5c08eeccf5feb417f7","ref":"refs/heads/main","pushedAt":"2023-05-14T15:38:47.545Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Create 1498. Number of Subsequences That Satisfy the Given Sum Condition","shortMessageHtmlLink":"Create 1498. Number of Subsequences That Satisfy the Given Sum Condition"}},{"before":"5a1dc5375ebb352aed2fb56b9d692424c65cfe88","after":"a4ee98cc722d57b5d9febd35c79204e1d13973fd","ref":"refs/heads/main","pushedAt":"2023-05-01T09:18:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"803dd5355dc7d33d0d53bfa72248c35c66ebef3c","after":"5a1dc5375ebb352aed2fb56b9d692424c65cfe88","ref":"refs/heads/main","pushedAt":"2023-05-01T08:57:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Create 2657. Find the Prefix Common Array of Two Arrays","shortMessageHtmlLink":"Create 2657. Find the Prefix Common Array of Two Arrays"}},{"before":"b3f5608cc19c5e86328a4c7a0960301743ccb9ca","after":"803dd5355dc7d33d0d53bfa72248c35c66ebef3c","ref":"refs/heads/main","pushedAt":"2023-03-08T12:15:01.674Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Update README.md","shortMessageHtmlLink":"Update README.md"}},{"before":"b0fddcccfc1f622ca82c79a946ccb04244dd9d21","after":"b3f5608cc19c5e86328a4c7a0960301743ccb9ca","ref":"refs/heads/main","pushedAt":"2023-03-08T12:11:22.855Z","pushType":"push","commitsCount":1,"pusher":{"login":"rajatag03","name":"Rajat Agarwal","path":"/rajatag03","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36561091?s=80&v=4"},"commit":{"message":"Create 1129. Shortest Path with Alternating Colors","shortMessageHtmlLink":"Create 1129. Shortest Path with Alternating Colors"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEImhkagA","startCursor":null,"endCursor":null}},"title":"Activity · Algorithms-Made-Easy/Leetcode-Challenge"}