Questions
Status
Shortest path unweighted graphMediumWrite codeWrite codeMedium25 minRelay activation timeMediumWrite codeAmazon styleWrite codeAmazon styleMedium30 minLargest connected regionMediumWrite codeAmazon styleWrite codeAmazon styleMedium25 minLexicographically smallest task orderMediumWrite codeGoogle styleWrite codeGoogle styleMedium30 minShortest path weighted graphMediumWrite codeGoogle styleWrite codeGoogle styleMedium35 minMinimum spanning treeMediumWrite codeWrite codeMedium35 minLargest connected componentMediumWrite codeWrite codeMedium25 minRedundant edge in treeMediumWrite codeWrite codeMedium25 minClone graph with canonical idsMediumWrite codeMeta styleWrite codeMeta styleMedium30 minMinimum cable replug operationsMediumWrite codeWrite codeMedium30 minBottom view of binary treeMediumWrite codeAmazon styleWrite codeAmazon styleMedium25 minKth smallest element in BSTMediumWrite codeMeta styleWrite codeMeta styleMedium20 minCount inversions in tree traversalMediumWrite codeWrite codeMedium20 minClosest value in BSTMediumWrite codeMeta styleWrite codeMeta styleMedium20 minReplace words with shortest rootMediumWrite codeGoogle styleWrite codeGoogle styleMedium25 minMutable range sum queriesMediumWrite codeWrite codeMedium30 minRange update point queryMediumWrite codeWrite codeMedium30 minZigzag level order traversalMediumWrite codeAmazon styleWrite codeAmazon styleMedium20 minReconstruct 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 minBinary tree right side viewMediumWrite codeWrite codeMedium25 minLSM run mergingMediumWrite codeMeta styleWrite codeMeta styleMedium30 minLSM compaction with tombstonesMediumWrite codeMeta styleWrite codeMeta styleMedium25 minRotting orangesMediumWrite codeAmazon styleWrite codeAmazon styleMedium30 minAll paths DAGMediumWrite codeWrite codeMedium18 minEulerian path existenceMediumWrite codeWrite codeMedium25 minMaximum spanning tree weightMediumWrite codeWrite codeMedium25 minShortest path count moduloMediumWrite codeWrite codeMedium30 minLexicographically smallest topological sortMediumWrite codeWrite codeMedium25 minBipartite graph coloringMediumWrite codeWrite codeMedium25 minTask scheduling semestersMediumWrite codeAmazon styleWrite codeAmazon styleMedium25 minConnected components after mergesMediumWrite codeWrite codeMedium20 minConnect points minimum costMediumWrite codeAmazon styleWrite codeAmazon styleMedium30 minLargest blob sizeMediumWrite codeAmazon styleWrite codeAmazon styleMedium20 minWildcard dictionary searchMediumWrite codeMeta styleWrite codeMeta styleMedium25 minRange minimum queriesMediumWrite codeCitadel styleWrite codeCitadel styleMedium25 minFenwick tree range updatesMediumWrite codeCitadel styleWrite codeCitadel styleMedium25 minPrefix word countMediumWrite codeAmazon styleWrite codeAmazon styleMedium20 minDeepest leaves lowest ancestorMediumWrite codeWrite codeMedium30 minBalanced BST from sorted arrayMediumWrite codeWrite codeMedium25 minDistance between tree nodesMediumWrite codeWrite codeMedium30 minEulerian path existsMediumWrite codeWrite codeMedium25 minMinimum edge reversalsMediumWrite codeWrite codeMedium25 minPackage install orderMediumWrite codeGoogle styleWrite codeGoogle styleMedium25 minWord transformation sequenceMediumWrite codeAmazon styleWrite codeAmazon styleMedium30 minNetwork connection timestampMediumWrite codeMeta styleWrite codeMeta styleMedium25 minMinimize maximum link latencyMediumWrite codeWrite codeMedium25 minSplit people into teamsMediumWrite codeMeta styleWrite codeMeta styleMedium25 min