Eureka

A collection of LeetCode solutions across multiple programming languages.

0 of 0 problems visible

Problem	Categories	Java	Scala	Python
Balanced Binary Tree balanced-binary-tree	TreeDepth-First SearchBinary Tree			—
Binary Search binary-search	ArrayBinary Search
Binary Tree Level Order Traversal binary-tree-level-order-traversal	TreeBreadth-First SearchBinary Tree		—	—
Binary Tree Right Side View binary-tree-right-side-view	TreeDepth-First SearchBreadth-First SearchBinary Tree		—	—
Binary Tree Zigzag Level Order Traversal binary-tree-zigzag-level-order-traversal	TreeBreadth-First SearchBinary Tree		—	—
Burst Balloons burst-balloons	ArrayDynamic Programming		—	—
Coin Change coin-change	ArrayDynamic ProgrammingBreadth-First Search		—	—
Coin Change II coin-change-ii	ArrayDynamic Programming		—	—
Combination Sum combination-sum	ArrayBacktracking		—	—
Construct Binary Tree from Preorder and Inorder Traversal construct-binary-tree-from-preorder-and-inorder-traversal	ArrayHash TableDivide and ConquerTreeBinary Tree		—	—
Container With Most Water container-with-most-water	ArrayTwo PointersGreedy	—		—
Course Schedule course-schedule	Depth-First SearchBreadth-First SearchGraph TheoryTopological Sort		—	—
Decode Ways decode-ways	StringDynamic Programming		—	—
Delete Operation for Two Strings delete-operation-for-two-strings	StringDynamic Programming		—	—
Edit Distance edit-distance	StringDynamic Programming		—	—
Find All Anagrams in a String find-all-anagrams-in-a-string	Hash TableStringSliding Window	—		—
Find First and Last Position of Element in Sorted Array find-first-and-last-position-of-element-in-sorted-array	ArrayBinary Search		—	—
Find if Path Exists in Graph find-if-path-exists-in-graph	Depth-First SearchBreadth-First SearchUnion-FindGraph Theory		—	—
Find Median from Data Stream find-median-from-data-stream	Two PointersDesignSortingHeap (Priority Queue)Data Stream		—	—
Find Minimum in Rotated Sorted Array find-minimum-in-rotated-sorted-array	ArrayBinary Search		—	—
Find Smallest Letter Greater Than Target find-smallest-letter-greater-than-target	ArrayBinary Search		—	—
Flood Fill flood-fill	ArrayDepth-First SearchBreadth-First SearchMatrix		—	—
Generate Parentheses generate-parentheses	StringDynamic ProgrammingBacktracking		—	—
Get the Maximum Score get-the-maximum-score	ArrayTwo PointersDynamic ProgrammingGreedy		—	—
Insert into a Binary Search Tree insert-into-a-binary-search-tree	TreeBinary Search TreeBinary Tree		—	—
Invert Binary Tree invert-binary-tree	TreeDepth-First SearchBreadth-First SearchBinary Tree		—	—
K Closest Points to Origin k-closest-points-to-origin	ArrayMathDivide and ConquerGeometrySortingHeap (Priority Queue)Quickselect		—	—
Kth Largest Element in an Array kth-largest-element-in-an-array	ArrayDivide and ConquerSortingHeap (Priority Queue)Quickselect		—	—
Kth Smallest Element in a Sorted Matrix kth-smallest-element-in-a-sorted-matrix	ArrayBinary SearchSortingHeap (Priority Queue)Matrix		—	—
Largest Divisible Subset largest-divisible-subset	ArrayMathDynamic ProgrammingSorting		—	—
Letter Combinations of a Phone Number letter-combinations-of-a-phone-number	Hash TableStringBacktracking			—
Linked List Cycle linked-list-cycle	Hash TableLinked ListTwo Pointers		—	—
Longest Common Subsequence longest-common-subsequence	StringDynamic Programming		—	—
Longest Increasing Subsequence longest-increasing-subsequence	ArrayBinary SearchDynamic Programming		—	—
Longest Substring Without Repeating Characters longest-substring-without-repeating-characters	Hash TableStringSliding Window	—		—
Lowest Common Ancestor of a Binary Search Tree lowest-common-ancestor-of-a-binary-search-tree	TreeDepth-First SearchBinary Search TreeBinary Tree			—
Lowest Common Ancestor of a Binary Tree lowest-common-ancestor-of-a-binary-tree	TreeDepth-First SearchBinary Tree		—	—
Maximal Square maximal-square	ArrayDynamic ProgrammingMatrix		—	—
Maximum Depth of Binary Tree maximum-depth-of-binary-tree	TreeDepth-First SearchBreadth-First SearchBinary Tree			—
Merge k Sorted Lists merge-k-sorted-lists	Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort		—	—
Middle of the Linked List middle-of-the-linked-list	Linked ListTwo Pointers			—
Minimum Consecutive Cards to Pick Up minimum-consecutive-cards-to-pick-up	ArrayHash TableSliding Window		—	—
Minimum Depth of Binary Tree minimum-depth-of-binary-tree	TreeDepth-First SearchBreadth-First SearchBinary Tree		—	—
Minimum Path Sum minimum-path-sum	ArrayDynamic ProgrammingMatrix		—	—
Minimum Window Substring minimum-window-substring	Hash TableStringSliding Window		—	—
Move Zeroes move-zeroes	ArrayTwo Pointers	—		—
Number of Islands number-of-islands	ArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix		—	—
Open the Lock open-the-lock	ArrayHash TableStringBreadth-First Search		—	—
Palindrome Partitioning palindrome-partitioning	StringDynamic ProgrammingBacktracking		—	—
Peak Index in a Mountain Array peak-index-in-a-mountain-array	ArrayBinary Search		—	—
Perfect Squares perfect-squares	MathDynamic ProgrammingBreadth-First Search		—	—
Permutations permutations	ArrayBacktracking		—	—
Predict the Winner predict-the-winner	ArrayMathDynamic ProgrammingRecursionGame Theory		—	—
Product of Array Except Self product-of-array-except-self	ArrayPrefix Sum		—	—
Range Sum Query - Immutable range-sum-query-immutable	ArrayDesignPrefix Sum		—	—
Remove Duplicates from Sorted Array remove-duplicates-from-sorted-array	ArrayTwo Pointers	—		—
Reorganize String reorganize-string	Hash TableStringGreedySortingHeap (Priority Queue)Counting		—	—
Serialize and Deserialize Binary Tree serialize-and-deserialize-binary-tree	StringTreeDepth-First SearchBreadth-First SearchDesignBinary Tree		—	—
Sliding Puzzle sliding-puzzle	ArrayDynamic ProgrammingBacktrackingBreadth-First SearchMemoizationMatrix		—	—
Sqrt(x) sqrtx	MathBinary Search		—	—
Subarray Sum Equals K subarray-sum-equals-k	ArrayHash TablePrefix Sum		—	—
Subsets subsets	ArrayBacktrackingBit Manipulation		—	—
Subtree of Another Tree subtree-of-another-tree	TreeDepth-First SearchString MatchingBinary TreeHash Function		—	—
Triangle triangle	ArrayDynamic Programming		—	—
Two Sum two-sum	ArrayHash Table		—	—
Two Sum II - Input Array Is Sorted two-sum-ii-input-array-is-sorted	ArrayTwo PointersBinary Search	—		—
Ugly Number II ugly-number-ii	Hash TableMathDynamic ProgrammingHeap (Priority Queue)		—	—
Unique Paths unique-paths	MathDynamic ProgrammingCombinatorics			—
Valid Palindrome valid-palindrome	Two PointersString	—		—
Validate Binary Search Tree validate-binary-search-tree	TreeDepth-First SearchBinary Search TreeBinary Tree		—	—
Word Break word-break	ArrayHash TableStringDynamic ProgrammingTrieMemoization		—	—
Word Ladder word-ladder	Hash TableStringBreadth-First Search		—	—

Eureka

Search

Difficulty

Language

Categories