Skip to content

rubyfish/Grind169

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Grind169

A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0036-valid-sudoku
0041-first-missing-positive
0049-group-anagrams
0073-set-matrix-zeroes
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0128-longest-consecutive-sequence
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0380-insert-delete-getrandom-o1
0383-ransom-note
0387-first-unique-character-in-a-string
0438-find-all-anagrams-in-a-string
2059-unique-length-3-palindromic-subsequences
3621-minimum-operations-to-make-array-values-equal-to-k

String

0003-longest-substring-without-repeating-characters
0014-longest-common-prefix
0020-valid-parentheses
0022-generate-parentheses
0049-group-anagrams
0076-minimum-window-substring
0125-valid-palindrome
0242-valid-anagram
0383-ransom-note
0387-first-unique-character-in-a-string
0438-find-all-anagrams-in-a-string
1700-minimum-time-to-make-rope-colorful
1894-merge-strings-alternately
2059-unique-length-3-palindromic-subsequences

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0438-find-all-anagrams-in-a-string

Array

0001-two-sum
0004-median-of-two-sorted-arrays
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0033-search-in-rotated-sorted-array
0036-valid-sudoku
0041-first-missing-positive
0046-permutations
0049-group-anagrams
0053-maximum-subarray
0054-spiral-matrix
0056-merge-intervals
0066-plus-one
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0075-sort-colors
0078-subsets
0088-merge-sorted-array
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0128-longest-consecutive-sequence
0152-maximum-product-subarray
0153-find-minimum-in-rotated-sorted-array
0200-number-of-islands
0217-contains-duplicate
0238-product-of-array-except-self
0252-meeting-rooms
0268-missing-number
0283-move-zeroes
0322-coin-change
0380-insert-delete-getrandom-o1
0435-non-overlapping-intervals
0542-01-matrix
0733-flood-fill
0739-daily-temperatures
0792-binary-search
1085-the-earliest-moment-when-everyone-become-friends
1102-check-if-a-number-is-majority-element-in-a-sorted-array
1165-meeting-scheduler
1184-car-pooling
1700-minimum-time-to-make-rope-colorful
3621-minimum-operations-to-make-array-values-equal-to-k

Two Pointers

0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0075-sort-colors
0088-merge-sorted-array
0125-valid-palindrome
0283-move-zeroes
1165-meeting-scheduler
1894-merge-strings-alternately

Sorting

0015-3sum
0049-group-anagrams
0056-merge-intervals
0075-sort-colors
0088-merge-sorted-array
0217-contains-duplicate
0242-valid-anagram
0252-meeting-rooms
0268-missing-number
0435-non-overlapping-intervals
1085-the-earliest-moment-when-everyone-become-friends
1165-meeting-scheduler
1184-car-pooling

Stack

0020-valid-parentheses
0739-daily-temperatures

Monotonic Stack

0739-daily-temperatures

Dynamic Programming

0022-generate-parentheses
0053-maximum-subarray
0070-climbing-stairs
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0124-binary-tree-maximum-path-sum
0152-maximum-product-subarray
0322-coin-change
0435-non-overlapping-intervals
0542-01-matrix
1700-minimum-time-to-make-rope-colorful

Greedy

0011-container-with-most-water
0122-best-time-to-buy-and-sell-stock-ii
0435-non-overlapping-intervals
1700-minimum-time-to-make-rope-colorful

Prefix Sum

0238-product-of-array-except-self
1184-car-pooling
2059-unique-length-3-palindromic-subsequences

Divide and Conquer

0004-median-of-two-sorted-arrays
0053-maximum-subarray
0105-construct-binary-tree-from-preorder-and-inorder-traversal

Counting

0383-ransom-note
0387-first-unique-character-in-a-string

Math

0066-plus-one
0070-climbing-stairs
0268-missing-number
0326-power-of-three
0380-insert-delete-getrandom-o1
2998-count-symmetric-integers

Binary Search

0004-median-of-two-sorted-arrays
0033-search-in-rotated-sorted-array
0074-search-a-2d-matrix
0153-find-minimum-in-rotated-sorted-array
0268-missing-number
0792-binary-search
1102-check-if-a-number-is-majority-element-in-a-sorted-array

Bit Manipulation

0078-subsets
0268-missing-number
2059-unique-length-3-palindromic-subsequences

Design

0380-insert-delete-getrandom-o1

Randomized

0380-insert-delete-getrandom-o1

Matrix

0036-valid-sudoku
0054-spiral-matrix
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0200-number-of-islands
0542-01-matrix
0733-flood-fill

Backtracking

0022-generate-parentheses
0046-permutations
0077-combinations
0078-subsets

Simulation

0054-spiral-matrix
1184-car-pooling

Tree

0098-validate-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0124-binary-tree-maximum-path-sum
0199-binary-tree-right-side-view
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0572-subtree-of-another-tree

Depth-First Search

0098-validate-binary-search-tree
0100-same-tree
0104-maximum-depth-of-binary-tree
0124-binary-tree-maximum-path-sum
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0572-subtree-of-another-tree
0733-flood-fill

Binary Search Tree

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

Binary Tree

0098-validate-binary-search-tree
0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0124-binary-tree-maximum-path-sum
0199-binary-tree-right-side-view
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0572-subtree-of-another-tree

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0322-coin-change
0542-01-matrix
0733-flood-fill

Union Find

0128-longest-consecutive-sequence
0200-number-of-islands
1085-the-earliest-moment-when-everyone-become-friends

Trie

0014-longest-common-prefix

Memoization

0070-climbing-stairs

Graph

0207-course-schedule
0210-course-schedule-ii
1101-parallel-courses

Topological Sort

0207-course-schedule
0210-course-schedule-ii
1101-parallel-courses

Enumeration

2998-count-symmetric-integers

String Matching

0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-tree

Heap (Priority Queue)

1184-car-pooling

Recursion

0326-power-of-three

Queue

0387-first-unique-character-in-a-string

About

A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages