{"id":23910829,"url":"https://github.com/sandip-kanzariya/gfg-leetcode","last_synced_at":"2025-08-27T11:20:17.763Z","repository":{"id":189446502,"uuid":"680535045","full_name":"Sandip-Kanzariya/GFG-LeetCode","owner":"Sandip-Kanzariya","description":"Solution Of GFG \u0026 LeetCode Questions ","archived":false,"fork":false,"pushed_at":"2025-01-10T16:53:17.000Z","size":1004,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-10T18:52:59.831Z","etag":null,"topics":["gfg-potd","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"C++","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/Sandip-Kanzariya.png","metadata":{"files":{"readme":"README.md","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":"2023-08-19T15:01:53.000Z","updated_at":"2025-01-10T16:53:19.000Z","dependencies_parsed_at":"2023-08-20T06:37:37.372Z","dependency_job_id":"12593f92-1791-4f6e-8165-efa9123ddc78","html_url":"https://github.com/Sandip-Kanzariya/GFG-LeetCode","commit_stats":null,"previous_names":["sandip-kanzariya/leetcode","sandip-kanzariya/gfg"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sandip-Kanzariya%2FGFG-LeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sandip-Kanzariya%2FGFG-LeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sandip-Kanzariya%2FGFG-LeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Sandip-Kanzariya%2FGFG-LeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Sandip-Kanzariya","download_url":"https://codeload.github.com/Sandip-Kanzariya/GFG-LeetCode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240347984,"owners_count":19787237,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["gfg-potd","leetcode-solutions"],"created_at":"2025-01-05T07:28:25.403Z","updated_at":"2025-02-23T17:17:05.913Z","avatar_url":"https://github.com/Sandip-Kanzariya.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# GFG\nSolution Of GFG Questions \n\n# Tree \n|Question|Problem|\n|---|---|\n|Height of Binary Tree |[GFG](https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1)|\n|Balanced Binary Tree |[GFG](https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1), [LeetCode](https://leetcode.com/problems/balanced-binary-tree/description/)|\n\n#### Level Ordered Travesal in BT : BFS \n|Question|Problem|\n|---|---|\n|Level Ordered travesal||\n|Find level of each Leaf node|[GFG](https://practice.geeksforgeeks.org/problems/leaf-under-budget/1)|\n|Left most and right most node in each level of BT| [GFG](https://practice.geeksforgeeks.org/problems/leftmost-and-rightmost-nodes-of-binary-tree/1), [LeetCode](https://leetcode.com/problems/even-odd-tree/description/)|\n| | |\n\n\n# Graph \n#### BFS \n|Question|Problem|\n|---|---|\n| |[Minimum Multiplication to Reach End](https://practice.geeksforgeeks.org/problems/minimum-multiplications-to-reach-end/1)|\n#### DFS on Grid \n|Question|Problem|\n|---|---|\n| |[GFG](https://practice.geeksforgeeks.org/problems/replace-os-with-xs0052/1)|\n|Floyd Warshall| Transitive closure of a Graph [GFG](https://practice.geeksforgeeks.org/problems/transitive-closure-of-a-graph0930/1) |\n|Topological|[GFG](https://practice.geeksforgeeks.org/problems/eventual-safe-states/1)|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsandip-kanzariya%2Fgfg-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsandip-kanzariya%2Fgfg-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsandip-kanzariya%2Fgfg-leetcode/lists"}