PhantomCodeAIPhantomCodeAI
FeaturesMock InterviewDashboardJobsPricing
FeaturesMock InterviewDashboardJobsPricing
PhantomCodeAIPhantomCodeAI
FeaturesMock InterviewDashboardJobsPricing
FeaturesMock InterviewDashboardJobsPricing
HomeLeetCode ProblemsGraph

Graph Problems

141 Graph LeetCode problems · Solve with AI-powered hints & step-by-step explanations.

133Clone GraphMedium207Course ScheduleMedium210Course Schedule IIMedium310Minimum Height TreesMedium329Longest Increasing Path in a MatrixHard332Reconstruct ItineraryHard399Evaluate DivisionMedium547Number of ProvincesMedium684Redundant ConnectionMedium685Redundant Connection IIHard743Network Delay TimeMedium753Cracking the SafeHard765Couples Holding HandsHard785Is Graph Bipartite?Medium787Cheapest Flights Within K StopsMedium797All Paths From Source to TargetMedium802Find Eventual Safe StatesMedium834Sum of Distances in TreeHard841Keys and RoomsMedium847Shortest Path Visiting All NodesHard851Loud and RichMedium882Reachable Nodes In Subdivided GraphHard886Possible BipartitionMedium913Cat and MouseHard924Minimize Malware SpreadHard928Minimize Malware Spread IIHard947Most Stones Removed with Same Row or ColumnMedium990Satisfiability of Equality EquationsMedium997Find the Town JudgeEasy1042Flower Planting With No AdjacentMedium1129Shortest Path with Alternating ColorsMedium1192Critical Connections in a NetworkHard1203Sort Items by Groups Respecting DependenciesHard1298Maximum Candies You Can Get from BoxesHard1311Get Watched Videos by Your FriendsMedium1319Number of Operations to Make Network ConnectedMedium1334Find the City With the Smallest Number of Neighbors at a Threshold DistanceMedium1361Validate Binary Tree NodesMedium1368Minimum Cost to Make at Least One Valid Path in a GridHard1377Frog Position After T SecondsHard1462Course Schedule IVMedium1466Reorder Routes to Make All Paths Lead to the City ZeroMedium1489Find Critical and Pseudo-Critical Edges in Minimum Spanning TreeHard1494Parallel Courses IIHard1514Path with Maximum ProbabilityMedium1557Minimum Number of Vertices to Reach All NodesMedium1579Remove Max Number of Edges to Keep Graph Fully TraversableHard1584Min Cost to Connect All PointsMedium1591Strange Printer IIHard1615Maximal Network RankMedium1632Rank Transform of a MatrixHard1697Checking Existence of Edge Length Limited PathsHard1719Number Of Ways To Reconstruct A TreeHard1728Cat and Mouse IIHard1761Minimum Degree of a Connected Trio in a GraphHard1782Count Pairs Of NodesHard1786Number of Restricted Paths From First to Last NodeMedium1791Find Center of Star GraphEasy1857Largest Color Value in a Directed GraphHard1916Count Ways to Build Rooms in an Ant ColonyHard1928Minimum Cost to Reach Destination in TimeHard1971Find if Path Exists in GraphEasy1976Number of Ways to Arrive at DestinationMedium2039The Time When the Network Becomes IdleMedium2045Second Minimum Time to Reach DestinationHard2050Parallel Courses IIIHard2065Maximum Path Quality of a GraphHard2076Process Restricted Friend RequestsHard2092Find All People With SecretHard2097Valid Arrangement of PairsHard2101Detonate the Maximum BombsMedium2115Find All Possible Recipes from Given SuppliesMedium2127Maximum Employees to Be Invited to a MeetingHard2192All Ancestors of a Node in a Directed Acyclic GraphMedium2203Minimum Weighted Subgraph With the Required PathsHard2242Maximum Score of a Node SequenceHard2246Longest Path With Different Adjacent CharactersHard2285Maximum Total Importance of RoadsMedium2290Minimum Obstacle Removal to Reach CornerHard2316Count Unreachable Pairs of Nodes in an Undirected GraphMedium2328Number of Increasing Paths in a GridHard2359Find Closest Node to Given Two NodesMedium2360Longest Cycle in a GraphHard2368Reachable Nodes With RestrictionsMedium2374Node With Highest Edge ScoreMedium2392Build a Matrix With ConditionsHard2421Number of Good PathsHard2467Most Profitable Path in a TreeMedium2477Minimum Fuel Cost to Report to the CapitalMedium2492Minimum Score of a Path Between Two CitiesMedium2493Divide Nodes Into the Maximum Number of GroupsHard2497Maximum Star Sum of a GraphMedium2508Add Edges to Make Degrees of All Nodes EvenHard2577Minimum Time to Visit a Cell In a GridHard2603Collect Coins in a TreeHard2608Shortest Cycle in a GraphHard2642Design Graph With Shortest Path CalculatorHard2646Minimize the Total Price of the TripsHard2662Minimum Cost of a Path With Special RoadsMedium2685Count the Number of Complete ComponentsMedium2699Modify Graph Edge WeightsHard2846Minimum Edge Weight Equilibrium Queries in a TreeHard2858Minimum Edge Reversals So Every Node Is ReachableHard2876Count Visited Nodes in a Directed GraphHard2924Find Champion IIMedium2959Number of Possible Sets of Closing BranchesHard2976Minimum Cost to Convert String IMedium2977Minimum Cost to Convert String IIHard3015Count the Number of Houses at a Certain Distance IMedium3017Count the Number of Houses at a Certain Distance IIHard3108Minimum Cost Walk in Weighted GraphHard3112Minimum Time to Visit Disappearing NodesMedium3123Find Edges in Shortest PathsHard3203Find Minimum Diameter After Merging Two TreesHard3241Time Taken to Mark All NodesHard3243Shortest Distance After Road Addition Queries IMedium3244Shortest Distance After Road Addition Queries IIHard3286Find a Safe Walk Through a GridMedium3310Remove Methods From ProjectMedium3311Construct 2D Grid Matching Graph LayoutHard3341Find Minimum Time to Reach Last Room IMedium3342Find Minimum Time to Reach Last Room IIMedium3377Digit Operations to Make Two Integers EqualMedium3387Maximize Amount After Two Days of ConversionsMedium3419Minimize the Maximum Edge Weight of GraphMedium3435Frequencies of Shortest SupersequencesHard3493Properties GraphMedium3528Unit Conversion IMedium3530Maximum Profit from Valid Topological Order in DAGHard3532Path Existence Queries in a Graph IMedium3534Path Existence Queries in a Graph IIHard3543Maximum Weighted K-Edge PathMedium3547Maximum Sum of Edge Values in a GraphHard3594Minimum Time to Transport All IndividualsHard3600Maximize Spanning Tree Stability with UpgradesHard3604Minimum Time to Reach Destination in Directed GraphMedium3607Power Grid MaintenanceMedium3608Minimum Time for K Connected ComponentsMedium3613Minimize Maximum Component CostMedium3615Longest Palindromic Path in GraphHard3620Network Recovery PathwaysHard
← Browse all LeetCode problems
PhantomCodeAIPhantomCodeAI
PhantomCodeAI is an undetectable desktop application to help you pass your Leetcode interviews.
All systems online
Download

Legal

Refund PolicyTerms of ServiceCancellation PolicyPrivacy Policy

Pages

Contact SupportHelp CenterInstant SupportFAQBlogFeaturesInterview CopilotCoding CopilotInterview QuestionsPricingMock Interview PricingEarn with UsBest AI Interview Assistants 2026FeedbackLeetcode ProblemsLoginCreate Account

Compare

All 29 comparisons →Why switch (29 alternatives) →Interview Coder AlternativeFinal Round AI AlternativeUltraCode AI AlternativeParakeet AI AlternativeAI Apply AlternativeCoderRank AlternativeInterviewing.io AlternativeShadeCoder Alternative

Resources

Salary GuideResume TemplatesWhat Is PhantomCodeAIIs PhantomCodeAI Detectable?Use PhantomCodeAI in HackerRankvs LeetCode PremiumFor European EngineersFor FAANG Interview PrepPost-Layoff ComebackIndia Pricing (INR)

Interview Types

Coding InterviewSystem Design InterviewDSA InterviewLeetCode InterviewAlgorithms InterviewData Structure InterviewSQL InterviewOnline Assessment

Interview Questions

See all →
GoogleAmazonMetaMicrosoftAppleNetflixStripeUberAirbnbBloombergSoftware EngineerFrontend EngineerBackend EngineerData EngineerML EngineerDevOps EngineerData ScientistEngineering ManagerBehavioralSystem Design

Mock Interview by Round Type

All formats →
Mock Interview HubMock Coding InterviewMock Behavioral InterviewMock System Design

AI for Industry Interviews

All industries →
Sales InterviewsPM InterviewsFinance InterviewsConsulting InterviewsDesign Interviews

Coding Interview Patterns

See all patterns →
Coding Interviews HubDynamic ProgrammingTwo Pointers + Sliding WindowGraph AlgorithmsTree AlgorithmsBinary Search

Interview Guides

See all guides →
How to Ace an InterviewHow to Crack InterviewsBest Interview AnswersScreening Interview QuestionsTelephone Interview TipsWorking Interview ExplainedCracking the PM InterviewFAANG 30-Day RoadmapTop 10 LeetCode PatternsSystem Design Prep GuideSTAR Behavioral MethodBehavioral Interview Qs

Alternatives — why engineers switch

See all 29 →
Interview CoderFinal Round AIParakeet AILockedIn AIUltraCode AIShadeCoderSensei AIVerve AICluelyChatGPTBeyz AIInterview SidekickYoodliAlgoMonsterCoderRankExponentFormationInterviewing.ioInterview CakeBig InterviewInterview KickstartPrampScalerAI ApplyCareerflowJobscanKickresumeTeal HQHireVue

AI Interview Tools

AI Interview AssistantAI Interview CoachAI for Job InterviewsAI Interview Preparation ToolReal-Time AI Interview AnswersInterview AI HelperReal-Time AI Interview AssistantAI Interview BotBest AI Interview Tools 2026AI Interview QuestionsPractice Interview QuestionsAI to Answer Interview QuestionsAI Phone Interview HelpAI Interviewing SoftwareAI Interview HubInterview CopilotAI Coding Interview AssistantMock Interview

© 2026 PhantomCodeAI. All rights reserved.