Live coding
Coding challenges
The problems that come up in tech interviews, with real tests. Write JavaScript or Python, run the examples and submit to pass the hidden tests.
0/116
Resolvidos
0/47
Fácil
0/52
Médio
0/17
Difícil
Entre para salvar seu código e marcar o que já resolveu.
#TitleTopicsDifficulty
- 1Pair That Sums to TargetArrays · Hash mapEasy
- 2Reverse Linked ListLinked list · RecursionEasy
- 3Count FrequenciesArrays · Hash mapEasy
- 4Repeated ValuesArrays · Hash mapEasy
- 5Rotate ArrayArraysEasy
- 6Move ZerosArrays · Two pointersEasy
- 7Intersection with DuplicatesArrays · Hash mapEasy
- 8Majority ElementArraysEasy
- 9First Unique ValueArrays · Hash mapEasy
- 10Valid PalindromeStrings · Two pointersEasy
- 11Two Sum in a Sorted ArrayArrays · Two pointersEasy
- 12Unique Values in OrderArrays · Two pointersEasy
- 13Reverse TextStrings · Two pointersEasy
- 14Window with the Most VowelsStrings · Sliding windowEasy
- 15Valid ParenthesesStrings · StackEasy
- 16Days Until WarmerArrays · StackEasy
- 17Next Greater on the BoardArrays · Stack · Hash mapEasy
- 18Canonical PathStrings · StackEasy
- 19Insertion PositionBinary search · ArraysEasy
- 20Target RangeBinary search · ArraysEasy
- 21Search in OrderBinary search · ArraysEasy
- 22Merge Sorted ListsLinked list · Two pointersEasy
- 23Cycle by PositionLinked listEasy
- 24Middle of the ListLinked list · Two pointersEasy
- 25Remove Duplicates from Sorted ListLinked list · Two pointersEasy
- 26Maximum DepthTrees · DFSEasy
- 27Symmetric TreeTrees · DFSEasy
- 28Same TreesTrees · DFSEasy
- 29Symmetric TreeTrees · DFSEasy
- 30Balanced TreeTrees · DFSEasy
- 31Islands in a GridGraphs · DFS · MatrixEasy
- 32Largest Island AreaGraphs · DFS · MatrixEasy
- 33Flood Fill by RegionGraphs · BFS · MatrixEasy
- 34Heavier StonesHeapEasy
- 35Possible JumpArrays · GreedyEasy
- 36Merge IntervalsIntervals · SortingEasy
- 37Non-overlapping IntervalsIntervals · Greedy · SortingEasy
- 38Climbing StairsDynamic programmingEasy
- 39House RobberDynamic programming · ArraysEasy
- 40Unique PathsDynamic programming · MathEasy
- 41Decode MessageDynamic programming · StringsEasy
- 42Possible SubsetsBacktracking · ArraysEasy
- 43Count Set BitsBitsEasy
- 44Single NumberArrays · BitsEasy
- 45Power of TwoMath · BitsEasy
- 46Roman to IntegerStrings · MathEasy
- 47Longest Common PrefixStringsEasy
- 48Group AnagramsStrings · Hash mapMedium
- 49Product of OthersArraysMedium
- 50Longest Consecutive SequenceArrays · Hash mapMedium
- 51Subarrays with Target SumArrays · Hash map · Prefix sumsMedium
- 52K Most Frequent ValuesArrays · Hash map · SortingMedium
- 53Valid Sudoku BoardArrays · Matrix · Hash mapMedium
- 54Longest Substring Without Repeating CharactersStrings · Hash map · Sliding windowMedium
- 553SumArrays · Sorting · Two pointersMedium
- 56Container With Most WaterArrays · Two pointersMedium
- 57Repetition with SwapsStrings · Sliding windowMedium
- 58Permutation in StringStrings · Hash map · Sliding windowMedium
- 59Min Stack HistoryStack · DesignMedium
- 60Postfix EvaluationStack · MathMedium
- 61Repeated MessageStrings · Stack · RecursionMedium
- 62Car FleetsArrays · Sorting · StackMedium
- 63Minimum in Rotated ArrayBinary search · ArraysMedium
- 64Search in Rotated ArrayBinary search · ArraysMedium
- 65Search in Sorted GridBinary search · MatrixMedium
- 66Eating SpeedBinary search · ArraysMedium
- 67Remove Nth Node from EndLinked list · Two pointersMedium
- 68Reorder by EndsLinked list · Two pointersMedium
- 69Add Numbers in ListsLinked list · MathMedium
- 70Tree DiameterTrees · DFSMedium
- 71Level Order ValuesTrees · BFS · QueueMedium
- 72Right Side ViewTrees · BFS · QueueMedium
- 73Lowest Common Ancestor in a BSTTrees · Binary search tree · DFSMedium
- 74Validate Search TreeTrees · Binary search tree · DFSMedium
- 75Kth Smallest in a BSTTrees · Binary search tree · DFSMedium
- 76Rotting OrangesGraphs · BFS · Matrix · QueueMedium
- 77Possible CoursesGraphs · BFS · DFSMedium
- 78Course OrderGraphs · BFS · HeapMedium
- 79Connected ComponentsGraphs · Union-findMedium
- 80Shortest Path in a GridGraphs · BFS · MatrixMedium
- 81Surrounded RegionGraphs · DFS · MatrixMedium
- 82Kth Largest ValueHeap · ArraysMedium
- 83Closest PointsHeap · SortingMedium
- 84Insert IntervalIntervalsMedium
- 85Meeting RoomsIntervals · Heap · GreedyMedium
- 86Minimum JumpsArrays · GreedyMedium
- 87Coin ChangeDynamic programmingMedium
- 88Increasing SubsequenceDynamic programming · Binary searchMedium
- 89Common SubsequenceDynamic programming · StringsMedium
- 90Word BreakDynamic programming · Strings · Hash mapMedium
- 91Partition into Two GroupsDynamic programming · ArraysMedium
- 92Houses in a CircleDynamic programming · ArraysMedium
- 93Permutations of the ListBacktracking · ArraysMedium
- 94Combinations That Sum to the TargetBacktracking · ArraysMedium
- 95Phone Keypad LettersBacktracking · StringsMedium
- 96Generate All ParenthesesBacktracking · RecursionMedium
- 97Word in GridBacktracking · Matrix · DFSMedium
- 98Mirror an octetBitsMedium
- 99Decimal productStrings · MathMedium
- 100Subarrays with k Distinct ValuesArrays · Hash map · Sliding windowHard
- 101Minimum Window SubstringStrings · Hash map · Sliding windowHard
- 102Sliding Window MaximumArrays · Sliding window · QueueHard
- 103Largest Rectangle in HistogramArrays · StackHard
- 104Median of Two ListsBinary search · ArraysHard
- 105Reverse Blocks of kLinked listHard
- 106Path SumTrees · DFS · RecursionHard
- 107Maximum Path SumTrees · DFS · Dynamic programmingHard
- 108Network DelayGraphs · HeapHard
- 109Word LadderGraphs · BFS · StringsHard
- 110Gas Station CircuitGreedy · ArraysHard
- 111Median in a StreamHeap · DesignHard
- 112Edit DistanceDynamic programming · StringsHard
- 1130/1 KnapsackDynamic programming · ArraysHard
- 114Longest Palindromic SubstringDynamic programming · StringsHard
- 115Count Queen PlacementsBacktracking · RecursionHard
- 116Prefix catalogTrie · Strings · DesignHard
116 desafios