Skip to content

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)

Notifications You must be signed in to change notification settings

tomas-sucena/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode

This repository, which was created using LeetHub, contains my solutions to the LeetCode problems I solve.

To visit my LeetCode profile, please click here.

NOTE: While some solutions are marked with a runtime of 0ms, that is most likely due to an error with LeetCode's code runner and not their actual runtime.

LeetCode Topics

Stack

0071-simplify-path
0145-binary-tree-postorder-traversal
0957-minimum-add-to-make-parentheses-valid
1197-parsing-a-boolean-expression
1497-design-a-stack-with-increment-operation
2800-minimum-string-length-after-removing-substrings

Tree

0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0145-binary-tree-postorder-traversal
1254-deepest-leaves-sum
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree

Depth-First Search

0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0145-binary-tree-postorder-traversal
1254-deepest-leaves-sum
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree

Binary Tree

0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0113-path-sum-ii
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0145-binary-tree-postorder-traversal
1254-deepest-leaves-sum
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree

Array

0045-jump-game-ii
0054-spiral-matrix
0059-spiral-matrix-ii
0064-minimum-path-sum
0074-search-a-2d-matrix
0075-sort-colors
0078-subsets
0108-convert-sorted-array-to-binary-search-tree
0120-triangle
0136-single-number
0153-find-minimum-in-rotated-sorted-array
0169-majority-element
0189-rotate-array
0204-count-primes
0240-search-a-2d-matrix-ii
0816-design-hashset
0859-design-circular-deque
1027-sum-of-even-numbers-after-queries
1256-rank-transform-of-an-array
1325-path-with-maximum-probability
1435-xor-queries-of-a-subarray
1497-design-a-stack-with-increment-operation
1620-check-if-array-pairs-are-divisible-by-k
1786-count-the-number-of-consistent-strings
2006-find-the-student-that-will-replace-the-chalk
2155-find-missing-observations
2476-check-distances-between-same-letters
2503-longest-subarray-with-maximum-bitwise-and
2581-divide-players-into-teams-of-equal-skill
2728-sum-in-a-matrix
3165-find-indices-with-index-and-value-difference-i
3324-split-the-array
3501-delete-nodes-from-linked-list-present-in-array

Graph

1325-path-with-maximum-probability

Heap (Priority Queue)

1325-path-with-maximum-probability
2728-sum-in-a-matrix

Shortest Path

1325-path-with-maximum-probability

Binary Search

0074-search-a-2d-matrix
0153-find-minimum-in-rotated-sorted-array
0240-search-a-2d-matrix-ii
2006-find-the-student-that-will-replace-the-chalk

Simulation

0054-spiral-matrix
0059-spiral-matrix-ii
1027-sum-of-even-numbers-after-queries
1800-concatenation-of-consecutive-binary-numbers
2006-find-the-student-that-will-replace-the-chalk
2155-find-missing-observations
2645-pass-the-pillow
2728-sum-in-a-matrix
2800-minimum-string-length-after-removing-substrings

Prefix Sum

1435-xor-queries-of-a-subarray
2006-find-the-student-that-will-replace-the-chalk

Math

0029-divide-two-integers
0189-rotate-array
0202-happy-number
0204-count-primes
0382-linked-list-random-node
1800-concatenation-of-consecutive-binary-numbers
2155-find-missing-observations
2645-pass-the-pillow
2903-insert-greatest-common-divisors-in-linked-list
3553-check-if-two-chessboard-squares-have-the-same-color
3567-convert-date-to-binary

Linked List

0061-rotate-list
0086-partition-list
0109-convert-sorted-list-to-binary-search-tree
0116-populating-next-right-pointers-in-each-node
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0382-linked-list-random-node
0725-split-linked-list-in-parts
0816-design-hashset
0838-design-linked-list
0859-design-circular-deque
1484-linked-list-in-binary-tree
2903-insert-greatest-common-divisors-in-linked-list
3501-delete-nodes-from-linked-list-present-in-array

Breadth-First Search

0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0116-populating-next-right-pointers-in-each-node
1254-deepest-leaves-sum
1484-linked-list-in-binary-tree

Hash Table

0141-linked-list-cycle
0142-linked-list-cycle-ii
0169-majority-element
0202-happy-number
0816-design-hashset
1256-rank-transform-of-an-array
1620-check-if-array-pairs-are-divisible-by-k
1786-count-the-number-of-consistent-strings
2427-first-letter-to-appear-twice
2476-check-distances-between-same-letters
2581-divide-players-into-teams-of-equal-skill
3324-split-the-array
3501-delete-nodes-from-linked-list-present-in-array

Two Pointers

0061-rotate-list
0075-sort-colors
0086-partition-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0151-reverse-words-in-a-string
0189-rotate-array
0202-happy-number
0344-reverse-string
2581-divide-players-into-teams-of-equal-skill
3165-find-indices-with-index-and-value-difference-i
3195-separate-black-and-white-balls

String

0071-simplify-path
0151-reverse-words-in-a-string
0344-reverse-string
0520-detect-capital
0957-minimum-add-to-make-parentheses-valid
1197-parsing-a-boolean-expression
1786-count-the-number-of-consistent-strings
2427-first-letter-to-appear-twice
2476-check-distances-between-same-letters
2580-circular-sentence
2800-minimum-string-length-after-removing-substrings
3195-separate-black-and-white-balls
3553-check-if-two-chessboard-squares-have-the-same-color
3567-convert-date-to-binary

Number Theory

0204-count-primes
2903-insert-greatest-common-divisors-in-linked-list

Dynamic Programming

0045-jump-game-ii
0064-minimum-path-sum
0120-triangle

Greedy

0045-jump-game-ii
0957-minimum-add-to-make-parentheses-valid
3195-separate-black-and-white-balls

Bit Manipulation

0029-divide-two-integers
0078-subsets
0136-single-number
1435-xor-queries-of-a-subarray
1441-minimum-flips-to-make-a-or-b-equal-to-c
1786-count-the-number-of-consistent-strings
1800-concatenation-of-consecutive-binary-numbers
2323-minimum-bit-flips-to-convert-number
2427-first-letter-to-appear-twice
2503-longest-subarray-with-maximum-bitwise-and

Reservoir Sampling

0382-linked-list-random-node

Randomized

0382-linked-list-random-node

Matrix

0054-spiral-matrix
0059-spiral-matrix-ii
0064-minimum-path-sum
0074-search-a-2d-matrix
0240-search-a-2d-matrix-ii
2728-sum-in-a-matrix

Counting

0169-majority-element
1620-check-if-array-pairs-are-divisible-by-k
1786-count-the-number-of-consistent-strings
2427-first-letter-to-appear-twice
3324-split-the-array

Brainteaser

2503-longest-subarray-with-maximum-bitwise-and

Sorting

0075-sort-colors
0148-sort-list
0169-majority-element
1256-rank-transform-of-an-array
2581-divide-players-into-teams-of-equal-skill
2728-sum-in-a-matrix

Backtracking

0078-subsets
0113-path-sum-ii

Divide and Conquer

0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0148-sort-list
0169-majority-element
0240-search-a-2d-matrix-ii

Design

0816-design-hashset
0838-design-linked-list
0859-design-circular-deque
1497-design-a-stack-with-increment-operation

Queue

0859-design-circular-deque

Hash Function

0816-design-hashset

Merge Sort

0148-sort-list

Enumeration

0204-count-primes

Recursion

1197-parsing-a-boolean-expression

Binary Search Tree

0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree

About

Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub](https://github.com/QasimWani/LeetHub)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published