Questions
Status
Largest strongly connected componentHardWrite codeWrite codeHard35 minCondensation DAG source nodesHardWrite codeWrite codeHard40 minBridge detectionHardWrite codeAmazon styleWrite codeAmazon styleHard35 minTwo-edge-connected componentsHardWrite codeWrite codeHard40 minDirected Eulerian path reconstructionHardWrite codeWrite codeHard45 minMinimum edge cutHardWrite codeWrite codeHard40 minBipartite matching maximumHardWrite codeWrite codeHard40 minMinimum path cover DAGHardWrite codeWrite codeHard45 minSecond-shortest path distanceHardWrite codeWrite codeHard40 minRobot minimum turnsHardWrite codeGoogle styleWrite codeGoogle styleHard40 minMaximum vertex-disjoint pathsHardWrite codeWrite codeHard50 minEvaluate divisionHardWrite codeGoogle styleWrite codeGoogle styleHard35 minK-th shortest pathHardWrite codeWrite codeHard35 minSecond-best spanning treeHardWrite codeWrite codeHard40 minPortal grid shortest pathHardWrite codeGoogle styleWrite codeGoogle styleHard35 minCount shortest pathsHardWrite codeGoogle styleWrite codeGoogle styleHard35 minSwim in rising waterHardWrite codeGoogle styleWrite codeGoogle styleHard35 minSegment tree with lazy propagationHardWrite codeCitadel styleWrite codeCitadel styleHard40 minLowest common ancestor queriesHardWrite codeCitadel styleWrite codeCitadel styleHard40 minMaximum subarray with updatesHardWrite codeCitadel styleWrite codeCitadel styleHard45 minUnique paths grid all cellsHardWrite codeGoogle styleWrite codeGoogle styleHard35 minSpreadsheet evaluatorHardWrite codeMicrosoft styleWrite codeMicrosoft styleHard45 minLongest SCC chainHardWrite codeWrite codeHard35 minEulerian circuit reconstructionHardWrite codeWrite codeHard30 minJohnson shortest pathsHardWrite codeCitadel styleWrite codeCitadel styleHard35 minGlobal edge connectivityHardWrite codeWrite codeHard40 minMinimum vertex cutHardWrite codeWrite codeHard40 minWidest path capacityHardWrite codeWrite codeHard30 minCurrency arbitrage detectionHardWrite codeCitadel styleWrite codeCitadel styleHard35 minSliding puzzle solverHardWrite codeGoogle styleWrite codeGoogle styleHard35 minEquation division queriesHardWrite codeGoogle styleWrite codeGoogle styleHard35 minCollect all keys in gridHardWrite codeGoogle styleWrite codeGoogle styleHard40 minMinimum refueling stopsHardWrite codeGoogle styleWrite codeGoogle styleHard30 minShortest path through a maze with free portalsHardWrite codeWrite codeHard35 minLexicographically smallest itineraryHardWrite codeGoogle styleWrite codeGoogle styleHard35 minMinimum obstacle removalHardWrite codeGoogle styleWrite codeGoogle styleHard30 minMinimum buses to destinationHardWrite codeGoogle styleWrite codeGoogle styleHard35 minWater supply network costHardWrite codeWrite codeHard35 minJob scheduling maximum profitHardWrite codeWrite codeHard35 min2D Fenwick treeHardWrite codeCitadel styleWrite codeCitadel styleHard40 minMaximum XOR with trieHardWrite codeGoogle styleWrite codeGoogle styleHard35 minMorris inorder traversalHardWrite codeGoogle styleWrite codeGoogle styleHard35 minRange count with thresholdHardWrite codeCitadel styleWrite codeCitadel styleHard40 minSocial feedHardWrite codeMeta styleWrite codeMeta styleHard40 minFind every listed word on a letter boardHardWrite codeAmazon styleWrite codeAmazon styleHard35 minWalks of length kHardWrite codeCitadel styleWrite codeCitadel styleHard35 minSpreadsheet formula evaluatorHardWrite codeFigma styleWrite codeFigma styleHard45 min2-SAT satisfiabilityHardWrite codeCitadel styleWrite codeCitadel styleHard40 minMinimum cost assignmentHardWrite codeUber styleWrite codeUber styleHard40 minMinimum vertex coverHardWrite codeCitadel styleWrite codeCitadel styleHard35 min