Skip to content

dsankov/leetcode

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

leetcode

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

Math

0007-reverse-integer
0523-continuous-subarray-sum

Array

0330-patching-array
0502-ipo
0523-continuous-subarray-sum
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique
1044-find-common-characters
1138-grumpy-bookstore-owner
1217-relative-sort-array
1605-minimum-number-of-days-to-make-m-bouquets
1730-special-array-with-x-elements-greater-than-or-equal-x

Hash Table

0017-letter-combinations-of-a-phone-number
0523-continuous-subarray-sum
0876-hand-of-straights
1044-find-common-characters
1217-relative-sort-array

String

0017-letter-combinations-of-a-phone-number
1044-find-common-characters
1321-get-equal-substrings-within-budget

Greedy

0330-patching-array
0502-ipo
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique

Sorting

0502-ipo
0853-most-profit-assigning-work
0876-hand-of-straights
0982-minimum-increment-to-make-array-unique
1217-relative-sort-array
1730-special-array-with-x-elements-greater-than-or-equal-x

Prefix Sum

0523-continuous-subarray-sum
1321-get-equal-substrings-within-budget

Binary Search

0853-most-profit-assigning-work
1321-get-equal-substrings-within-budget
1605-minimum-number-of-days-to-make-m-bouquets
1730-special-array-with-x-elements-greater-than-or-equal-x

Sliding Window

1138-grumpy-bookstore-owner
1321-get-equal-substrings-within-budget

Counting Sort

0982-minimum-increment-to-make-array-unique
1217-relative-sort-array

Linked List

0024-swap-nodes-in-pairs

Recursion

0024-swap-nodes-in-pairs

Heap (Priority Queue)

0502-ipo

Two Pointers

0853-most-profit-assigning-work

Backtracking

0017-letter-combinations-of-a-phone-number

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

LeetCode Topics

Math

1477-product-of-the-last-k-numbers
2645-pass-the-pillow
2802-find-the-punishment-number-of-an-integer

Simulation

2645-pass-the-pillow
3434-find-the-number-of-distinct-colors-among-the-balls

Array

1025-minimum-cost-for-tickets
1477-product-of-the-last-k-numbers
1819-construct-the-lexicographically-largest-valid-sequence
3434-find-the-number-of-distinct-colors-among-the-balls

Dynamic Programming

1025-minimum-cost-for-tickets

Hash Table

1160-letter-tile-possibilities
3434-find-the-number-of-distinct-colors-among-the-balls

Design

1477-product-of-the-last-k-numbers

Data Stream

1477-product-of-the-last-k-numbers

Prefix Sum

1477-product-of-the-last-k-numbers

Backtracking

1160-letter-tile-possibilities
1819-construct-the-lexicographically-largest-valid-sequence
2456-construct-smallest-number-from-di-string
2802-find-the-punishment-number-of-an-integer

String

1160-letter-tile-possibilities
2456-construct-smallest-number-from-di-string

Counting

1160-letter-tile-possibilities

Stack

2456-construct-smallest-number-from-di-string

Greedy

2456-construct-smallest-number-from-di-string

Releases

No releases published

Packages

No packages published

Languages