{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":512225470,"defaultBranch":"master","name":"algorithms","ownerLogin":"femifacia","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2022-07-09T15:52:49.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/72650419?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1700842806.0","currentOid":""},"activityList":{"items":[{"before":"bca7dfccd79bc0f014ea468083ea2aa05d0d6e71","after":"b2d5cf6937eed93ea106e0add5f79c9103ba78b0","ref":"refs/heads/windows","pushedAt":"2024-05-07T21:18:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] minimum number of steps to make two strings anagram with counter and frequency","shortMessageHtmlLink":"[ADD] minimum number of steps to make two strings anagram with counte…"}},{"before":"5b5100ddfd31a3fd92b37b98502b71ee68a86735","after":"bca7dfccd79bc0f014ea468083ea2aa05d0d6e71","ref":"refs/heads/windows","pushedAt":"2024-05-07T09:18:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] determine if halves are alike inn python and cpp; [ADD] cpp folder for algorithms","shortMessageHtmlLink":"[ADD] determine if halves are alike inn python and cpp; [ADD] cpp fol…"}},{"before":"8823121d59510c41cfa26cfb86f4386dd4a1a38f","after":"5b5100ddfd31a3fd92b37b98502b71ee68a86735","ref":"refs/heads/windows","pushedAt":"2024-03-31T13:35:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Two best non-overlapping events with bisect","shortMessageHtmlLink":"[ADD] Two best non-overlapping events with bisect"}},{"before":"e244e93ea17b0330511dd1acf590ed167b02b677","after":"8823121d59510c41cfa26cfb86f4386dd4a1a38f","ref":"refs/heads/windows","pushedAt":"2024-01-15T15:46:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] amount of time for binary tree to be infected with dfs and bfs","shortMessageHtmlLink":"[ADD] amount of time for binary tree to be infected with dfs and bfs"}},{"before":"4279927a15395332fa66321ab450681984ff4823","after":"e244e93ea17b0330511dd1acf590ed167b02b677","ref":"refs/heads/windows","pushedAt":"2024-01-15T15:33:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] arithmetic slices II","shortMessageHtmlLink":"[ADD] arithmetic slices II"}},{"before":"3946efa47b0596af72d5d7c057f586ee3c13a8fb","after":"4279927a15395332fa66321ab450681984ff4823","ref":"refs/heads/windows","pushedAt":"2024-01-15T14:50:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] maximum profit in job scheduling with bisection and dfs","shortMessageHtmlLink":"[ADD] maximum profit in job scheduling with bisection and dfs"}},{"before":"8bde4490d623e05cabf14e1f4070fd9a7c290fd3","after":"3946efa47b0596af72d5d7c057f586ee3c13a8fb","ref":"refs/heads/windows","pushedAt":"2024-01-08T19:51:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] special positions in a binary matrix","shortMessageHtmlLink":"[ADD] special positions in a binary matrix"}},{"before":"f6c6db883eca1e55f029b0e5c244caf9c0a99219","after":"8bde4490d623e05cabf14e1f4070fd9a7c290fd3","ref":"refs/heads/windows","pushedAt":"2024-01-08T19:05:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] minimum number of operations to make array empty","shortMessageHtmlLink":"[ADD] minimum number of operations to make array empty"}},{"before":"3f415361c7377d1dff47ec0c6dc542fd3544c115","after":"f6c6db883eca1e55f029b0e5c244caf9c0a99219","ref":"refs/heads/windows","pushedAt":"2024-01-08T18:36:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] number of laser beams in a bank","shortMessageHtmlLink":"[ADD] number of laser beams in a bank"}},{"before":"69e19eb4ce74504e318635e9f26603e24550e9c0","after":"3f415361c7377d1dff47ec0c6dc542fd3544c115","ref":"refs/heads/windows","pushedAt":"2024-01-08T18:32:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] convert an array into a 2D array with conditions using counter and hashset","shortMessageHtmlLink":"[ADD] convert an array into a 2D array with conditions using counter …"}},{"before":"ab23db99e8e8750e837bfc6d5266062fc5482716","after":"69e19eb4ce74504e318635e9f26603e24550e9c0","ref":"refs/heads/windows","pushedAt":"2024-01-08T18:28:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] excel sheet column number","shortMessageHtmlLink":"[ADD] excel sheet column number"}},{"before":"2a0d523806c082ea4ad52b69b3949a8027e5f917","after":"ab23db99e8e8750e837bfc6d5266062fc5482716","ref":"refs/heads/windows","pushedAt":"2024-01-08T18:24:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] destination city and kids with the greatest number of candies","shortMessageHtmlLink":"[ADD] destination city and kids with the greatest number of candies"}},{"before":"69832149e804acd5e7881b9c28cfba41a435dce6","after":"2a0d523806c082ea4ad52b69b3949a8027e5f917","ref":"refs/heads/windows","pushedAt":"2024-01-08T18:10:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] maximum score after splitting a string with prefix sum and counting method","shortMessageHtmlLink":"[ADD] maximum score after splitting a string with prefix sum and coun…"}},{"before":"ff7f81adff8a9e0c6008d1c4dd16c87645c817c2","after":"69832149e804acd5e7881b9c28cfba41a435dce6","ref":"refs/heads/windows","pushedAt":"2024-01-08T17:31:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] assign cookies with two pointers and sort method","shortMessageHtmlLink":"[ADD] assign cookies with two pointers and sort method"}},{"before":"9d52d8b99196dfc8b650e9384d51da5b48c8723c","after":"ff7f81adff8a9e0c6008d1c4dd16c87645c817c2","ref":"refs/heads/windows","pushedAt":"2024-01-08T17:23:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Excel sheet column title","shortMessageHtmlLink":"[ADD] Excel sheet column title"}},{"before":"28807033e3c96307533ea4fd13d70fff4be1897b","after":"9d52d8b99196dfc8b650e9384d51da5b48c8723c","ref":"refs/heads/windows","pushedAt":"2024-01-01T13:33:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] buy chocolates with sort and with one pass","shortMessageHtmlLink":"[ADD] buy chocolates with sort and with one pass"}},{"before":"c845253ca85221f70ab198bd54d804c4b3e4eb11","after":"28807033e3c96307533ea4fd13d70fff4be1897b","ref":"refs/heads/master","pushedAt":"2023-12-31T18:45:01.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Rank Transform of an Array","shortMessageHtmlLink":"[ADD] Rank Transform of an Array"}},{"before":"983243e8f55b0c8c2b31a3afed417498a1cbbfff","after":"28807033e3c96307533ea4fd13d70fff4be1897b","ref":"refs/heads/windows","pushedAt":"2023-12-31T18:44:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Rank Transform of an Array","shortMessageHtmlLink":"[ADD] Rank Transform of an Array"}},{"before":"293aeca9a76f5d396ea1d59b061442fd32d705d6","after":"983243e8f55b0c8c2b31a3afed417498a1cbbfff","ref":"refs/heads/windows","pushedAt":"2023-12-31T18:26:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Find Words Containing Character","shortMessageHtmlLink":"[ADD] Find Words Containing Character"}},{"before":"c845253ca85221f70ab198bd54d804c4b3e4eb11","after":"293aeca9a76f5d396ea1d59b061442fd32d705d6","ref":"refs/heads/windows","pushedAt":"2023-12-31T18:12:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Find Target Indices After Sorting Array with bisect and with count","shortMessageHtmlLink":"[ADD] Find Target Indices After Sorting Array with bisect and with count"}},{"before":"28d0e5c0e1f3764c4221221956719dd2dfae98b6","after":"c845253ca85221f70ab198bd54d804c4b3e4eb11","ref":"refs/heads/master","pushedAt":"2023-12-31T17:14:31.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Transpose Matrix with zip and pointers","shortMessageHtmlLink":"[ADD] Transpose Matrix with zip and pointers"}},{"before":"996095849cbcd5b5bf0bd5d00257ea6933a769d9","after":"c845253ca85221f70ab198bd54d804c4b3e4eb11","ref":"refs/heads/windows","pushedAt":"2023-12-31T17:14:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Transpose Matrix with zip and pointers","shortMessageHtmlLink":"[ADD] Transpose Matrix with zip and pointers"}},{"before":"fe3740df4eccc322deb6902f5c088e7cbcc0c410","after":"996095849cbcd5b5bf0bd5d00257ea6933a769d9","ref":"refs/heads/windows","pushedAt":"2023-12-31T15:02:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Find Words That Can Be Formed by Characters","shortMessageHtmlLink":"[ADD] Find Words That Can Be Formed by Characters"}},{"before":"28d0e5c0e1f3764c4221221956719dd2dfae98b6","after":"fe3740df4eccc322deb6902f5c088e7cbcc0c410","ref":"refs/heads/windows","pushedAt":"2023-12-31T14:23:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Check If Two String Arrays are Equivalent with join and two pointers method","shortMessageHtmlLink":"[ADD] Check If Two String Arrays are Equivalent with join and two poi…"}},{"before":"5c8004806857707b5de385dbfc57849bf3191b4f","after":"28d0e5c0e1f3764c4221221956719dd2dfae98b6","ref":"refs/heads/master","pushedAt":"2023-12-31T03:45:45.000Z","pushType":"push","commitsCount":8,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Element appearing more than 25% in sorted array","shortMessageHtmlLink":"[ADD] Element appearing more than 25% in sorted array"}},{"before":"1c45753ed0efaed365df020c186f03faf170a8c4","after":"28d0e5c0e1f3764c4221221956719dd2dfae98b6","ref":"refs/heads/windows","pushedAt":"2023-12-31T03:45:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Element appearing more than 25% in sorted array","shortMessageHtmlLink":"[ADD] Element appearing more than 25% in sorted array"}},{"before":"c34a37987cb7505977f30d95f3697c7b4ce67503","after":"1c45753ed0efaed365df020c186f03faf170a8c4","ref":"refs/heads/windows","pushedAt":"2023-12-31T03:36:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Largest Substring Between Two Equal Characters","shortMessageHtmlLink":"[ADD] Largest Substring Between Two Equal Characters"}},{"before":"6fdd2b4c63b7cca8ad53c4f86b6fb0ccade7dad0","after":"c34a37987cb7505977f30d95f3697c7b4ce67503","ref":"refs/heads/windows","pushedAt":"2023-12-31T03:00:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Maximum Product of Two Elements in an Array","shortMessageHtmlLink":"[ADD] Maximum Product of Two Elements in an Array"}},{"before":"bce105eb396c07302e78fc706142e830bd48f940","after":"6fdd2b4c63b7cca8ad53c4f86b6fb0ccade7dad0","ref":"refs/heads/windows","pushedAt":"2023-12-31T02:32:07.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] Maximum Product Difference Between Two Pairs","shortMessageHtmlLink":"[ADD] Maximum Product Difference Between Two Pairs"}},{"before":"e3152ef817cdf7e2db2ee4ca90f74971f5389a5f","after":"bce105eb396c07302e78fc706142e830bd48f940","ref":"refs/heads/windows","pushedAt":"2023-12-31T02:24:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"femifacia","name":"Facia Femi","path":"/femifacia","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/72650419?s=80&v=4"},"commit":{"message":"[ADD] redistribute charcaters to make all strings equal","shortMessageHtmlLink":"[ADD] redistribute charcaters to make all strings equal"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAERAMolQA","startCursor":null,"endCursor":null}},"title":"Activity · femifacia/algorithms"}