{"id":20637510,"url":"https://github.com/mohamedhany99/finding-maximum-depth-of-binary-tree-leetcode-problem-solution","last_synced_at":"2026-06-04T19:31:31.556Z","repository":{"id":173113209,"uuid":"536562826","full_name":"Mohamedhany99/Finding-maximum-depth-of-binary-tree-LeetCode-problem-solution","owner":"Mohamedhany99","description":"The solution of LeetCode Problem \"finding maximum depth of binary tree\" a top interview questions list developed in python python3","archived":false,"fork":false,"pushed_at":"2022-09-14T12:17:59.000Z","size":0,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-12-08T07:49:48.266Z","etag":null,"topics":["leetcode","leetcode-practice","leetcode-python","leetcode-questions","leetcode-solutions","problem-solving","problemsolving","python","python-3","python-script","python3","technical-coding-interview","technical-interviews","technical-test"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Mohamedhany99.png","metadata":{"files":{"readme":null,"changelog":null,"contributing":null,"funding":null,"license":null,"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":"2022-09-14T12:15:58.000Z","updated_at":"2023-03-08T00:23:19.000Z","dependencies_parsed_at":null,"dependency_job_id":"09bfd12a-ef4e-414e-b40b-363d037a02a4","html_url":"https://github.com/Mohamedhany99/Finding-maximum-depth-of-binary-tree-LeetCode-problem-solution","commit_stats":null,"previous_names":["mohamedhany99/finding-maximum-depth-of-binary-tree-leetcode-problem-solution"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Mohamedhany99/Finding-maximum-depth-of-binary-tree-LeetCode-problem-solution","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mohamedhany99%2FFinding-maximum-depth-of-binary-tree-LeetCode-problem-solution","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mohamedhany99%2FFinding-maximum-depth-of-binary-tree-LeetCode-problem-solution/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mohamedhany99%2FFinding-maximum-depth-of-binary-tree-LeetCode-problem-solution/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mohamedhany99%2FFinding-maximum-depth-of-binary-tree-LeetCode-problem-solution/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Mohamedhany99","download_url":"https://codeload.github.com/Mohamedhany99/Finding-maximum-depth-of-binary-tree-LeetCode-problem-solution/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Mohamedhany99%2FFinding-maximum-depth-of-binary-tree-LeetCode-problem-solution/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33917183,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-04T02:00:06.755Z","response_time":64,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["leetcode","leetcode-practice","leetcode-python","leetcode-questions","leetcode-solutions","problem-solving","problemsolving","python","python-3","python-script","python3","technical-coding-interview","technical-interviews","technical-test"],"created_at":"2024-11-16T15:14:46.949Z","updated_at":"2026-06-04T19:31:31.550Z","avatar_url":"https://github.com/Mohamedhany99.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmohamedhany99%2Ffinding-maximum-depth-of-binary-tree-leetcode-problem-solution","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmohamedhany99%2Ffinding-maximum-depth-of-binary-tree-leetcode-problem-solution","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmohamedhany99%2Ffinding-maximum-depth-of-binary-tree-leetcode-problem-solution/lists"}