Questions
Status
Database connection pool timeoutHardOn-call incidentOn-call incidentHard40 minSchema migration locks entire tableHardOn-call incidentOn-call incidentHard40 minOut-of-order processingHardOn-call incidentOn-call incidentHard40 minGlobal mutex lock contentionHardOn-call incidentOn-call incidentHard40 min
CLOCK page cacheHardWrite codeOracle styleWrite codeOracle styleHard35 minMulti-version key-value storeHardWrite codeOracle styleWrite codeOracle styleHard35 minLSM-tree compactionHardWrite codeMeta styleWrite codeMeta styleHard35 minSecondary index queriesHardWrite codeSnowflake styleWrite codeSnowflake styleHard30 minCost-based optimizer choiceHardWrite codeOracle styleWrite codeOracle styleHard30 minCovering index scanHardWrite codeOracle styleWrite codeOracle styleHard30 minB-tree leaf insert and rangeHardWrite codeOracle styleWrite codeOracle styleHard35 minRaft commit index from matchIndexHardWrite codeDatabricks styleWrite codeDatabricks styleHard35 minHybrid Logical Clock updateHardWrite codeGoogle styleWrite codeGoogle styleHard32 minOR-Set CRDT replica mergeHardWrite codeFigma styleWrite codeFigma styleHard32 minMVCC snapshot isolation visibilityHardWrite codeOracle styleWrite codeOracle styleHard30 minSemantic version comparisonHardWrite codeWrite codeHard28 minMVCC snapshot visibilityHardWrite codeOracle styleWrite codeOracle styleHard28 minSnapshot isolation commitHardWrite codeOracle styleWrite codeOracle styleHard30 minVersioned key-value storeHardWrite codeSnowflake styleWrite codeSnowflake styleHard30 min
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 min