LeetCode The Hard Way

Arista Networks

37 problems

ProblemDifficultyFrequency Topics
2182. Construct String With Repeat LimitMedium100%
Hash TableStringGreedyHeap (Priority Queue)Counting
997. Find the Town JudgeEasy96.9%
ArrayHash TableGraph Theory
93. Restore IP AddressesMedium93.3%
StringBacktracking
268. Missing NumberEasy84.4%
ArrayHash TableMathBinary SearchBit ManipulationSorting
Inorder Successor in BST IIMedium84.4%
TreeBinary Search TreeBinary Tree
25. Reverse Nodes in k-GroupHard78.4%
Linked ListRecursion
143. Reorder ListMedium78.4%
Linked ListTwo PointersStackRecursion
146. LRU CacheMedium78.4%
Hash TableLinked ListDesignDoubly-Linked List
219. Contains Duplicate IIEasy78.4%
ArrayHash TableSliding Window
210. Course Schedule IIMedium78.4%
Depth-First SearchBreadth-First SearchGraph TheoryTopological Sort
104. Maximum Depth of Binary TreeEasy78.4%
TreeDepth-First SearchBreadth-First SearchBinary Tree
33. Search in Rotated Sorted ArrayMedium78.4%
ArrayBinary Search
138. Copy List with Random PointerMedium78.4%
Hash TableLinked List
Reverse Linked List IIMedium70.8%
Linked List
788. Rotated DigitsMedium70.8%
MathDynamic Programming
Remove Linked List ElementsEasy70.8%
Linked ListRecursion
46. PermutationsMedium70.8%
ArrayBacktracking
Simplify PathMedium70.8%
StringStack
Remove Duplicates from Sorted List IIMedium70.8%
Linked ListTwo Pointers
113. Path Sum IIMedium60.1%
BacktrackingTreeDepth-First SearchBinary Tree
79. Word SearchMedium60.1%
ArrayStringBacktrackingDepth-First SearchMatrix
53. Maximum SubarrayMedium60.1%
ArrayDivide and ConquerDynamic Programming
139. Word BreakMedium60.1%
ArrayHash TableStringDynamic ProgrammingTrieMemoizationBrute-Force Search
1910. Remove All Occurrences of a SubstringMedium60.1%
StringStackSimulation
347. Top K Frequent ElementsMedium60.1%
ArrayHash TableDivide and ConquerSortingHeap (Priority Queue)Bucket SortCountingQuickselect
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee