{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":52999018,"defaultBranch":"master","name":"grokking_algorithms","ownerLogin":"egonSchiele","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2016-03-02T21:50:52.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/97219?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1456956234.0","currentOid":""},"activityList":{"items":[{"before":"f7ccf02e001c06f39a65684bfd3540c0f8476ba7","after":"775022b848df1b0afb9145363ec0145eab7a92e7","ref":"refs/heads/master","pushedAt":"2024-03-22T20:10:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"typo","shortMessageHtmlLink":"typo"}},{"before":"256625afd77769b3c60acf1c53606fd654f5522c","after":"f7ccf02e001c06f39a65684bfd3540c0f8476ba7","ref":"refs/heads/master","pushedAt":"2024-03-22T20:10:03.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Array variable (#259)\n\nThe array is set in one place.","shortMessageHtmlLink":"Array variable (#259)"}},{"before":"cfb59254fbb5ab2774592ab8a730c9dc55f24d95","after":"256625afd77769b3c60acf1c53606fd654f5522c","ref":"refs/heads/master","pushedAt":"2024-03-22T20:06:55.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"fix recursive solution for binary search in python (#279)","shortMessageHtmlLink":"fix recursive solution for binary search in python (#279)"}},{"before":"11a2de7473807093fe4c4a1b5b256a399734ba8a","after":"cfb59254fbb5ab2774592ab8a730c9dc55f24d95","ref":"refs/heads/master","pushedAt":"2024-03-22T20:04:27.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"04 recursive_max in C (#278)","shortMessageHtmlLink":"04 recursive_max in C (#278)"}},{"before":"5d068870bf5ca10bfada3a409dce67005968ae8b","after":"11a2de7473807093fe4c4a1b5b256a399734ba8a","ref":"refs/heads/master","pushedAt":"2024-03-22T20:03:28.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Update 01_longest_common_subsequence.py (#277)\n\nThe original code was creating a 4x5 grid instead of 5x4. I also made it display by row.\r\n\r\nCo-authored-by: WhileRested <148598154+WhileRested@users.noreply.github.com>","shortMessageHtmlLink":"Update 01_longest_common_subsequence.py (#277)"}},{"before":"7d166566745de9f32cef6ff38ba765578147365a","after":"5d068870bf5ca10bfada3a409dce67005968ae8b","ref":"refs/heads/master","pushedAt":"2024-03-22T20:02:03.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Update 02_longest_common_substring.py (#276)\n\nThe original code did not work correctly out of the box. It generated a (4,5) grid instead of a (5,4) grid as the book's answer grid shows. Also on line 10 of my code I changed `dp_table[i-1][i-1] + 1` to `dp_table[i-1][j-1] +1`. I also updated the display to display by row.\r\n\r\nCo-authored-by: WhileRested <148598154+WhileRested@users.noreply.github.com>","shortMessageHtmlLink":"Update 02_longest_common_substring.py (#276)"}},{"before":"cf6b035069742a28aad703d53a57f2aaf19f480c","after":"7d166566745de9f32cef6ff38ba765578147365a","ref":"refs/heads/master","pushedAt":"2024-03-22T19:51:00.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Add a solution to the problem on Kotlin (#269)\n\n* Solution. Longest Common Subsequence","shortMessageHtmlLink":"Add a solution to the problem on Kotlin (#269)"}},{"before":"933acafaf3efbf474bcd35b1a7bbc01efb418d99","after":"cf6b035069742a28aad703d53a57f2aaf19f480c","ref":"refs/heads/master","pushedAt":"2024-03-22T19:50:11.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Add Dijkstra's algorithm to Kotlin (#268)","shortMessageHtmlLink":"Add Dijkstra's algorithm to Kotlin (#268)"}},{"before":"9306432a1b51dce356bf90b1e3db03749da13f0f","after":"933acafaf3efbf474bcd35b1a7bbc01efb418d99","ref":"refs/heads/master","pushedAt":"2023-08-09T13:20:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"reorg and add code for second edition","shortMessageHtmlLink":"reorg and add code for second edition"}},{"before":"8969269a10e2ed194b9b8b163ff91f2a75bee6c6","after":"9306432a1b51dce356bf90b1e3db03749da13f0f","ref":"refs/heads/master","pushedAt":"2023-08-08T23:11:22.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Update 05_quicksort.kt (#267)\n\nremove unnecessary line","shortMessageHtmlLink":"Update 05_quicksort.kt (#267)"}},{"before":"3e99cccfc08b22895de53218e94401504f94a6b0","after":"8969269a10e2ed194b9b8b163ff91f2a75bee6c6","ref":"refs/heads/master","pushedAt":"2023-08-08T23:10:53.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Update 04_recursive_max.kt (#266)\n\nadd an argument to when block","shortMessageHtmlLink":"Update 04_recursive_max.kt (#266)"}},{"before":"182f89b2c4435e614bd9e208c153b4a06efccc03","after":"3e99cccfc08b22895de53218e94401504f94a6b0","ref":"refs/heads/master","pushedAt":"2023-08-08T23:10:15.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Added Dart examples for chapter 3 to chapter 9 (#265)\n\n* fix: corrected method return value following Dart's newest linter version\r\n\r\n* feat: added Dart recursion examples for chapter 3\r\n\r\n* feat: added quicksort example in Dart for chapter 4\r\n\r\n* feat: added examples in Dart for the chapter 5\r\n\r\n* feat: added Dart example for chapter 6 bfs\r\n\r\n* feat: added djikstra example in Dart for chapter 7\r\n\r\n* feat: added example of set covering in Dart for chapter 8\r\n\r\n* feat: added examples for dynamic programming in dart for chapter 9","shortMessageHtmlLink":"Added Dart examples for chapter 3 to chapter 9 (#265)"}},{"before":"022d97a56d3e4b56dce958b55f9652660717d292","after":"182f89b2c4435e614bd9e208c153b4a06efccc03","ref":"refs/heads/master","pushedAt":"2023-08-08T23:09:34.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"square brackets fix (#263)","shortMessageHtmlLink":"square brackets fix (#263)"}},{"before":"4dddd5aa830040e9525ba34b30314f6e34560ec8","after":"022d97a56d3e4b56dce958b55f9652660717d292","ref":"refs/heads/master","pushedAt":"2023-07-19T15:56:40.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Add examples on scheme. Chapters: 1, 2 (#258)\n\n* add 01_binary_search.scm in 01_introduction_to_algorithms\r\n\r\n* any fix\r\n\r\n* add 01_selection_sort.scm to 02_selection_sort\r\n\r\n* any fix","shortMessageHtmlLink":"Add examples on scheme. Chapters: 1, 2 (#258)"}},{"before":"7620449322d93beb2c62c3226e3851f867bf4e5f","after":"4dddd5aa830040e9525ba34b30314f6e34560ec8","ref":"refs/heads/master","pushedAt":"2023-07-19T15:56:17.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Update 05_quicksort.swift (#257)","shortMessageHtmlLink":"Update 05_quicksort.swift (#257)"}},{"before":"60b34a01d56d11d621e70f386cdfca3af5455c56","after":"7620449322d93beb2c62c3226e3851f867bf4e5f","ref":"refs/heads/master","pushedAt":"2023-07-19T15:53:24.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Added R version of the binary_search function (#253)","shortMessageHtmlLink":"Added R version of the binary_search function (#253)"}},{"before":"f6cd99c88be4aa19fd761b880f8e9353d4bf9092","after":"60b34a01d56d11d621e70f386cdfca3af5455c56","ref":"refs/heads/master","pushedAt":"2023-07-19T15:53:01.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Line removed (#252)\n\n* Added #include to support the use of INT_MAX\r\n\r\n* Removed unnecesary (and maybe confusing) initialization of the set","shortMessageHtmlLink":"Line removed (#252)"}},{"before":"4d324e464d40d91888492b81b099a8a714879bb9","after":"f6cd99c88be4aa19fd761b880f8e9353d4bf9092","ref":"refs/heads/master","pushedAt":"2023-07-19T15:51:46.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Create 04_recursive_max.py (#249)\n\nProblem with max definition. If in input list last element is the biggest, the present algorithm is'n count it. I solved this problem by changing the return in the case if length == 1 from return 1 to first element of list.","shortMessageHtmlLink":"Create 04_recursive_max.py (#249)"}},{"before":"ed5a723fa5782057f604be2156a643fff3faf168","after":"4d324e464d40d91888492b81b099a8a714879bb9","ref":"refs/heads/master","pushedAt":"2023-07-19T15:51:10.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"small refactoring for better code readability (#247)","shortMessageHtmlLink":"small refactoring for better code readability (#247)"}},{"before":"f53fe3b98abfc85b0d9201747caf0f6959ae7cfe","after":"ed5a723fa5782057f604be2156a643fff3faf168","ref":"refs/heads/master","pushedAt":"2023-07-19T15:49:54.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"Csharp updates for 4, 9 chapters (#245)\n\n* GetGCDList fix\r\n\r\n* Csharp longest_common_subsequence update\r\n\r\n* Csharp levenshtein added\r\n\r\n* Couple changes in levenshtein","shortMessageHtmlLink":"Csharp updates for 4, 9 chapters (#245)"}},{"before":"fa75dc144dd52c906543f1fe5e40e49b5e8d343c","after":"f53fe3b98abfc85b0d9201747caf0f6959ae7cfe","ref":"refs/heads/master","pushedAt":"2023-07-19T15:49:01.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"egonSchiele","name":"Aditya Bhargava","path":"/egonSchiele","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/97219?s=80&v=4"},"commit":{"message":"SelectionSort csharp using array as input (#226)\n\nCo-authored-by: Pere ","shortMessageHtmlLink":"SelectionSort csharp using array as input (#226)"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEHRlizQA","startCursor":null,"endCursor":null}},"title":"Activity ยท egonSchiele/grokking_algorithms"}