Questions

Status
Graphs and treesCoding · Level 3Open topic
Minimum 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 minPick the pair of seeds with the largest XORHardWrite 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 min
Find every listed word on a letter boardHardWrite codeAmazon styleWrite codeAmazon styleHard35 minCount walks of exactly k hops between routersHardWrite codeCitadel styleWrite codeCitadel styleHard35 min2-SAT satisfiabilityHardWrite codeCitadel styleWrite codeCitadel styleHard40 minMinimum cost assignmentHardWrite codeUber styleWrite codeUber styleHard40 minMake graph strongly connectedHardWrite codeCitadel styleWrite codeCitadel styleHard40 minMax flow networkHardWrite codeWrite codeHard45 minMaximum flow minimum costHardWrite codeWrite codeHard45 minMinimum cost fulfillmentHardWrite codeAmazon styleWrite codeAmazon styleHard40 minFeasible circulationHardWrite codeWrite codeHard50 minAll-pairs shortest paths DAGHardWrite codeWrite codeHard45 min2-SAT forced variablesHardWrite codeWrite codeHard45 minRobot fuel-constrained pathHardWrite codeWrite codeHard35 minConnectivity after edge removalsHardWrite codeWrite codeHard35 minConveyor belt robot pathHardWrite codeAmazon styleWrite codeAmazon styleHard40 minTraffic signal shortest arrivalHardWrite codeUber styleWrite codeUber styleHard40 minAutocomplete top 3HardWrite codeGoogle styleWrite codeGoogle styleHard30 minSegment tree range assignHardWrite codeWrite codeHard40 minMinimum debt transactionsHardWrite codeStripe styleWrite codeStripe styleHard40 minProject profit maximizationHardWrite codeWrite codeHard40 minTeam elimination checkHardWrite codeWrite codeHard40 minBoolean satisfiabilityHardWrite codeWrite codeHard40 minGlobal minimum cutHardWrite codeWrite codeHard45 minMinimum cost flowHardWrite codeWrite codeHard45 minLexicographically smallest tournament rankingHardWrite codeWrite codeHard40 minTree centroidsHardWrite codeWrite codeHard35 minRedundant connection directedHardWrite codeWrite codeHard40 minShortest bridgeHardWrite codeWrite codeHard35 minNumber of distinct islandsHardWrite codeWrite codeHard35 minCut trees in orderHardWrite codeWrite codeHard40 minArticulation pointsHardWrite codeWrite codeHard40 minMinimum cost grid pathHardWrite codeWrite codeHard35 minShortest walk visiting all nodesHardWrite codeWrite codeHard40 minLSM-tree memtableHardWrite codeMeta styleWrite codeMeta styleHard32 minMinimum effort pathHardWrite codeGoogle styleWrite codeGoogle styleHard40 minPlace the fewest signal boosters on a fibre treeHardWrite codeWrite codeHard40 minPack the most test suites into one batchHardWrite codeWrite codeHard40 minCount probe routesHardWrite codeWrite codeHard38 min