Questions
Status
Minimize bottleneck pathMediumWrite codeCisco styleWrite codeCisco styleMedium30 minRecover an alien alphabet from a sorted word listMediumWrite codeGoogle styleWrite codeGoogle styleMedium30 minFarthest water cellMediumWrite codeWrite codeMedium25 minSafe nodesMediumWrite codeWrite codeMedium30 minMerkle rootMediumWrite codeCoinbase styleWrite codeCoinbase styleMedium28 minCycle length in functional graphMediumWrite codeWrite codeMedium30 minNetwork bottleneck bandwidthMediumWrite codeCisco styleWrite codeCisco styleMedium28 minSettled coin tray topplesMediumWrite codeWrite codeMedium22 minGantry crane minimum motionsMediumWrite codeWrite codeMedium25 minMaximum independent test batchMediumWrite codeWrite codeMedium25 minShortest path with wall removalHardWrite codeGoogle styleWrite codeGoogle styleHard40 minShortest distances that flag negative cyclesHardWrite codeWrite codeHard40 minWord search on boardHardWrite codeMicrosoft styleWrite codeMicrosoft styleHard40 minMerge accounts by emailHardWrite codeMeta styleWrite codeMeta styleHard40 minSplit people into two groupsHardWrite codeWrite codeHard35 minMaximum path sum treeHardWrite codeMeta styleWrite codeMeta styleHard30 minVertical order traversalHardWrite codeMeta styleWrite codeMeta styleHard30 minBoundary traversal of binary treeHardWrite codeAmazon styleWrite codeAmazon styleHard35 minWhere-clause predicate treeHardWrite codeSnowflake styleWrite codeSnowflake styleHard30 minMerkle tree diff between replicasHardWrite codeAmazon styleWrite codeAmazon styleHard35 minParallel job DAG makespanHardWrite codeDatabricks styleWrite codeDatabricks styleHard30 minParallel job DAG completion timesHardWrite codeDatabricks styleWrite codeDatabricks styleHard30 minStrongly connected component countHardWrite codeWrite codeHard35 minLargest 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 min