{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":402018765,"defaultBranch":"master","name":"cs","ownerLogin":"bl4de","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-09-01T10:22:09.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/3187617?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1630491729.909137","currentOid":""},"activityList":{"items":[{"before":"da7532c6d7bbc2db4e411462912cbf83e35ba42e","after":"214d6e4ce33b8b62d9aafd3bd41ff3ba70c671dd","ref":"refs/heads/master","pushedAt":"2024-04-21T07:28:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2287. Rearrange Characters to Make Target String - initial commit","shortMessageHtmlLink":"[LeetCode] 2287. Rearrange Characters to Make Target String - initial…"}},{"before":"9b8e78a25d0889539b30c274a277bed69be245e0","after":"da7532c6d7bbc2db4e411462912cbf83e35ba42e","ref":"refs/heads/master","pushedAt":"2024-04-19T13:42:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 3110. Score of a String - Python solution","shortMessageHtmlLink":"[LeetCode] 3110. Score of a String - Python solution"}},{"before":"0ee0441b6f2691c89dc65f072ad113035a7b8799","after":"9b8e78a25d0889539b30c274a277bed69be245e0","ref":"refs/heads/master","pushedAt":"2024-04-19T13:34:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 3110. Score of a String - initial commit","shortMessageHtmlLink":"[LeetCode] 3110. Score of a String - initial commit"}},{"before":"6f4423dd73594be50ff6fc3c03ae7d9fce78a08c","after":"0ee0441b6f2691c89dc65f072ad113035a7b8799","ref":"refs/heads/master","pushedAt":"2024-04-13T11:14:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2859. Sum of Values at Indices With K Set Bits - Python solution","shortMessageHtmlLink":"[LeetCode] 2859. Sum of Values at Indices With K Set Bits - Python so…"}},{"before":"222496d5664c674a07acd4dff6da779229cee19a","after":"6f4423dd73594be50ff6fc3c03ae7d9fce78a08c","ref":"refs/heads/master","pushedAt":"2024-04-13T11:01:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2859. Sum of Values at Indices With K Set Bits - initial commit","shortMessageHtmlLink":"[LeetCode] 2859. Sum of Values at Indices With K Set Bits - initial c…"}},{"before":"0b8f47dc8cf0037c8ddc7c223890393585736538","after":"222496d5664c674a07acd4dff6da779229cee19a","ref":"refs/heads/master","pushedAt":"2024-03-31T06:49:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2824. Count Pairs Whose Sum is Less than Target - Python solution","shortMessageHtmlLink":"[LeetCode] 2824. Count Pairs Whose Sum is Less than Target - Python s…"}},{"before":"9043b04b027701ce048fb9220be41fdef02794d5","after":"0b8f47dc8cf0037c8ddc7c223890393585736538","ref":"refs/heads/master","pushedAt":"2024-03-31T06:43:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2824. Count Pairs Whose Sum is Less than Target - initial commit","shortMessageHtmlLink":"[LeetCode] 2824. Count Pairs Whose Sum is Less than Target - initial …"}},{"before":"bf9611d5e967ff5b778df5b5bf906870cdf49073","after":"9043b04b027701ce048fb9220be41fdef02794d5","ref":"refs/heads/master","pushedAt":"2024-03-29T11:44:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2942. Find Words Containing Character - Python solution","shortMessageHtmlLink":"[LeetCode] 2942. Find Words Containing Character - Python solution"}},{"before":"f72b88acf24ff0a2d5c4ebfb68b4b1435718a2f2","after":"bf9611d5e967ff5b778df5b5bf906870cdf49073","ref":"refs/heads/master","pushedAt":"2024-03-28T16:32:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2942. Find Words Containing Character - initial commit","shortMessageHtmlLink":"[LeetCode] 2942. Find Words Containing Character - initial commit"}},{"before":"c94bd4923ba126aadb28d9739a8e4ba5724f57e4","after":"f72b88acf24ff0a2d5c4ebfb68b4b1435718a2f2","ref":"refs/heads/master","pushedAt":"2024-03-27T22:51:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2894. Divisible and Non-divisible Sums Difference - Python solution","shortMessageHtmlLink":"[LeetCode] 2894. Divisible and Non-divisible Sums Difference - Python…"}},{"before":"5d8fbb9a159cbe66578ebcac796687226ffd461b","after":"c94bd4923ba126aadb28d9739a8e4ba5724f57e4","ref":"refs/heads/master","pushedAt":"2024-03-27T22:46:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2894. Divisible and Non-divisible Sums Difference - initial commit","shortMessageHtmlLink":"[LeetCode] 2894. Divisible and Non-divisible Sums Difference - initia…"}},{"before":"02fcdcdf693fe299df87126a03c8175ac9571cb8","after":"5d8fbb9a159cbe66578ebcac796687226ffd461b","ref":"refs/heads/master","pushedAt":"2024-03-11T22:39:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2769. Find the Maximum Achievable Number - in progress","shortMessageHtmlLink":"[LeetCode] 2769. Find the Maximum Achievable Number - in progress"}},{"before":"c3da292d32c106e5aa4a012033eda55fade65aa5","after":"02fcdcdf693fe299df87126a03c8175ac9571cb8","ref":"refs/heads/master","pushedAt":"2024-03-11T22:35:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2769. Find the Maximum Achievable Number - initial commit","shortMessageHtmlLink":"[LeetCode] 2769. Find the Maximum Achievable Number - initial commit"}},{"before":"e9af92c50bc93f5c6d93360a68ede522cc6179af","after":"c3da292d32c106e5aa4a012033eda55fade65aa5","ref":"refs/heads/master","pushedAt":"2024-03-10T15:34:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2703. Return Length of Arguments Passed - JavaScript solution","shortMessageHtmlLink":"[LeetCode] 2703. Return Length of Arguments Passed - JavaScript solution"}},{"before":"6f8948047bb68c5eac4f4ca58edf181eead47260","after":"e9af92c50bc93f5c6d93360a68ede522cc6179af","ref":"refs/heads/master","pushedAt":"2024-03-10T15:30:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"removed Python solution for 2703 (it's JavaScript challenge :) )","shortMessageHtmlLink":"removed Python solution for 2703 (it's JavaScript challenge :) )"}},{"before":"9274c7134aaebe204f62cc2d2c1abce1ec40b299","after":"6f8948047bb68c5eac4f4ca58edf181eead47260","ref":"refs/heads/master","pushedAt":"2024-03-10T15:30:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2703. Return Length of Arguments Passed - initial commit","shortMessageHtmlLink":"[LeetCode] 2703. Return Length of Arguments Passed - initial commit"}},{"before":"f6de4aae5914de7b7ecc9cb70b2ae1012a3e310a","after":"9274c7134aaebe204f62cc2d2c1abce1ec40b299","ref":"refs/heads/master","pushedAt":"2024-03-10T15:29:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 2703. Return Length of Arguments Passed - initial commit","shortMessageHtmlLink":"[LeetCode] 2703. Return Length of Arguments Passed - initial commit"}},{"before":"33d78306b15d165beb174aabf725207f5ee90d32","after":"f6de4aae5914de7b7ecc9cb70b2ae1012a3e310a","ref":"refs/heads/master","pushedAt":"2024-03-05T18:44:17.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - Python solution","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"179154e7b8b7f81cf7ade68bf980ab4ab223f782","after":"33d78306b15d165beb174aabf725207f5ee90d32","ref":"refs/heads/master","pushedAt":"2024-03-05T18:43:35.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"Merge branch 'master' of https://github.com/bl4de/cs","shortMessageHtmlLink":"Merge branch 'master' of https://github.com/bl4de/cs"}},{"before":"fe340b4f61d9bac1e452ea4301fd0d51d76deeed","after":"179154e7b8b7f81cf7ade68bf980ab4ab223f782","ref":"refs/heads/master","pushedAt":"2024-03-05T18:37:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - in progress","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"0fffc7d1b298e2655be7e52edcf120ab1a1c32ef","after":"fe340b4f61d9bac1e452ea4301fd0d51d76deeed","ref":"refs/heads/master","pushedAt":"2024-03-05T18:34:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - in progress","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"1da9d45e6be017e4eacb1759cace5bc73b7f8a4d","after":"0fffc7d1b298e2655be7e52edcf120ab1a1c32ef","ref":"refs/heads/master","pushedAt":"2024-03-05T18:32:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - in progress","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"acedc4b159728b088c1a2c7870a22022fb41e5cb","after":"1da9d45e6be017e4eacb1759cace5bc73b7f8a4d","ref":"refs/heads/master","pushedAt":"2024-03-05T18:31:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - in progress","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"2b2e9358875fd1d33bedc29323105634673e01b3","after":"acedc4b159728b088c1a2c7870a22022fb41e5cb","ref":"refs/heads/master","pushedAt":"2024-03-05T18:30:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - in progress","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"4eb69bef148e533057e895ffa0e400905c30373f","after":"2b2e9358875fd1d33bedc29323105634673e01b3","ref":"refs/heads/master","pushedAt":"2024-03-05T18:23:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - in progress","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"ba3267906a369f2efcc77069b309fddd67cf7dfe","after":"4eb69bef148e533057e895ffa0e400905c30373f","ref":"refs/heads/master","pushedAt":"2024-03-05T18:18:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - in progress","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"3636b90c3ab43037ad84e9aeb9eafec176f29de0","after":"ba3267906a369f2efcc77069b309fddd67cf7dfe","ref":"refs/heads/master","pushedAt":"2024-03-05T18:06:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - in progress","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"b6a2a712877ae10a3ef6ec797e7add7f291fb0bc","after":"3636b90c3ab43037ad84e9aeb9eafec176f29de0","ref":"refs/heads/master","pushedAt":"2024-03-05T18:03:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 34. Find First and Last Position of Element in Sorted Array - initial commit","shortMessageHtmlLink":"[LeetCode] 34. Find First and Last Position of Element in Sorted Arra…"}},{"before":"7902385166f568f76f58dd13e876a14bd3209a9a","after":"b6a2a712877ae10a3ef6ec797e7add7f291fb0bc","ref":"refs/heads/master","pushedAt":"2024-03-03T16:40:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] Delete old 27. solution file","shortMessageHtmlLink":"[LeetCode] Delete old 27. solution file"}},{"before":"9cae6ffd49cfb9fa41b58e78b39300fc468420d8","after":"7902385166f568f76f58dd13e876a14bd3209a9a","ref":"refs/heads/master","pushedAt":"2024-03-03T16:31:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"bl4de","name":"Rafal Janicki","path":"/bl4de","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/3187617?s=80&v=4"},"commit":{"message":"[LeetCode] 27. Remove Element - in progress","shortMessageHtmlLink":"[LeetCode] 27. Remove Element - in progress"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAENihYlgA","startCursor":null,"endCursor":null}},"title":"Activity · bl4de/cs"}