Skip to content

About

Curated solutions to LeetCode Data Structures & Algorithms problems in Java with detailed time and space complexity analysis.

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

562 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode

Collection of LeetCode questions to ace the coding interview! - Created using LeetHub

LeetCode Topics

Array

0001-two-sum
0011-container-with-most-water
0014-longest-common-prefix
0033-search-in-rotated-sorted-array
0046-permutations
0049-group-anagrams
0051-n-queens
0053-maximum-subarray
0054-spiral-matrix
0064-minimum-path-sum
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0078-subsets
0121-best-time-to-buy-and-sell-stock
0128-longest-consecutive-sequence
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0200-number-of-islands
0209-minimum-size-subarray-sum
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0238-product-of-array-except-self
0239-sliding-window-maximum
0268-missing-number
0283-move-zeroes
0287-find-the-duplicate-number
0303-range-sum-query-immutable
0347-top-k-frequent-elements
0448-find-all-numbers-disappeared-in-an-array
0525-contiguous-array
0560-subarray-sum-equals-k
0643-maximum-average-subarray-i
0658-find-k-closest-elements
0704-binary-search
0744-find-smallest-letter-greater-than-target
0912-sort-an-array
0977-squares-of-a-sorted-array
1482-how-many-numbers-are-smaller-than-the-current-number
1631-path-with-minimum-effort

Two Pointers

0011-container-with-most-water
0019-remove-nth-node-from-end-of-list
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0167-two-sum-ii-input-array-is-sorted
0234-palindrome-linked-list
0283-move-zeroes
0287-find-the-duplicate-number
0344-reverse-string
0392-is-subsequence
0653-two-sum-iv-input-is-a-bst
0658-find-k-closest-elements
0844-backspace-string-compare
0876-middle-of-the-linked-list
0977-squares-of-a-sorted-array

Binary Search

0033-search-in-rotated-sorted-array
0074-search-a-2d-matrix
0167-two-sum-ii-input-array-is-sorted
0209-minimum-size-subarray-sum
0268-missing-number
0287-find-the-duplicate-number
0658-find-k-closest-elements
0704-binary-search
0744-find-smallest-letter-greater-than-target
1631-path-with-minimum-effort

Bit Manipulation

0078-subsets
0268-missing-number
0287-find-the-duplicate-number

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0049-group-anagrams
0073-set-matrix-zeroes
0076-minimum-window-substring
0128-longest-consecutive-sequence
0141-linked-list-cycle
0142-linked-list-cycle-ii
0169-majority-element
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0448-find-all-numbers-disappeared-in-an-array
0525-contiguous-array
0560-subarray-sum-equals-k
0653-two-sum-iv-input-is-a-bst
1482-how-many-numbers-are-smaller-than-the-current-number

Sorting

0049-group-anagrams
0169-majority-element
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0658-find-k-closest-elements
0912-sort-an-array
0977-squares-of-a-sorted-array
1482-how-many-numbers-are-smaller-than-the-current-number

Counting Sort

0169-majority-element
0347-top-k-frequent-elements
0912-sort-an-array
1482-how-many-numbers-are-smaller-than-the-current-number

Matrix

0054-spiral-matrix
0064-minimum-path-sum
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0200-number-of-islands
1631-path-with-minimum-effort

Simulation

0054-spiral-matrix
0844-backspace-string-compare

Tree

0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree

Depth-First Search

0100-same-tree
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0200-number-of-islands
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0653-two-sum-iv-input-is-a-bst
0743-network-delay-time
1631-path-with-minimum-effort

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree
0200-number-of-islands
0226-invert-binary-tree
0653-two-sum-iv-input-is-a-bst
0743-network-delay-time
1631-path-with-minimum-effort

Binary Search Tree

0230-kth-smallest-element-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree

Binary Tree

0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree

Greedy

0011-container-with-most-water

Linked List

0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0083-remove-duplicates-from-sorted-list
0092-reverse-linked-list-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list
0876-middle-of-the-linked-list

Design

0303-range-sum-query-immutable

Prefix Sum

0209-minimum-size-subarray-sum
0238-product-of-array-except-self
0303-range-sum-query-immutable
0525-contiguous-array
0560-subarray-sum-equals-k

Recursion

0021-merge-two-sorted-lists
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list

String

0003-longest-substring-without-repeating-characters
0014-longest-common-prefix
0020-valid-parentheses
0022-generate-parentheses
0049-group-anagrams
0058-length-of-last-word
0076-minimum-window-substring
0125-valid-palindrome
0242-valid-anagram
0344-reverse-string
0392-is-subsequence
0844-backspace-string-compare

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0209-minimum-size-subarray-sum
0239-sliding-window-maximum
0643-maximum-average-subarray-i
0658-find-k-closest-elements

Divide and Conquer

0023-merge-k-sorted-lists
0053-maximum-subarray
0169-majority-element
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0912-sort-an-array

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0347-top-k-frequent-elements
0658-find-k-closest-elements
0743-network-delay-time
0912-sort-an-array
1631-path-with-minimum-effort

Merge Sort

0023-merge-k-sorted-lists
0912-sort-an-array

Quickselect

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Backtracking

0022-generate-parentheses
0046-permutations
0051-n-queens
0078-subsets
0113-path-sum-ii

Queue

0239-sliding-window-maximum

Monotonic Queue

0239-sliding-window-maximum

Dynamic Programming

0022-generate-parentheses
0053-maximum-subarray
0064-minimum-path-sum
0121-best-time-to-buy-and-sell-stock
0392-is-subsequence

Bucket Sort

0347-top-k-frequent-elements
0912-sort-an-array

Radix Sort

0912-sort-an-array

Union Find

0128-longest-consecutive-sequence
0200-number-of-islands

Floyd's Cycle Finding Algorithm

0141-linked-list-cycle

Math

0007-reverse-integer
0268-missing-number

Boyer–Moore Majority Vote Algorithm

0169-majority-element

Stack

0020-valid-parentheses
0234-palindrome-linked-list
0844-backspace-string-compare

Bracket Sequences

0020-valid-parentheses
0022-generate-parentheses

Trie

0014-longest-common-prefix

Graph Theory

0743-network-delay-time

Shortest Path

0743-network-delay-time

Dijkstra's Algorithm

0743-network-delay-time
1631-path-with-minimum-effort

Union-Find

1631-path-with-minimum-effort

About

Curated solutions to LeetCode Data Structures & Algorithms problems in Java with detailed time and space complexity analysis.

Topics

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages