Skip to content

OfficialSahil548k/LeetCode-submissions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

308 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode-submissions

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

LeetCode Topics

Array

0001-two-sum
0014-longest-common-prefix
0015-3sum
0016-3sum-closest
0026-remove-duplicates-from-sorted-array
0027-remove-element
0033-search-in-rotated-sorted-array
0045-jump-game-ii
0055-jump-game
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0705-design-hashset
0706-design-hashmap
1288-remove-covered-intervals
1301-number-of-paths-with-max-score
1306-jump-game-iii
1331-rank-transform-of-an-array
1345-jump-game-iv
1752-check-if-array-is-sorted-and-rotated
1846-maximum-element-after-decreasing-and-rearranging
1967-number-of-strings-that-appear-as-substrings-in-word
2161-partition-array-according-to-given-pivot
2196-create-binary-tree-from-descriptions
2540-minimum-common-value
2574-left-and-right-sum-differences
2657-find-the-prefix-common-array-of-two-arrays
2784-check-if-array-is-good
2812-find-the-safest-path-in-a-grid
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3005-count-elements-with-maximum-frequency
3042-count-prefix-and-suffix-pairs-i
3043-find-the-length-of-the-longest-common-prefix
3045-count-prefix-and-suffix-pairs-ii
3286-find-a-safe-walk-through-a-grid
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii
3689-maximum-total-subarray-value-i
3691-maximum-total-subarray-value-ii
3838-weighted-word-mapping

Hash Table

0001-two-sum
0012-integer-to-roman
0017-letter-combinations-of-a-phone-number
0205-isomorphic-strings
0705-design-hashset
0706-design-hashmap
1331-rank-transform-of-an-array
1345-jump-game-iv
1358-number-of-substrings-containing-all-three-characters
2196-create-binary-tree-from-descriptions
2540-minimum-common-value
2657-find-the-prefix-common-array-of-two-arrays
2784-check-if-array-is-good
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3005-count-elements-with-maximum-frequency
3043-find-the-length-of-the-longest-common-prefix
3325-count-substrings-with-k-frequency-characters-i
3532-path-existence-queries-in-a-graph-i

Sorting

0015-3sum
0016-3sum-closest
1288-remove-covered-intervals
1331-rank-transform-of-an-array
1846-maximum-element-after-decreasing-and-rearranging
2784-check-if-array-is-good
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3534-path-existence-queries-in-a-graph-ii

Binary Search

0033-search-in-rotated-sorted-array
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
2540-minimum-common-value
2812-find-the-safest-path-in-a-grid
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii

Dynamic Programming

0005-longest-palindromic-substring
0022-generate-parentheses
0045-jump-game-ii
0055-jump-game
0097-interleaving-string
1301-number-of-paths-with-max-score
3534-path-existence-queries-in-a-graph-ii

Greedy

0045-jump-game-ii
0055-jump-game
1846-maximum-element-after-decreasing-and-rearranging
3534-path-existence-queries-in-a-graph-ii
3689-maximum-total-subarray-value-i
3691-maximum-total-subarray-value-ii

Depth-First Search

0572-subtree-of-another-tree
1306-jump-game-iii
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3558-number-of-ways-to-assign-edge-weights-i

Breadth-First Search

1306-jump-game-iii
1345-jump-game-iv
2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Tree

0572-subtree-of-another-tree
2196-create-binary-tree-from-descriptions
3558-number-of-ways-to-assign-edge-weights-i

String Matching

0005-longest-palindromic-substring
0006-zigzag-conversion
0012-integer-to-roman
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0043-multiply-strings
0097-interleaving-string
0125-valid-palindrome
0205-isomorphic-strings
0415-add-strings
0572-subtree-of-another-tree
1358-number-of-substrings-containing-all-three-characters
1967-number-of-strings-that-appear-as-substrings-in-word
3042-count-prefix-and-suffix-pairs-i
3043-find-the-length-of-the-longest-common-prefix
3045-count-prefix-and-suffix-pairs-ii
3325-count-substrings-with-k-frequency-characters-i
3612-process-string-with-special-operations-i
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii
3838-weighted-word-mapping

Binary Tree

0572-subtree-of-another-tree
2196-create-binary-tree-from-descriptions

Hash Function

0572-subtree-of-another-tree
0705-design-hashset
0706-design-hashmap
3042-count-prefix-and-suffix-pairs-i
3045-count-prefix-and-suffix-pairs-ii

Two Pointers

0005-longest-palindromic-substring
0015-3sum
0016-3sum-closest
0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string
0125-valid-palindrome
2095-delete-the-middle-node-of-a-linked-list
2130-maximum-twin-sum-of-a-linked-list
2161-partition-array-according-to-given-pivot
2540-minimum-common-value
3534-path-existence-queries-in-a-graph-ii

Bit Manipulation

0029-divide-two-integers
2657-find-the-prefix-common-array-of-two-arrays
3534-path-existence-queries-in-a-graph-ii

Trie

0014-longest-common-prefix
3042-count-prefix-and-suffix-pairs-i
3043-find-the-length-of-the-longest-common-prefix
3045-count-prefix-and-suffix-pairs-ii

Prefix Sum

2574-left-and-right-sum-differences
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii

Simulation

0043-multiply-strings
0415-add-strings
2161-partition-array-according-to-given-pivot
3612-process-string-with-special-operations-i
3838-weighted-word-mapping

Math

0002-add-two-numbers
0007-reverse-integer
0009-palindrome-number
0012-integer-to-roman
0029-divide-two-integers
0043-multiply-strings
0415-add-strings
3558-number-of-ways-to-assign-edge-weights-i
3658-gcd-of-odd-and-even-sums
3754-concatenate-non-zero-digits-and-multiply-by-sum-i
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii

Segment Tree

3691-maximum-total-subarray-value-ii

Heap (Priority Queue)

2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid
3691-maximum-total-subarray-value-ii

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0705-design-hashset
0706-design-hashmap
2095-delete-the-middle-node-of-a-linked-list
2130-maximum-twin-sum-of-a-linked-list

Stack

0020-valid-parentheses
2130-maximum-twin-sum-of-a-linked-list

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses

Sliding Window

1358-number-of-substrings-containing-all-three-characters
3325-count-substrings-with-k-frequency-characters-i

Union-Find

2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
2812-find-the-safest-path-in-a-grid
3532-path-existence-queries-in-a-graph-i

Matrix

1301-number-of-paths-with-max-score
2812-find-the-safest-path-in-a-grid
3286-find-a-safe-walk-through-a-grid

Graph Theory

2492-minimum-score-of-a-path-between-two-cities
2685-count-the-number-of-complete-components
3286-find-a-safe-walk-through-a-grid
3532-path-existence-queries-in-a-graph-i
3534-path-existence-queries-in-a-graph-ii

Shortest Path

3286-find-a-safe-walk-through-a-grid

Design

0705-design-hashset
0706-design-hashmap

Counting

3005-count-elements-with-maximum-frequency

Rolling Hash

3042-count-prefix-and-suffix-pairs-i
3045-count-prefix-and-suffix-pairs-ii

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs

Enumeration

1291-sequential-digits

Number Theory

3658-gcd-of-odd-and-even-sums

About

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

Resources

Stars

1 star

Watchers

0 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages