Questions
Status
Reconstruct tree postorderMediumWrite codeMicrosoft styleWrite codeMicrosoft styleMedium30 minDistance between two nodesMediumWrite codeMeta styleWrite codeMeta styleMedium25 minHeight balanced binary treeMediumWrite codeWrite codeMedium20 minMinimum BST heightMediumWrite codeWrite codeMedium20 minLSM run mergingMediumWrite codeMeta styleWrite codeMeta styleMedium30 minLSM compaction with tombstonesMediumWrite codeMeta styleWrite codeMeta styleMedium25 minCount the days until blight reaches every plantMediumWrite codeAmazon styleWrite codeAmazon styleMedium20 minAll paths DAGMediumWrite codeWrite codeMedium18 minCheck whether one walk can cover every park trailMediumWrite codeWrite codeMedium25 minShortest path count moduloMediumWrite codeWrite codeMedium30 minBipartite graph coloringMediumWrite codeWrite codeMedium25 minConnected components after mergesMediumWrite codeWrite codeMedium20 minWire every campus building with the least cableMediumWrite codeAmazon styleWrite codeAmazon styleMedium25 minCount the fastest routes between two depotsMediumWrite codeGoogle styleWrite codeGoogle styleMedium25 minWildcard dictionary searchMediumWrite codeMeta styleWrite codeMeta styleMedium25 minFind the deepest folder containing both selected foldersMediumWrite codeCitadel styleWrite codeCitadel styleMedium25 minRange minimum queriesMediumWrite codeCitadel styleWrite codeCitadel styleMedium25 minPrefix word countMediumWrite codeAmazon styleWrite codeAmazon styleMedium20 minBalanced BST from sorted arrayMediumWrite codeWrite codeMedium25 minEvaluate every cell of a sheet of sum formulasMediumWrite codeMicrosoft styleWrite codeMicrosoft styleMedium25 minCheck whether a snowplough can clear each street onceMediumWrite codeWrite codeMedium25 minMinimum edge reversalsMediumWrite codeWrite codeMedium25 minWord transformation sequenceMediumWrite codeAmazon styleWrite codeAmazon styleMedium30 minNetwork connection timestampMediumWrite codeMeta styleWrite codeMeta styleMedium25 minMinimize maximum link latencyMediumWrite codeWrite codeMedium25 minCritical path makespanMediumWrite codeGoogle styleWrite codeGoogle styleMedium30 minAccount merge deduplicationMediumWrite codeMeta styleWrite codeMeta styleMedium30 minUnique topological orderingMediumWrite codeGoogle styleWrite codeGoogle styleMedium30 minMinimum content seed serversMediumWrite codeWrite codeMedium20 minMaximum path reliabilityMediumWrite codeWrite codeMedium30 minReconstruct BST from preorderMediumWrite codeWrite codeMedium30 minCount nodes in complete treeMediumWrite codeGoogle styleWrite codeGoogle styleMedium25 minRecover swapped BSTMediumWrite codeMeta styleWrite codeMeta styleMedium30 minSegment tree range maxMediumWrite codeCitadel styleWrite codeCitadel styleMedium30 minKth ancestor in treeMediumWrite codeWrite codeMedium30 minLargest balanced subtreeMediumWrite codeWrite codeMedium30 minDistinct substringsMediumWrite codeWrite codeMedium28 minShortest path 0-1 weightsMediumWrite codeWrite codeMedium25 minShortest path minimum hopsMediumWrite codeWrite codeMedium30 minMinimum spanning tree with required edgeMediumWrite codeWrite codeMedium30 minMinimum road reversals to capitalMediumWrite codeWrite codeMedium25 minSum root to leaf numbersMediumWrite codeWrite codeMedium15 minGreater sum treeMediumWrite codeWrite codeMedium20 minTree diameter edgesMediumWrite codeWrite codeMedium18 minValidate binary search treeMediumWrite codeWrite codeMedium16 minFlatten multilevel listMediumWrite codeWrite codeMedium25 minFlag each point where a watched word endsMediumWrite codeWrite codeMedium20 minMaximum edge-disjoint pathsMediumWrite codeWrite codeMedium30 minRecover an alien alphabet from a sorted word listMediumWrite codeGoogle styleWrite codeGoogle styleMedium30 minFarthest water cellMediumWrite codeWrite codeMedium25 min