{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":148641954,"defaultBranch":"master","name":"Rust","ownerLogin":"TheAlgorithms","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2018-09-13T13:29:27.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/20487725?v=4","public":true,"private":false,"isOrgOwned":true},"refInfo":{"name":"","listCacheKey":"v0:1719249315.0","currentOid":""},"activityList":{"items":[{"before":"510bbb3c78b685d3a4a5d1f517b91e125714f6a4","after":"218c4a8758667fc6d3784bda563fbe1e98fc04b4","ref":"refs/heads/master","pushedAt":"2024-07-01T15:52:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Update DIRECTORY.md [skip actions]","shortMessageHtmlLink":"Update DIRECTORY.md [skip actions]"}},{"before":"f8096d2cb5acb11bd717fca657cdb31dc6b0368e","after":"510bbb3c78b685d3a4a5d1f517b91e125714f6a4","ref":"refs/heads/master","pushedAt":"2024-07-01T15:52:35.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Implement Graph Coloring using Backtracking (#737)\n\n* feat: implement Graph Coloring\r\n\r\n* ref: refactor implementation\r\n- Use `Vec>` to represent the adjacency matrix to make the code more readable and slightly more efficient in terms of memory usage.\r\n- Use `std::mem::take` to avoid unnecessary cloning while maintaining the original behavior of the algorithm\r\n- Add some edge tests\r\n\r\n* ref: refactor implementation\r\n- Add custom error `GraphColoringError` to handle the exceptional cases where the graph is empty or not squared\r\n- Adjust the `is_valid_color` method to make the implementation handle the directed graphs\r\n- Add tests for directed graphs\r\n\r\n* chore: rename `adj_matrix` to `adjacency_matrix`\r\n\r\n* chore: rename custom error variants\r\n\r\n* chore: add some more tests\r\n\r\n* chore: use 0 as first color\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Implement Graph Coloring using Backtracking (#737)"}},{"before":"c50248426b94daabe199b1fa657a3153483f1684","after":"f8096d2cb5acb11bd717fca657cdb31dc6b0368e","ref":"refs/heads/master","pushedAt":"2024-06-26T06:54:30.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refactor NQueens implementation (#732)\n\n* ref: refactor NQueens implementation\r\n- Rewrite `NQueensSolver` in OOP style\r\n- Use `n_queens_solver` method to hide internal state of `NQueensSolver` object\r\n- Add Rust docstrings\r\n- Write parametrized tests, add 6x6 case\r\n\r\n* ref: refactor implementation\r\n- Simplified the `NQueensSolver` struct initialization\r\n- Streamlined the `is_safe` method\r\n- Minor formatting changes\r\n\r\n* ref: update implementation\r\n- Use `std::mem::take()` instead of `clone`\r\n- Rewrite tests\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Refactor NQueens implementation (#732)"}},{"before":"6b03c8d79f504b9c6f92e3048a57c4bcb9a5d5bb","after":null,"ref":"refs/heads/dependabot/cargo/nalgebra-0.33.0","pushedAt":"2024-06-24T17:15:15.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"}},{"before":"d30b5b51c4943dc143d54c7b86c24fde3f34979b","after":"c50248426b94daabe199b1fa657a3153483f1684","ref":"refs/heads/master","pushedAt":"2024-06-24T17:15:14.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"chore(deps): update nalgebra requirement from 0.32.3 to 0.33.0 (#758)\n\nUpdates the requirements on [nalgebra](https://github.com/dimforge/nalgebra) to permit the latest version.\r\n- [Changelog](https://github.com/dimforge/nalgebra/blob/main/CHANGELOG.md)\r\n- [Commits](https://github.com/dimforge/nalgebra/commits)\r\n\r\n---\r\nupdated-dependencies:\r\n- dependency-name: nalgebra\r\n dependency-type: direct:production\r\n...\r\n\r\nSigned-off-by: dependabot[bot] \r\nCo-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com>","shortMessageHtmlLink":"chore(deps): update nalgebra requirement from 0.32.3 to 0.33.0 (#758)"}},{"before":null,"after":"6b03c8d79f504b9c6f92e3048a57c4bcb9a5d5bb","ref":"refs/heads/dependabot/cargo/nalgebra-0.33.0","pushedAt":"2024-06-24T16:41:16.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"dependabot[bot]","name":null,"path":"/apps/dependabot","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/29110?s=80&v=4"},"commit":{"message":"chore(deps): update nalgebra requirement from 0.32.3 to 0.33.0\n\nUpdates the requirements on [nalgebra](https://github.com/dimforge/nalgebra) to permit the latest version.\n- [Changelog](https://github.com/dimforge/nalgebra/blob/main/CHANGELOG.md)\n- [Commits](https://github.com/dimforge/nalgebra/commits)\n\n---\nupdated-dependencies:\n- dependency-name: nalgebra\n dependency-type: direct:production\n...\n\nSigned-off-by: dependabot[bot] ","shortMessageHtmlLink":"chore(deps): update nalgebra requirement from 0.32.3 to 0.33.0"}},{"before":"081b61f47d3725289945ca2655515a69cc6ea560","after":"d30b5b51c4943dc143d54c7b86c24fde3f34979b","ref":"refs/heads/master","pushedAt":"2024-06-21T15:15:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Update DIRECTORY.md [skip actions]","shortMessageHtmlLink":"Update DIRECTORY.md [skip actions]"}},{"before":"afdb28354c6833335ca6abd51912e6e659dcaea4","after":"081b61f47d3725289945ca2655515a69cc6ea560","ref":"refs/heads/master","pushedAt":"2024-06-21T15:14:54.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Implement Hamiltonian Cycle Finder (#731)\n\n* feat: implement Hamiltonian Cycle\r\n\r\n* ref: refactor implementation\r\n- Add custom error `AdjMatError` type with 3 varients: `EmptyMat`, `StartOutOfBound` and `ImproperMat`\r\n- Add tests for exceptional cases\r\n- Change adjaceny matrix repr to `Vec>`\r\n\r\n* feat: refactor implementation\r\n- Move error handling to appropriate methods\r\n- Add `num_vertices` method\r\n\r\n* ref: refactor implementation\r\n- Rename custom error to more related name, from `AdjMatError` to `FindHamiltonialCycleError`\r\n- Use `HashSet` to retrieve visited vextex in `O(1)` time\r\n- Chain method when propagating error\r\n- Add test for directed graph\r\n\r\n* ref: refactor implementation\r\n- Write error names in full word format\r\n- Use `Vec` to store visited vertices\r\n- Represent path as `Vec>` where the undefined vertex is represented as `None`\r\n- Add suggested tests\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Implement Hamiltonian Cycle Finder (#731)"}},{"before":"f164e8178dd617a5edac4b2cd8bfee118910949e","after":"afdb28354c6833335ca6abd51912e6e659dcaea4","ref":"refs/heads/master","pushedAt":"2024-06-20T15:26:07.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"style: include `legacy_numeric_constants` (#755)","shortMessageHtmlLink":"style: include legacy_numeric_constants (#755)"}},{"before":"bf9d9c1c7d1d0089f1e2a7d934d50f13338d3629","after":"f164e8178dd617a5edac4b2cd8bfee118910949e","ref":"refs/heads/master","pushedAt":"2024-06-20T07:44:01.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"style: suppress some new clippy lints (#754)\n\n* style: suppress `integer_division_remainder_used`\r\n\r\n* style: suppress `legacy_numeric_constants`","shortMessageHtmlLink":"style: suppress some new clippy lints (#754)"}},{"before":"8b6ffe3a2ab63197e3265422bb056faa32ec4a80","after":"bf9d9c1c7d1d0089f1e2a7d934d50f13338d3629","ref":"refs/heads/master","pushedAt":"2024-06-17T18:11:33.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"style: include `redundant_pub_crate` (#753)","shortMessageHtmlLink":"style: include redundant_pub_crate (#753)"}},{"before":"20df571943903dd32aedb258cfd519dff07ee570","after":"8b6ffe3a2ab63197e3265422bb056faa32ec4a80","ref":"refs/heads/master","pushedAt":"2024-06-17T17:42:14.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"style: include `unnecessary_join` (#752)","shortMessageHtmlLink":"style: include unnecessary_join (#752)"}},{"before":"08ce80c46e4eb74524bfc246f45ac05c61161356","after":"20df571943903dd32aedb258cfd519dff07ee570","ref":"refs/heads/master","pushedAt":"2024-06-16T12:43:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"github-actions[bot]","name":null,"path":"/apps/github-actions","primaryAvatarUrl":"https://avatars.githubusercontent.com/in/15368?s=80&v=4"},"commit":{"message":"Update DIRECTORY.md [skip actions]","shortMessageHtmlLink":"Update DIRECTORY.md [skip actions]"}},{"before":"1444e63bef28e03ed548a02c7444b106778395fe","after":"08ce80c46e4eb74524bfc246f45ac05c61161356","ref":"refs/heads/master","pushedAt":"2024-06-16T12:42:49.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Implement Rat in Maze Path Finder (#730)\n\n* feat: implement Rat in Maze\r\n\r\n* ref: rewrite tests using macro\r\n\r\n* chore(docs): add `rat_in_maze` to `DIRECTORY.md`\r\n\r\n* fix: fix clippy issues\r\n\r\n* chore(ref): update implementation\r\n- Remove bad comments\r\n- Add some tests\r\n\r\n* ref: handle improper maze\r\n\r\n* ref: change `maze` representation from `Vec>` to `Vec>`\r\n\r\n* ref: refactor maze cell validation for clarity and efficiency\r\n\r\n* ref: refactor rat in maze implementation\r\n- Add custom errors to handle various exception cases: empty maze,\r\n non-rectangle maze, start out of maze bound\r\n- Add edge tests to handle various types of maze\r\n\r\n* ref: update implementation\r\n- Add `maze_with_going_back` test\r\n- Add explaination of why return this solution and not the other one when multiple path exist in maze\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Implement Rat in Maze Path Finder (#730)"}},{"before":"ea72bc8bb6534366ea60e5c01dd3698233dca021","after":"1444e63bef28e03ed548a02c7444b106778395fe","ref":"refs/heads/master","pushedAt":"2024-06-16T12:41:01.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"style: include `needless_collect` (#751)","shortMessageHtmlLink":"style: include needless_collect (#751)"}},{"before":"57b2c5ff2136448e589be8b9f8a0a7bbd539d97b","after":"ea72bc8bb6534366ea60e5c01dd3698233dca021","ref":"refs/heads/master","pushedAt":"2024-06-15T13:50:59.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"style: incldue `explicit_into_iter_loop` (#749)","shortMessageHtmlLink":"style: incldue explicit_into_iter_loop (#749)"}},{"before":"864ef42a427cb1f841d85c60b96c01c63154e54c","after":"57b2c5ff2136448e589be8b9f8a0a7bbd539d97b","ref":"refs/heads/master","pushedAt":"2024-06-15T13:50:47.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Fixed `gcd_extended` and `mod_inverse` for modular exponential (#750)","shortMessageHtmlLink":"Fixed gcd_extended and mod_inverse for modular exponential (#750)"}},{"before":"717c266dcf4adc720983a84fd8a8603c1ed51b14","after":"864ef42a427cb1f841d85c60b96c01c63154e54c","ref":"refs/heads/master","pushedAt":"2024-06-13T16:56:33.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"fixed small bug in quick select algorithm (#727)","shortMessageHtmlLink":"fixed small bug in quick select algorithm (#727)"}},{"before":"0cc792c3aae3d28da253ec6ae51755ad0814679a","after":"717c266dcf4adc720983a84fd8a8603c1ed51b14","ref":"refs/heads/master","pushedAt":"2024-06-13T16:49:03.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"style: include `needless_pass_by_ref_mut` (#748)","shortMessageHtmlLink":"style: include needless_pass_by_ref_mut (#748)"}},{"before":"ade43ce3bc8376f5729d9457f28adfc21fe32c02","after":"0cc792c3aae3d28da253ec6ae51755ad0814679a","ref":"refs/heads/master","pushedAt":"2024-06-12T18:22:06.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"style: include `useless_let_if_seq` (#746)","shortMessageHtmlLink":"style: include useless_let_if_seq (#746)"}},{"before":"2544d28341c1629fba9dfe7daa64d5631a807886","after":"ade43ce3bc8376f5729d9457f28adfc21fe32c02","ref":"refs/heads/master","pushedAt":"2024-06-12T06:08:30.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"style: cleanup `run_length_encoding.rs` (#744)\n\n* style: include `string_to_string`\r\n\r\n* style: reduce code duplication\r\n\r\n* style: empty input is a regular input","shortMessageHtmlLink":"style: cleanup run_length_encoding.rs (#744)"}},{"before":"135ae0387e5c66ef66e946dc6cee9f6a3c03a9e6","after":"2544d28341c1629fba9dfe7daa64d5631a807886","ref":"refs/heads/master","pushedAt":"2024-06-11T16:13:55.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"style: make clippy more strict (#743)","shortMessageHtmlLink":"style: make clippy more strict (#743)"}},{"before":"53bc5069b0b5433c280b640dc3d4197bfc853448","after":"135ae0387e5c66ef66e946dc6cee9f6a3c03a9e6","ref":"refs/heads/master","pushedAt":"2024-06-07T17:01:30.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"chore: add `map_unwrap_or` warning (#739)","shortMessageHtmlLink":"chore: add map_unwrap_or warning (#739)"}},{"before":"0b8ba068a0ac74419eb1e707082821e3e728bcea","after":"53bc5069b0b5433c280b640dc3d4197bfc853448","ref":"refs/heads/master","pushedAt":"2024-06-06T20:10:22.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Fix uninlined format args (#738)\n\n* style: inline format args\r\n\r\n* chore: add `uninlined_format_args` warning","shortMessageHtmlLink":"Fix uninlined format args (#738)"}},{"before":"2545e0ee86c023853af10ef2aac1d2c31ea76d71","after":"0b8ba068a0ac74419eb1e707082821e3e728bcea","ref":"refs/heads/master","pushedAt":"2024-06-05T20:36:20.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"siriak","name":"Andrii Siriak","path":"/siriak","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/29201949?s=80&v=4"},"commit":{"message":"chore: cleanup gitpod setup (#736)","shortMessageHtmlLink":"chore: cleanup gitpod setup (#736)"}},{"before":"46a50553dcc86fa1c54c1f3569fa7b11acb90e24","after":"2545e0ee86c023853af10ef2aac1d2c31ea76d71","ref":"refs/heads/master","pushedAt":"2024-06-04T15:02:08.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refactor UnionFind (#729)\n\n* ref: refactor UnionFind\r\n\r\n* chore: replace `if else` by `match`","shortMessageHtmlLink":"Refactor UnionFind (#729)"}},{"before":"1d9c510e9ce798617a311182b86bc4e9d0e80e0f","after":"46a50553dcc86fa1c54c1f3569fa7b11acb90e24","ref":"refs/heads/master","pushedAt":"2024-06-02T19:22:21.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refactor sieve of Eratosthenes implementation (#724)\n\n* ref: refactor sieve of eratosthenes implementation\r\n\r\n* chore: fix clippy warning\r\n\r\n* ref: optimize implementation a bit more\r\n\r\n* chore(tests): add tests of 2 and 1000\r\n\r\n* chore: format code\r\n\r\n* refactor: reoragnise tests\r\n\r\n---------\r\n\r\nCo-authored-by: vil02 ","shortMessageHtmlLink":"Refactor sieve of Eratosthenes implementation (#724)"}},{"before":"4e5964533aac18a7bfec8be05107a0ecb80f9a00","after":"1d9c510e9ce798617a311182b86bc4e9d0e80e0f","ref":"refs/heads/master","pushedAt":"2024-05-28T16:15:56.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"chore: add cargo to dependabot (#728)","shortMessageHtmlLink":"chore: add cargo to dependabot (#728)"}},{"before":"c2009cd31ea0d5171ce1c12b4c3742a2676cd07e","after":"4e5964533aac18a7bfec8be05107a0ecb80f9a00","ref":"refs/heads/master","pushedAt":"2024-05-28T07:22:04.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"Refactor Binary Search (#722)\n\n* ref: refactor binary search\r\n- Simplyfy implementation logic\r\n- Add docstring\r\n- Rewrite tests using macro\r\n\r\n* ref: eliminate nested match statements\r\n\r\n* ref(tests): add suggested tests\r\n\r\n---------\r\n\r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"Refactor Binary Search (#722)"}},{"before":"bba0b0dc929d15110538c70c4582b6190c0436a5","after":"c2009cd31ea0d5171ce1c12b4c3742a2676cd07e","ref":"refs/heads/master","pushedAt":"2024-05-23T20:53:14.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"vil02","name":"Piotr Idzik","path":"/vil02","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/65706193?s=80&v=4"},"commit":{"message":"feat: add `multiply.rs` (#716)\n\n* add multiply.rs\r\n\r\n* Optimized code\r\n\r\n* Remove redundant references\r\n\r\n* modify test\r\n\r\n* modify test name\r\n\r\n* modify code\r\n\r\n* Determine the legitimacy of a string\r\n\r\n* Modify judgment conditions\r\n\r\n* Optimization code\r\n\r\n* modify code\r\n\r\n---------\r\n\r\nCo-authored-by: mengfansheng \r\nCo-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>","shortMessageHtmlLink":"feat: add multiply.rs (#716)"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEc_H4QgA","startCursor":null,"endCursor":null}},"title":"Activity ยท TheAlgorithms/Rust"}