Questions
Status
Longest path in DAGHardWrite codeWrite codeHard35 minDungeon minimum starting healthHardWrite codeGoogle styleWrite codeGoogle styleHard30 minMinimum score polygon triangulationHardWrite codeWrite codeHard30 minMinimum cost to cut stickHardWrite codeGoogle styleWrite codeGoogle styleHard30 minLCA of deepest leavesHardWrite codeWrite codeHard30 minCount valid BST subtreesHardWrite codeWrite codeHard30 minMatchstick squareHardWrite codeWrite codeHard28 minMinimum insertions for palindromeHardWrite codeWrite codeHard35 minPartitions into distinct partsHardWrite codeCitadel styleWrite codeCitadel styleHard28 minSet bits 0 to nHardWrite codeWrite codeHard30 minDerangement countHardWrite codeCitadel styleWrite codeCitadel styleHard25 minNo adjacent digitsHardWrite codeGoogle styleWrite codeGoogle styleHard35 minPartition into pairsHardWrite codeWrite codeHard35 minProbability final score within targetHardWrite codeCitadel styleWrite codeCitadel styleHard40 minScrambled stringHardWrite codeGoogle styleWrite codeGoogle styleHard35 minPerfect squares sumHardWrite codeWrite codeHard30 minConstrained strings matrixHardWrite codeCitadel styleWrite codeCitadel styleHard35 minSmallest dictionary segmentationHardWrite codeGoogle styleWrite codeGoogle styleHard40 minSum over subsets transformHardWrite codeCitadel styleWrite codeCitadel styleHard30 minCount disjoint bit pairsHardWrite codeCitadel styleWrite codeCitadel styleHard35 minShortest Hamiltonian pathHardWrite codeUber styleWrite codeUber styleHard35 minDomino tiling countHardWrite codeCitadel styleWrite codeCitadel styleHard40 minGambler's ruin probabilityHardWrite codeCitadel styleWrite codeCitadel styleHard30 minSurjective functions countHardWrite codeCitadel styleWrite codeCitadel styleHard30 minDistinct subsequence countHardWrite codeWrite codeHard25 minCherry collection round tripHardWrite codeGoogle styleWrite codeGoogle styleHard40 minFrog river stone crossingHardWrite codeGoogle styleWrite codeGoogle styleHard30 minTraveling salesman open pathHardWrite codeDoorDash styleWrite codeDoorDash styleHard40 minBurst balloonsHardWrite codeGoogle styleWrite codeGoogle styleHard35 minSum of distances in treeHardWrite codeGoogle styleWrite codeGoogle styleHard40 minLargest BST subtreeHardWrite codeMeta styleWrite codeMeta styleHard35 minMaximum path sumHardWrite codeMeta styleWrite codeMeta styleHard30 minWord break all segmentationsHardWrite codeGoogle styleWrite codeGoogle styleHard30 minDistinct palindromic subsequencesHardWrite codeGoogle styleWrite codeGoogle styleHard35 minPalindrome partition cutsHardWrite codeGoogle styleWrite codeGoogle styleHard34 minRegular expression matchingHardWrite codeGoogle styleWrite codeGoogle styleHard34 minHarshad numbersHardWrite codeWrite codeHard35 minSum over subsetsHardWrite codeWrite codeHard35 minChance a random walk hits +a before -bHardWrite codeCitadel styleWrite codeCitadel styleHard30 minConvex hull tower costHardWrite codeWrite codeHard40 minPartition k groups squared costHardWrite codeWrite codeHard40 minFrog jump expected timeHardWrite codeCitadel styleWrite codeCitadel styleHard30 minTraveling salesmanHardWrite codeAmazon styleWrite codeAmazon styleHard35 minNo adjacent equal digitsHardWrite codeWrite codeHard35 minCourse selection treeHardWrite codeWrite codeHard40 minSubmask maximumHardWrite codeWrite codeHard35 minDice sum probabilityHardWrite codeCitadel styleWrite codeCitadel styleHard30 minRandom walk absorptionHardWrite codeCitadel styleWrite codeCitadel styleHard35 minTwo-robot cherry collectionHardWrite codeGoogle styleWrite codeGoogle styleHard45 minStone pile game scoreHardWrite codeWrite codeHard40 min