Skip to content
/ LeetCodeProblems Public

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

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

MohamedSllaam/LeetCodeProblems

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

982 Commits
0058-length-of-last-word
0058-length-of-last-word
 
 
0125-valid-palindrome
0125-valid-palindrome
 
 
0541-reverse-string-ii
0541-reverse-string-ii
 
 
1003-check-if-word-is-valid-after-substitutions
1003-check-if-word-is-valid-after-substitutions
 
 
1005-maximize-sum-of-array-after-k-negations
1005-maximize-sum-of-array-after-k-negations
 
 
1013-partition-array-into-three-parts-with-equal-sum
1013-partition-array-into-three-parts-with-equal-sum
 
 
1016-binary-string-with-substrings-representing-1-to-n
1016-binary-string-with-substrings-representing-1-to-n
 
 
1019-next-greater-node-in-linked-list
1019-next-greater-node-in-linked-list
 
 
1021-remove-outermost-parentheses
1021-remove-outermost-parentheses
 
 
1022-sum-of-root-to-leaf-binary-numbers
1022-sum-of-root-to-leaf-binary-numbers
 
 
104-maximum-depth-of-binary-tree
104-maximum-depth-of-binary-tree
 
 
1047-remove-all-adjacent-duplicates-in-string
1047-remove-all-adjacent-duplicates-in-string
 
 
1051-height-checker
1051-height-checker
 
 
108-convert-sorted-array-to-binary-search-tree
108-convert-sorted-array-to-binary-search-tree
 
 
1122-relative-sort-array
1122-relative-sort-array
 
 
1160-find-words-that-can-be-formed-by-characters
1160-find-words-that-can-be-formed-by-characters
 
 
1207-unique-number-of-occurrences
1207-unique-number-of-occurrences
 
 
1209-remove-all-adjacent-duplicates-in-string-ii
1209-remove-all-adjacent-duplicates-in-string-ii
 
 
121-best-time-to-buy-and-sell-stock
121-best-time-to-buy-and-sell-stock
 
 
1247-minimum-swaps-to-make-strings-equal
1247-minimum-swaps-to-make-strings-equal
 
 
1249-minimum-remove-to-make-valid-parentheses
1249-minimum-remove-to-make-valid-parentheses
 
 
1281-subtract-the-product-and-sum-of-digits-of-an-integer
1281-subtract-the-product-and-sum-of-digits-of-an-integer
 
 
1282-group-the-people-given-the-group-size-they-belong-to
1282-group-the-people-given-the-group-size-they-belong-to
 
 
1301-reformat-department-table
1301-reformat-department-table
 
 
1302-delete-characters-to-make-fancy-string
1302-delete-characters-to-make-fancy-string
 
 
1304-find-n-unique-integers-sum-up-to-zero
1304-find-n-unique-integers-sum-up-to-zero
 
 
1310-xor-queries-of-a-subarray
1310-xor-queries-of-a-subarray
 
 
1318-minimum-flips-to-make-a-or-b-equal-to-c
1318-minimum-flips-to-make-a-or-b-equal-to-c
 
 
1338-reduce-array-size-to-the-half
1338-reduce-array-size-to-the-half
 
 
1342-number-of-steps-to-reduce-a-number-to-zero
1342-number-of-steps-to-reduce-a-number-to-zero
 
 
1346-check-if-n-and-its-double-exist
1346-check-if-n-and-its-double-exist
 
 
1347-minimum-number-of-steps-to-make-two-strings-anagram
1347-minimum-number-of-steps-to-make-two-strings-anagram
 
 
136-single-number
136-single-number
 
 
1365-how-many-numbers-are-smaller-than-the-current-number
1365-how-many-numbers-are-smaller-than-the-current-number
 
 
137-single-number-ii
137-single-number-ii
 
 
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
 
 
1381-design-a-stack-with-increment-operation
1381-design-a-stack-with-increment-operation
 
 
1389-create-target-array-in-the-given-order
1389-create-target-array-in-the-given-order
 
 
1400-construct-k-palindrome-strings
1400-construct-k-palindrome-strings
 
 
143-reorder-list
143-reorder-list
 
 
1431-kids-with-the-greatest-number-of-candies
1431-kids-with-the-greatest-number-of-candies
 
 
144-binary-tree-preorder-traversal
144-binary-tree-preorder-traversal
 
 
1441-build-an-array-with-stack-operations
1441-build-an-array-with-stack-operations
 
 
1446-consecutive-characters
1446-consecutive-characters
 
 
145-binary-tree-postorder-traversal
145-binary-tree-postorder-traversal
 
 
1475-final-prices-with-a-special-discount-in-a-shop
1475-final-prices-with-a-special-discount-in-a-shop
 
 
1480-running-sum-of-1d-array
1480-running-sum-of-1d-array
 
 
1481-least-number-of-unique-integers-after-k-removals
1481-least-number-of-unique-integers-after-k-removals
 
 
1486-xor-operation-in-an-array
1486-xor-operation-in-an-array
 
 
151-reverse-words-in-a-string
151-reverse-words-in-a-string
 
 
1512-number-of-good-pairs
1512-number-of-good-pairs
 
 
153-find-minimum-in-rotated-sorted-array
153-find-minimum-in-rotated-sorted-array
 
 
1544-make-the-string-great
1544-make-the-string-great
 
 
1556-thousand-separator
1556-thousand-separator
 
 
16-3sum-closest
16-3sum-closest
 
 
160-intersection-of-two-linked-lists
160-intersection-of-two-linked-lists
 
 
1614-maximum-nesting-depth-of-the-parentheses
1614-maximum-nesting-depth-of-the-parentheses
 
 
1636-sort-array-by-increasing-frequency
1636-sort-array-by-increasing-frequency
 
 
1652-defuse-the-bomb
1652-defuse-the-bomb
 
 
1657-determine-if-two-strings-are-close
1657-determine-if-two-strings-are-close
 
 
1662-check-if-two-string-arrays-are-equivalent
1662-check-if-two-string-arrays-are-equivalent
 
 
1668-maximum-repeating-substring
1668-maximum-repeating-substring
 
 
1669-merge-in-between-linked-lists
1669-merge-in-between-linked-lists
 
 
167-two-sum-ii-input-array-is-sorted
167-two-sum-ii-input-array-is-sorted
 
 
1684-count-the-number-of-consistent-strings
1684-count-the-number-of-consistent-strings
 
 
17-letter-combinations-of-a-phone-number
17-letter-combinations-of-a-phone-number
 
 
1704-determine-if-string-halves-are-alike
1704-determine-if-string-halves-are-alike
 
 
1720-decode-xored-array
1720-decode-xored-array
 
 
1732-find-the-highest-altitude
1732-find-the-highest-altitude
 
 
1748-sum-of-unique-elements
1748-sum-of-unique-elements
 
 
1750-minimum-length-of-string-after-deleting-similar-ends
1750-minimum-length-of-string-after-deleting-similar-ends
 
 
1759-count-number-of-homogenous-substrings
1759-count-number-of-homogenous-substrings
 
 
1768-merge-strings-alternately
1768-merge-strings-alternately
 
 
1773-count-items-matching-a-rule
1773-count-items-matching-a-rule
 
 
1812-determine-color-of-a-chessboard-square
1812-determine-color-of-a-chessboard-square
 
 
1816-truncate-sentence
1816-truncate-sentence
 
 
1827-minimum-operations-to-make-the-array-increasing
1827-minimum-operations-to-make-the-array-increasing
 
 
1832-check-if-the-sentence-is-pangram
1832-check-if-the-sentence-is-pangram
 
 
1859-sorting-the-sentence
1859-sorting-the-sentence
 
 
1869-longer-contiguous-segments-of-ones-than-zeros
1869-longer-contiguous-segments-of-ones-than-zeros
 
 
1877-minimize-maximum-pair-sum-in-array
1877-minimize-maximum-pair-sum-in-array
 
 
1880-check-if-word-equals-summation-of-two-words
1880-check-if-word-equals-summation-of-two-words
 
 
189-rotate-array
189-rotate-array
 
 
1909-remove-one-element-to-make-the-array-strictly-increasing
1909-remove-one-element-to-make-the-array-strictly-increasing
 
 
191-number-of-1-bits
191-number-of-1-bits
 
 
1910-remove-all-occurrences-of-a-substring
1910-remove-all-occurrences-of-a-substring
 
 
1935-maximum-number-of-words-you-can-type
1935-maximum-number-of-words-you-can-type
 
 
1941-check-if-all-characters-have-equal-number-of-occurrences
1941-check-if-all-characters-have-equal-number-of-occurrences
 
 
1963-minimum-number-of-swaps-to-make-the-string-balanced
1963-minimum-number-of-swaps-to-make-the-string-balanced
 
 
1967-number-of-strings-that-appear-as-substrings-in-word
1967-number-of-strings-that-appear-as-substrings-in-word
 
 
1979-find-greatest-common-divisor-of-array
1979-find-greatest-common-divisor-of-array
 
 
1984-minimum-difference-between-highest-and-lowest-of-k-scores
1984-minimum-difference-between-highest-and-lowest-of-k-scores
 
 
1991-find-the-middle-index-in-array
1991-find-the-middle-index-in-array
 
 
2-add-two-numbers
2-add-two-numbers
 
 
20-valid-parentheses
20-valid-parentheses
 
 
2000-reverse-prefix-of-word
2000-reverse-prefix-of-word
 
 
2006-count-number-of-pairs-with-absolute-difference-k
2006-count-number-of-pairs-with-absolute-difference-k
 
 
202-happy-number
202-happy-number
 
 
2023-number-of-pairs-of-strings-with-concatenation-equal-to-target
2023-number-of-pairs-of-strings-with-concatenation-equal-to-target
 
 
2024-calculate-special-bonus
2024-calculate-special-bonus
 
 

Repository files navigation

LeetCodeProblems

Collection of LeetCode questions to ace the coding interview! this is my own repositoy.I'd like to share my solutions with other
LeetCode Account.

LeetCode Topics

String
0058-length-of-last-word
0125-valid-palindrome
0541-reverse-string-ii
1302-delete-characters-to-make-fancy-string
2580-circular-sentence
3451-string-compression-iii

Two Pointers
0125-valid-palindrome
0541-reverse-string-ii

Database
1301-reformat-department-table
2024-calculate-special-bonus
3451-find-invalid-ip-addresses
3465-find-products-with-valid-serial-numbers
3482-analyze-organization-hierarchy
3554-find-category-recommendation-pairs
3767-find-students-who-improved
3782-find-valid-emails
3816-dna-pattern-recognition
3865-find-product-recommendation-pairs
3898-seasonal-sales-analysis
3910-find-books-with-no-available-copies
3921-find-consistently-improving-employees
3932-find-covid-recovery-patients
3942-find-drivers-with-improved-fuel-efficiency
3943-find-overbooked-employees

About

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

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages