{"id":28859385,"url":"https://github.com/ibraam-nashaat/leetcode-graphs-study-plan","last_synced_at":"2025-07-05T18:33:06.532Z","repository":{"id":55400581,"uuid":"522982027","full_name":"Ibraam-Nashaat/Leetcode-Graphs-Study-Plan","owner":"Ibraam-Nashaat","description":"Leetcode Graphs study plan solutions.","archived":false,"fork":false,"pushed_at":"2022-08-16T15:45:35.000Z","size":28,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-20T03:14:01.371Z","etag":null,"topics":["bfs","dfs","graphs","graphs-algorithms","graphs-theory","leetcode-graphs","leetcode-graphs-study-plan","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/Ibraam-Nashaat.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}},"created_at":"2022-08-09T14:23:15.000Z","updated_at":"2025-02-03T23:53:03.000Z","dependencies_parsed_at":"2022-08-14T23:30:36.907Z","dependency_job_id":null,"html_url":"https://github.com/Ibraam-Nashaat/Leetcode-Graphs-Study-Plan","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Ibraam-Nashaat/Leetcode-Graphs-Study-Plan","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ibraam-Nashaat%2FLeetcode-Graphs-Study-Plan","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ibraam-Nashaat%2FLeetcode-Graphs-Study-Plan/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ibraam-Nashaat%2FLeetcode-Graphs-Study-Plan/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ibraam-Nashaat%2FLeetcode-Graphs-Study-Plan/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Ibraam-Nashaat","download_url":"https://codeload.github.com/Ibraam-Nashaat/Leetcode-Graphs-Study-Plan/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Ibraam-Nashaat%2FLeetcode-Graphs-Study-Plan/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263784855,"owners_count":23510986,"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":["bfs","dfs","graphs","graphs-algorithms","graphs-theory","leetcode-graphs","leetcode-graphs-study-plan","leetcode-solutions"],"created_at":"2025-06-20T03:13:54.144Z","updated_at":"2025-07-05T18:33:06.526Z","avatar_url":"https://github.com/Ibraam-Nashaat.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode-Graphs-Study-Plan\n- This repository represents my solutions to Leetcode Graphs I study plan.\n- You can find the complete study plan [here](https://leetcode.com/study-plan/graph/).\n## The Study Plan:\n### Day 1:\n- [733. Flood Fill](https://leetcode.com/problems/flood-fill/)\n- [200. Number of Islands](https://leetcode.com/problems/number-of-islands/)\n### Day 2:\n- [695. Max Area of Island](https://leetcode.com/problems/max-area-of-island/)\n- [1254. Number of Closed Islands](https://leetcode.com/problems/number-of-closed-islands/)\n### Day 3:\n- [1020. Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/)\n- [1905. Count Sub Islands](https://leetcode.com/problems/count-sub-islands/)\n### Day 4:\n- [1162. As Far from Land as Possible](https://leetcode.com/problems/as-far-from-land-as-possible/)\n- [417. Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)\n### Day 5:\n- [1091. Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)\n- [542. 01 Matrix](https://leetcode.com/problems/01-matrix/)\n### Day 6:\n- [934. Shortest Bridge](https://leetcode.com/problems/shortest-bridge/)\n- [1926. Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)\n### Day 7:\n- [797. All Paths From Source to Target](https://leetcode.com/problems/all-paths-from-source-to-target/)\n- [841. Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/)\n### Day 8:\n- [547. Number of Provinces](https://leetcode.com/problems/number-of-provinces/)\n- [1319. Number of Operations to Make Network Connected](https://leetcode.com/problems/number-of-operations-to-make-network-connected/)\n### Day 9:\n- [1376. Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/)\n- [802. Find Eventual Safe States](https://leetcode.com/problems/find-eventual-safe-states/)\n### Day 10:\n- [1129. Shortest Path with Alternating Colors](https://leetcode.com/problems/shortest-path-with-alternating-colors/)\n- [1466. Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)\n- [847. Shortest Path Visiting All Nodes](https://leetcode.com/problems/shortest-path-visiting-all-nodes/)\n### Day 11:\n- [1306. Jump Game III](https://leetcode.com/problems/jump-game-iii/)\n- [1654. Minimum Jumps to Reach Home](https://leetcode.com/problems/minimum-jumps-to-reach-home/)\n- [365. Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/)\n### Day 12:\n- [433. Minimum Genetic Mutation](https://leetcode.com/problems/minimum-genetic-mutation/)\n- [752. Open the Lock](https://leetcode.com/problems/open-the-lock/)\n- [127. Word Ladder](https://leetcode.com/problems/word-ladder/)\n### Day 13:\n- [997. Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/)\n- [1557. Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)\n### Day 14:\n- [1615. Maximal Network Rank](https://leetcode.com/problems/maximal-network-rank/)\n- [886. Possible Bipartition](https://leetcode.com/problems/possible-bipartition/)\n- [785. Is Graph Bipartite?](https://leetcode.com/problems/is-graph-bipartite/)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fibraam-nashaat%2Fleetcode-graphs-study-plan","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fibraam-nashaat%2Fleetcode-graphs-study-plan","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fibraam-nashaat%2Fleetcode-graphs-study-plan/lists"}