Skip to content

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

0 watching

Forks

Latest commit

 

History

369 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode-Solutions

LeetCode Topics

Math

0069-sqrtx
0070-climbing-stairs
0231-power-of-two
0367-valid-perfect-square
1903-largest-odd-number-in-string
2235-add-two-integers

Linked List

0019-remove-nth-node-from-end-of-list
0025-reverse-nodes-in-k-group
0061-rotate-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0160-intersection-of-two-linked-lists
0206-reverse-linked-list
0234-palindrome-linked-list
0328-odd-even-linked-list
0876-middle-of-the-linked-list
2095-delete-the-middle-node-of-a-linked-list

Two Pointers

0019-remove-nth-node-from-end-of-list
0061-rotate-list
0088-merge-sorted-array
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0160-intersection-of-two-linked-lists
0234-palindrome-linked-list
0876-middle-of-the-linked-list
2095-delete-the-middle-node-of-a-linked-list

Recursion

0025-reverse-nodes-in-k-group
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list

Hash Table

0001-two-sum
0049-group-anagrams
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0208-implement-trie-prefix-tree

Stack

0020-valid-parentheses
0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list
1008-construct-binary-search-tree-from-preorder-traversal

Divide and Conquer

0148-sort-list
0215-kth-largest-element-in-an-array
0240-search-a-2d-matrix-ii
1985-find-the-kth-largest-integer-in-the-array

Sorting

0049-group-anagrams
0056-merge-intervals
0088-merge-sorted-array
0148-sort-list
0179-largest-number
0215-kth-largest-element-in-an-array
1985-find-the-kth-largest-integer-in-the-array

Merge Sort

0148-sort-list

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0703-kth-largest-element-in-a-stream
1008-construct-binary-search-tree-from-preorder-traversal

Binary Search Tree

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0069-sqrtx
0098-validate-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0240-search-a-2d-matrix-ii
0367-valid-perfect-square
0450-delete-node-in-a-bst
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0703-kth-largest-element-in-a-stream
0704-binary-search
0744-find-smallest-letter-greater-than-target
1008-construct-binary-search-tree-from-preorder-traversal

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0703-kth-largest-element-in-a-stream
1008-construct-binary-search-tree-from-preorder-traversal

String

0020-valid-parentheses
0049-group-anagrams
0058-length-of-last-word
0179-largest-number
0208-implement-trie-prefix-tree
1903-largest-odd-number-in-string
1985-find-the-kth-largest-integer-in-the-array

Design

0208-implement-trie-prefix-tree
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0703-kth-largest-element-in-a-stream

Trie

0208-implement-trie-prefix-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree

Breadth-First Search

0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0322-coin-change
0994-rotting-oranges

Array

0001-two-sum
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0045-jump-game-ii
0049-group-anagrams
0056-merge-intervals
0057-insert-interval
0088-merge-sorted-array
0136-single-number
0179-largest-number
0198-house-robber
0215-kth-largest-element-in-an-array
0240-search-a-2d-matrix-ii
0322-coin-change
0704-binary-search
0744-find-smallest-letter-greater-than-target
0994-rotting-oranges
1008-construct-binary-search-tree-from-preorder-traversal
1046-last-stone-weight
1985-find-the-kth-largest-integer-in-the-array
2558-take-gifts-from-the-richest-pile

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks

Dynamic Programming

0045-jump-game-ii
0070-climbing-stairs
0198-house-robber
0322-coin-change

Greedy

0045-jump-game-ii
0179-largest-number
1903-largest-odd-number-in-string

Database

0182-duplicate-emails
0183-customers-who-never-order

Bit Manipulation

0136-single-number
0231-power-of-two
2220-minimum-bit-flips-to-convert-number

Matrix

0240-search-a-2d-matrix-ii
0994-rotting-oranges

Heap (Priority Queue)

0215-kth-largest-element-in-an-array
0703-kth-largest-element-in-a-stream
1046-last-stone-weight
1985-find-the-kth-largest-integer-in-the-array
2558-take-gifts-from-the-richest-pile

Data Stream

0703-kth-largest-element-in-a-stream

Simulation

2558-take-gifts-from-the-richest-pile

Quickselect

0215-kth-largest-element-in-an-array
1985-find-the-kth-largest-integer-in-the-array

Newton's Method

0069-sqrtx

Monotonic Stack

1008-construct-binary-search-tree-from-preorder-traversal

Quicksort

0056-merge-intervals

Binary Lifting

0235-lowest-common-ancestor-of-a-binary-search-tree

Lowest Common Ancestor

0235-lowest-common-ancestor-of-a-binary-search-tree

Knapsack Problem

0322-coin-change

Complete Knapsack

0322-coin-change

Memoization

0070-climbing-stairs

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages