LeetCode The Hard Way

Akuna Capital

18 problems

ProblemDifficultyFrequency Topics
1177. Can Make Palindrome from SubstringMedium100%
ArrayHash TableStringBit ManipulationPrefix Sum
Map Sum PairsMedium97%
Hash TableStringDesignTrie
740. Delete and EarnMedium97%
ArrayHash TableDynamic Programming
Cherry PickupHard97%
ArrayDynamic ProgrammingMatrix
743. Network Delay TimeMedium97%
Depth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest PathDijkstra's Algorithm
1649. Create Sorted Array through InstructionsHard97%
ArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set
1665. Minimum Initial Energy to Finish TasksHard97%
ArrayGreedySorting
1425. Constrained Subsequence SumHard97%
ArrayDynamic ProgrammingQueueSliding WindowHeap (Priority Queue)Monotonic Queue
1223. Dice Roll SimulationHard97%
ArrayDynamic Programming
1819. Number of Different Subsequences GCDsHard97%
ArrayMathCountingNumber TheoryEuclidean AlgorithmGreatest Common Divisor
1319. Number of Operations to Make Network ConnectedMedium97%
Depth-First SearchBreadth-First SearchUnion-FindGraph Theory
1326. Minimum Number of Taps to Open to Water a GardenHard97%
ArrayDynamic ProgrammingGreedy
1338. Reduce Array Size to The HalfMedium97%
ArrayHash TableGreedySortingHeap (Priority Queue)
1370. Increasing Decreasing StringEasy97%
Hash TableStringCounting
2497. Maximum Star Sum of a GraphMedium89.8%
ArrayGreedyGraph TheorySortingHeap (Priority Queue)
924. Minimize Malware SpreadHard72.3%
ArrayHash TableDepth-First SearchBreadth-First SearchUnion-FindGraph Theory
1192. Critical Connections in a NetworkHard62.1%
Depth-First SearchGraph TheoryBiconnected ComponentBridge (Graph)
2904. Shortest and Lexicographically Smallest Beautiful StringMedium62.1%
StringSliding Window
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee