Skip to content

AM-ES-94/LeetCode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode

Two Pointers

0026-remove-duplicates-from-sorted-array
0075-sort-colors
0283-move-zeroes
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0633-sum-of-square-numbers
0853-most-profit-assigning-work
2572-append-characters-to-string-to-make-subsequence

String

0409-longest-palindrome
0648-replace-words
1044-find-common-characters
2572-append-characters-to-string-to-make-subsequence

Greedy

0330-patching-array
0409-longest-palindrome
0502-ipo
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique
2148-minimum-number-of-moves-to-seat-everyone
2572-append-characters-to-string-to-make-subsequence

Hash Table

0001-two-sum
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0409-longest-palindrome
0648-replace-words
0876-hand-of-straights
1044-find-common-characters
1217-relative-sort-array
1370-count-number-of-nice-subarrays

Array

0001-two-sum
0026-remove-duplicates-from-sorted-array
0075-sort-colors
0136-single-number
0283-move-zeroes
0330-patching-array
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0485-max-consecutive-ones
0502-ipo
0648-replace-words
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique
1037-minimum-number-of-k-consecutive-bit-flips
1044-find-common-characters
1137-height-checker
1138-grumpy-bookstore-owner
1217-relative-sort-array
1370-count-number-of-nice-subarrays
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
1605-minimum-number-of-days-to-make-m-bouquets
1675-magnetic-force-between-two-balls
1878-check-if-array-is-sorted-and-rotated
2148-minimum-number-of-moves-to-seat-everyone

Sorting

0075-sort-colors
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0502-ipo
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique
1137-height-checker
1217-relative-sort-array
1675-magnetic-force-between-two-balls
2148-minimum-number-of-moves-to-seat-everyone

Trie

0648-replace-words

Counting Sort

0982-minimum-increment-to-make-array-unique
1137-height-checker
1217-relative-sort-array

Bit Manipulation

0136-single-number
1037-minimum-number-of-k-consecutive-bit-flips

Binary Search

0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0633-sum-of-square-numbers
0853-most-profit-assigning-work
1605-minimum-number-of-days-to-make-m-bouquets
1675-magnetic-force-between-two-balls

Heap (Priority Queue)

0502-ipo
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Math

0633-sum-of-square-numbers
1370-count-number-of-nice-subarrays

Sliding Window

1037-minimum-number-of-k-consecutive-bit-flips
1138-grumpy-bookstore-owner
1370-count-number-of-nice-subarrays
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Queue

1037-minimum-number-of-k-consecutive-bit-flips
1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Ordered Set

1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Monotonic Queue

1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit

Prefix Sum

1037-minimum-number-of-k-consecutive-bit-flips

Tree

1114-binary-search-tree-to-greater-sum-tree

Depth-First Search

1114-binary-search-tree-to-greater-sum-tree

Binary Search Tree

1114-binary-search-tree-to-greater-sum-tree

Binary Tree

1114-binary-search-tree-to-greater-sum-tree

Graph

1916-find-center-of-star-graph

LeetCode Topics

Greedy

1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1711-find-valid-matrix-given-row-and-column-sums
2379-maximum-total-importance-of-roads
3276-minimum-number-of-pushes-to-type-word-ii

Graph

0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0801-is-graph-bipartite
0820-find-eventual-safe-states
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable
2171-second-minimum-time-to-reach-destination
2379-maximum-total-importance-of-roads
2472-build-a-matrix-with-conditions
3235-minimum-cost-to-convert-string-i

Sorting

0350-intersection-of-two-arrays-ii
0948-sort-an-array
1333-sort-the-jumbled-numbers
1556-make-two-arrays-equal-by-reversing-subarrays
1615-range-sum-of-sorted-subarray-sums
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
2379-maximum-total-importance-of-roads
2502-sort-the-people
2846-robot-collisions
3276-minimum-number-of-pushes-to-type-word-ii

Heap (Priority Queue)

0948-sort-an-array
2379-maximum-total-importance-of-roads

Depth-First Search

0094-binary-tree-inorder-traversal
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0801-is-graph-bipartite
0820-find-eventual-safe-states
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
1653-number-of-good-leaf-nodes-pairs

Breadth-First Search

0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0801-is-graph-bipartite
0820-find-eventual-safe-states
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
2171-second-minimum-time-to-reach-destination

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0820-find-eventual-safe-states
1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph
2472-build-a-matrix-with-conditions

Union Find

0200-number-of-islands
0547-number-of-provinces
0801-is-graph-bipartite
1701-remove-max-number-of-edges-to-keep-graph-fully-traversable

Array

0033-search-in-rotated-sorted-array
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
0153-find-minimum-in-rotated-sorted-array
0200-number-of-islands
0350-intersection-of-two-arrays-ii
0442-find-all-duplicates-in-an-array
0792-binary-search
0921-spiral-matrix-iii
0948-sort-an-array
1196-filling-bookcase-shelves
1293-three-consecutive-odds
1333-sort-the-jumbled-numbers
1496-lucky-numbers-in-a-matrix
1538-maximum-points-you-can-obtain-from-cards
1556-make-two-arrays-equal-by-reversing-subarrays
1615-range-sum-of-sorted-subarray-sums
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1711-find-valid-matrix-given-row-and-column-sums
1720-crawler-log-folder
1803-average-waiting-time
2163-kth-distinct-string-in-an-array
2255-minimum-swaps-to-group-all-1s-together-ii
2472-build-a-matrix-with-conditions
2502-sort-the-people
2846-robot-collisions
3235-minimum-cost-to-convert-string-i

Hash Table

0350-intersection-of-two-arrays-ii
0442-find-all-duplicates-in-an-array
1556-make-two-arrays-equal-by-reversing-subarrays
2163-kth-distinct-string-in-an-array
2502-sort-the-people
3276-minimum-number-of-pushes-to-type-word-ii

Two Pointers

0019-remove-nth-node-from-end-of-list
0350-intersection-of-two-arrays-ii
0908-middle-of-the-linked-list
1615-range-sum-of-sorted-subarray-sums
2216-delete-the-middle-node-of-a-linked-list

Binary Search

0033-search-in-rotated-sorted-array
0069-sqrtx
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
0153-find-minimum-in-rotated-sorted-array
0350-intersection-of-two-arrays-ii
0792-binary-search
1615-range-sum-of-sorted-subarray-sums

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0328-odd-even-linked-list
0908-middle-of-the-linked-list
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2216-delete-the-middle-node-of-a-linked-list
2299-merge-nodes-in-between-zeros

Math

0002-add-two-numbers
0069-sqrtx
1642-water-bottles
2645-pass-the-pillow

Simulation

0921-spiral-matrix-iii
1642-water-bottles
1803-average-waiting-time
2299-merge-nodes-in-between-zeros
2645-pass-the-pillow
2846-robot-collisions

Matrix

0074-search-a-2d-matrix
0200-number-of-islands
0921-spiral-matrix-iii
1496-lucky-numbers-in-a-matrix
1711-find-valid-matrix-given-row-and-column-sums
2472-build-a-matrix-with-conditions

String

1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder
1756-minimum-deletions-to-make-string-balanced
2163-kth-distinct-string-in-an-array
2502-sort-the-people
3235-minimum-cost-to-convert-string-i
3276-minimum-number-of-pushes-to-type-word-ii

Stack

0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
1298-reverse-substrings-between-each-pair-of-parentheses
1720-crawler-log-folder
1756-minimum-deletions-to-make-string-balanced
2846-robot-collisions

Recursion

0002-add-two-numbers

Tree

0094-binary-tree-inorder-traversal
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
1653-number-of-good-leaf-nodes-pairs

Binary Tree

0094-binary-tree-inorder-traversal
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
1653-number-of-good-leaf-nodes-pairs

Divide and Conquer

0948-sort-an-array

Merge Sort

0948-sort-an-array

Bucket Sort

0948-sort-an-array

Radix Sort

0948-sort-an-array

Counting Sort

0948-sort-an-array
2163-kth-distinct-string-in-an-array
3276-minimum-number-of-pushes-to-type-word-ii

Dynamic Programming

1196-filling-bookcase-shelves
1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1756-minimum-deletions-to-make-string-balanced

Shortest Path

1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
2171-second-minimum-time-to-reach-destination
3235-minimum-cost-to-convert-string-i

Sliding Window

1538-maximum-points-you-can-obtain-from-cards
2255-minimum-swaps-to-group-all-1s-together-ii

Prefix Sum

1538-maximum-points-you-can-obtain-from-cards

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages