{"id":17822366,"url":"https://github.com/shiweihe0713/algorithms-made-easy","last_synced_at":"2026-01-30T14:19:40.895Z","repository":{"id":223558950,"uuid":"760880001","full_name":"ShiweiHe0713/Algorithms-Made-Easy","owner":"ShiweiHe0713","description":"Algorithm learning hub : show case the fundamental algorithms like sorting algorithms, such as generic sort, merge sort, quick sort, bucket sort, and radix sort, etc.","archived":false,"fork":false,"pushed_at":"2024-11-16T22:11:36.000Z","size":1159,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-02T16:03:38.569Z","etag":null,"topics":["algorithms","binary-search-tree","computer-science","data-structures","leetcode","sorting-algorithms","tree"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ShiweiHe0713.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-02-20T20:50:00.000Z","updated_at":"2024-11-16T22:11:39.000Z","dependencies_parsed_at":"2024-02-20T22:23:33.498Z","dependency_job_id":"a19caad0-2010-4b1f-9dfa-96b437a9a99d","html_url":"https://github.com/ShiweiHe0713/Algorithms-Made-Easy","commit_stats":null,"previous_names":["shiweihe0713/sort_algo_visualizer","shiweihe0713/sorting-algorithms-guide","shiweihe0713/fundamental-algorithms","shiweihe0713/algorithms-made-easy"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ShiweiHe0713/Algorithms-Made-Easy","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShiweiHe0713%2FAlgorithms-Made-Easy","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShiweiHe0713%2FAlgorithms-Made-Easy/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShiweiHe0713%2FAlgorithms-Made-Easy/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShiweiHe0713%2FAlgorithms-Made-Easy/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ShiweiHe0713","download_url":"https://codeload.github.com/ShiweiHe0713/Algorithms-Made-Easy/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShiweiHe0713%2FAlgorithms-Made-Easy/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28914037,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-30T12:13:43.263Z","status":"ssl_error","status_checked_at":"2026-01-30T12:13:22.389Z","response_time":66,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","binary-search-tree","computer-science","data-structures","leetcode","sorting-algorithms","tree"],"created_at":"2024-10-27T17:40:08.482Z","updated_at":"2026-01-30T14:19:40.853Z","avatar_url":"https://github.com/ShiweiHe0713.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode Grind\n\n\n## Tree\n- [606. Construct String from Binary Tree](3_trees/606_construct_string_from_binary_tree.py)\n- [1650. LCA of a Binary Tree](3_trees/1650_lca.py)\n- [314. Binary Tree Vertical Order Traversal](3_trees/314_binary_tree_vertical_order_traversal.py)\n[Tree doc in details](3_trees/Tree.md)\n\n## Todo\n- [ ] DFS inorder, postorder Traversal\n- [ ] BFS inorder, postorder Traversal\n- [ ] Figure Lambda function in [314. Binary Tree Vertical Order Traversal](3_trees/314_binary_tree_vertical_order_traversal.py)\n\n```python\n# A lambda function that adds 10 to its argument\nadd_ten = lambda x: x + 10\nprint(add_ten(5))  # Output: 15\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshiweihe0713%2Falgorithms-made-easy","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshiweihe0713%2Falgorithms-made-easy","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshiweihe0713%2Falgorithms-made-easy/lists"}