GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - RuslanTsykaliak/LeetCode-TypeScript-JS-Python-Java: This repository serves as an excellent resource for anyone looking to improve their problem-solving skills, particularly in TypeScript, JavaScript, Python, PHP, and Java.

BranchesTags
Open more actions menu

Latest commit

 

History

2,885 Commits
2,885 Commits

Folders and files

NameName
Last commit message
Last commit date
0001-two-sum
0001-two-sum
 
 
0011-container-with-most-water
0011-container-with-most-water
 
 
0017-letter-combinations-of-a-phone-number
0017-letter-combinations-of-a-phone-number
 
 
0019-remove-nth-node-from-end-of-list
0019-remove-nth-node-from-end-of-list
 
 
0020-valid-parentheses
0020-valid-parentheses
 
 
0021-merge-two-sorted-lists
0021-merge-two-sorted-lists
 
 
0022-generate-parentheses
0022-generate-parentheses
 
 
0026-remove-duplicates-from-sorted-array
0026-remove-duplicates-from-sorted-array
 
 
0028-find-the-index-of-the-first-occurrence-in-a-string
0028-find-the-index-of-the-first-occurrence-in-a-string
 
 
0032-longest-valid-parentheses
0032-longest-valid-parentheses
 
 
0033-search-in-rotated-sorted-array
0033-search-in-rotated-sorted-array
 
 
0036-valid-sudoku
0036-valid-sudoku
 
 
0037-sudoku-solver
0037-sudoku-solver
 
 
0038-count-and-say
0038-count-and-say
 
 
0040-combination-sum-ii
0040-combination-sum-ii
 
 
0048-rotate-image
0048-rotate-image
 
 
0049-group-anagrams
0049-group-anagrams
 
 
0061-rotate-list
0061-rotate-list
 
 
0066-plus-one
0066-plus-one
 
 
0067-add-binary
0067-add-binary
 
 
0073-set-matrix-zeroes
0073-set-matrix-zeroes
 
 
0075-sort-colors
0075-sort-colors
 
 
0078-subsets
0078-subsets
 
 
0085-maximal-rectangle
0085-maximal-rectangle
 
 
0100-same-tree
0100-same-tree
 
 
0110-balanced-binary-tree
0110-balanced-binary-tree
 
 
0115-distinct-subsequences
0115-distinct-subsequences
 
 
0118-pascals-triangle
0118-pascals-triangle
 
 
0120-triangle
0120-triangle
 
 
0121-best-time-to-buy-and-sell-stock
0121-best-time-to-buy-and-sell-stock
 
 
0131-palindrome-partitioning
0131-palindrome-partitioning
 
 
0135-candy
0135-candy
 
 
0140-word-break-ii
0140-word-break-ii
 
 
0141-linked-list-cycle
0141-linked-list-cycle
 
 
0145-binary-tree-postorder-traversal
0145-binary-tree-postorder-traversal
 
 
0153-find-minimum-in-rotated-sorted-array
0153-find-minimum-in-rotated-sorted-array
 
 
0154-find-minimum-in-rotated-sorted-array-ii
0154-find-minimum-in-rotated-sorted-array-ii
 
 
0165-compare-version-numbers
0165-compare-version-numbers
 
 
0166-fraction-to-recurring-decimal
0166-fraction-to-recurring-decimal
 
 
0179-largest-number
0179-largest-number
 
 
0190-reverse-bits
0190-reverse-bits
 
 
0201-bitwise-and-of-numbers-range
0201-bitwise-and-of-numbers-range
 
 
0214-shortest-palindrome
0214-shortest-palindrome
 
 
0217-contains-duplicate
0217-contains-duplicate
 
 
0231-power-of-two
0231-power-of-two
 
 
0237-delete-node-in-a-linked-list
0237-delete-node-in-a-linked-list
 
 
0238-product-of-array-except-self
0238-product-of-array-except-self
 
 
0241-different-ways-to-add-parentheses
0241-different-ways-to-add-parentheses
 
 
0242-valid-anagram
0242-valid-anagram
 
 
0260-single-number-iii
0260-single-number-iii
 
 
0264-ugly-number-ii
0264-ugly-number-ii
 
 
0268-missing-number
0268-missing-number
 
 
0283-move-zeroes
0283-move-zeroes
 
 
0301-remove-invalid-parentheses
0301-remove-invalid-parentheses
 
 
0326-power-of-three
0326-power-of-three
 
 
0330-patching-array
0330-patching-array
 
 
0342-power-of-four
0342-power-of-four
 
 
0344-reverse-string
0344-reverse-string
 
 
0350-intersection-of-two-arrays-ii
0350-intersection-of-two-arrays-ii
 
 
0368-largest-divisible-subset
0368-largest-divisible-subset
 
 
0386-lexicographical-numbers
0386-lexicographical-numbers
 
 
0389-find-the-difference
0389-find-the-difference
 
 
0396-rotate-function
0396-rotate-function
 
 
0401-binary-watch
0401-binary-watch
 
 
0407-trapping-rain-water-ii
0407-trapping-rain-water-ii
 
 
0409-longest-palindrome
0409-longest-palindrome
 
 
0412-fizz-buzz
0412-fizz-buzz
 
 
0416-partition-equal-subset-sum
0416-partition-equal-subset-sum
 
 
0417-pacific-atlantic-water-flow
0417-pacific-atlantic-water-flow
 
 
0440-k-th-smallest-in-lexicographical-order
0440-k-th-smallest-in-lexicographical-order
 
 
0453-minimum-moves-to-equal-array-elements
0453-minimum-moves-to-equal-array-elements
 
 
0462-minimum-moves-to-equal-array-elements-ii
0462-minimum-moves-to-equal-array-elements-ii
 
 
0474-ones-and-zeroes
0474-ones-and-zeroes
 
 
0476-number-complement
0476-number-complement
 
 
0486-predict-the-winner
0486-predict-the-winner
 
 
0494-target-sum
0494-target-sum
 
 
0498-diagonal-traverse
0498-diagonal-traverse
 
 
0502-ipo
0502-ipo
 
 
0506-relative-ranks
0506-relative-ranks
 
 
0513-find-bottom-left-tree-value
0513-find-bottom-left-tree-value
 
 
0515-find-largest-value-in-each-tree-row
0515-find-largest-value-in-each-tree-row
 
 
0523-continuous-subarray-sum
0523-continuous-subarray-sum
 
 
0539-minimum-time-difference
0539-minimum-time-difference
 
 
0543-diameter-of-binary-tree
0543-diameter-of-binary-tree
 
 
0552-student-attendance-record-ii
0552-student-attendance-record-ii
 
 
0564-find-the-closest-palindrome
0564-find-the-closest-palindrome
 
 
0567-permutation-in-string
0567-permutation-in-string
 
 
0590-n-ary-tree-postorder-traversal
0590-n-ary-tree-postorder-traversal
 
 
0592-fraction-addition-and-subtraction
0592-fraction-addition-and-subtraction
 
 
0594-longest-harmonious-subsequence
0594-longest-harmonious-subsequence
 
 
0611-valid-triangle-number
0611-valid-triangle-number
 
 
0621-task-scheduler
0621-task-scheduler
 
 
0624-maximum-distance-in-arrays
0624-maximum-distance-in-arrays
 
 
0628-maximum-product-of-three-numbers
0628-maximum-product-of-three-numbers
 
 
0632-smallest-range-covering-elements-from-k-lists
0632-smallest-range-covering-elements-from-k-lists
 
 
0633-sum-of-square-numbers
0633-sum-of-square-numbers
 
 
0641-design-circular-deque
0641-design-circular-deque
 
 
0648-replace-words
0648-replace-words
 
 
0650-2-keys-keyboard
0650-2-keys-keyboard
 
 
0657-robot-return-to-origin
0657-robot-return-to-origin
 
 

Repository files navigation

LeetCode-TypeScript-JavaScript Solutions

This repository contains solutions for LeetCode problems implemented in TypeScript (JavaScript) and Python.

Overview

The purpose of this repository is to provide clear, efficient, and well-explained solutions for various LeetCode problems. Each solution is accompanied by detailed comments that explain the logic and approach used to solve the problem.

Languages

  • TypeScript
  • JavaScript
  • Python
  • Java

Usage

Each problem has its own directory, and within each problem's directory, you will find a solution file for both TypeScript and JavaScript. Feel free to explore and use these solutions to understand and solve LeetCode problems more effectively.

Contributing

Contributions are welcome! If you have a better solution or a solution to a problem that is not currently in the repository, feel free to make a pull request.

LeetCode Topics

Array

Problem Name Difficulty
0001-two-sum Easy
0033-search-in-rotated-sorted-array Medium
0048-rotate-image Medium
0153-find-minimum-in-rotated-sorted-array Medium
0154-find-minimum-in-rotated-sorted-array-ii Hard
0396-rotate-function Medium
0453-minimum-moves-to-equal-array-elements Medium
0462-minimum-moves-to-equal-array-elements-ii Medium
0486-predict-the-winner Medium
0628-maximum-product-of-three-numbers Easy
0835-image-overlap Medium
0874-walking-robot-simulation Medium
0877-stone-game Medium
1140-stone-game-ii Medium
1254-number-of-closed-islands Medium
1267-count-servers-that-communicate Medium
1288-remove-covered-intervals Medium
1301-number-of-paths-with-max-score Hard
1306-jump-game-iii Medium
1331-rank-transform-of-an-array Easy
1340-jump-game-v Hard
1345-jump-game-iv Hard
1346-check-if-n-and-its-double-exist Easy
1385-find-the-distance-value-between-two-arrays Easy
1386-cinema-seat-allocation Medium
1391-check-if-there-is-a-valid-path-in-a-grid Medium
1406-stone-game-iii Hard
1464-maximum-product-of-two-elements-in-an-array Easy
1477-find-two-non-overlapping-sub-arrays-each-with-target-sum Medium
1536-minimum-swaps-to-arrange-a-binary-grid Medium
1559-detect-cycles-in-2d-grid Medium
1563-stone-game-v Hard
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard
1582-special-positions-in-a-binary-matrix Easy
1594-maximum-non-negative-product-in-a-matrix Medium
1606-find-servers-that-handled-most-number-of-requests Hard
1658-minimum-operations-to-reduce-x-to-zero Medium
1665-minimum-initial-energy-to-finish-tasks Hard
1674-minimum-moves-to-make-array-complementary Medium
1722-minimize-hamming-distance-after-swap-operations Medium
1727-largest-submatrix-with-rearrangements Medium
1732-find-the-highest-altitude Easy
1752-check-if-array-is-sorted-and-rotated Easy
1807-evaluate-the-bracket-pairs-of-a-string Medium
1840-maximum-building-height Hard
1846-maximum-element-after-decreasing-and-rearranging Medium
1848-minimum-distance-to-the-target-element Easy
1855-maximum-distance-between-a-pair-of-values Medium
1861-rotating-the-box Medium
1872-stone-game-viii Hard
1878-get-biggest-three-rhombus-sums-in-a-grid Medium
1882-process-tasks-using-servers Medium
1886-determine-whether-matrix-can-be-obtained-by-rotation Easy
1914-cyclically-rotating-a-grid Medium
1967-number-of-strings-that-appear-as-substrings-in-word Easy
1979-find-greatest-common-divisor-of-array Easy
1980-find-unique-binary-string Medium
2029-stone-game-ix Medium
2033-minimum-operations-to-make-a-uni-value-grid Medium
2078-two-furthest-houses-with-different-colors Easy
2089-find-target-indices-after-sorting-array Easy
2091-removing-minimum-and-maximum-from-array Medium
2126-destroying-asteroids Medium
2144-minimum-cost-of-buying-candies-with-discount Easy
2161-partition-array-according-to-given-pivot Medium
2196-create-binary-tree-from-descriptions Medium
2213-longest-substring-of-one-repeating-character Hard
2267-check-if-there-is-a-valid-parentheses-string-path Hard
2452-words-within-two-edits-of-dictionary Medium
2463-minimum-total-distance-traveled Hard
2515-shortest-distance-to-target-string-in-a-circular-array Easy
2540-minimum-common-value Easy
2553-separate-the-digits-in-an-array Easy
2573-find-the-string-with-lcp Hard
2574-left-and-right-sum-differences Easy
2615-sum-of-distances Medium
2657-find-the-prefix-common-array-of-two-arrays Medium
2747-count-zero-request-servers Medium
2751-robot-collisions Hard
2770-maximum-number-of-jumps-to-reach-the-last-index Medium
2778-sum-of-squares-of-special-elements Easy
2784-check-if-array-is-good Easy
2812-find-the-safest-path-in-a-grid Medium
2897-apply-operations-on-array-to-maximize-sum-of-squares Hard
2906-construct-product-matrix Medium
2913-subarrays-distinct-element-sum-of-squares-i Easy
2916-subarrays-distinct-element-sum-of-squares-ii Hard
2946-matrix-similarity-after-cyclic-shifts Easy
2948-make-lexicographically-smallest-array-by-swapping-elements Medium
2956-find-common-elements-between-two-arrays Easy
2958-length-of-longest-subarray-with-at-most-k-frequency Medium
2996-smallest-missing-integer-greater-than-sequential-prefix-sum Easy
3020-find-the-maximum-number-of-elements-in-subset Medium
3043-find-the-length-of-the-longest-common-prefix Medium
3069-distribute-elements-into-two-arrays-i Easy
3070-count-submatrices-with-top-left-element-and-sum-less-than-k Medium
3093-longest-common-suffix-queries Hard
3116-kth-smallest-amount-with-single-denomination-combination Hard
3161-block-placement-queries Hard
3212-count-submatrices-with-equal-frequency-of-x-and-y Medium
3225-maximum-score-from-grid-operations Hard
3286-find-a-safe-walk-through-a-grid Medium
3296-minimum-number-of-seconds-to-make-mountain-height-zero Medium
3300-minimum-element-after-replacement-with-digit-sum Easy
3312-sorted-gcd-pair-queries Hard
3336-find-the-number-of-subsequences-with-equal-gcd Hard
3414-maximum-score-of-non-overlapping-intervals Hard
3418-maximum-amount-of-money-robot-can-earn Medium
3464-maximize-the-distance-between-points-on-a-square Hard
3471-find-the-largest-almost-missing-integer Easy
3483-unique-3-digit-even-numbers Easy
3488-closest-equal-element-queries Medium
3501-maximize-active-section-with-trade-ii Hard
3505-minimum-operations-to-make-elements-within-k-subarrays-equal Hard
3513-number-of-unique-xor-triplets-i Medium
3514-number-of-unique-xor-triplets-ii Medium
3524-find-x-value-of-array-i Medium
3525-find-x-value-of-array-ii Hard
3532-path-existence-queries-in-a-graph-i Medium
3534-path-existence-queries-in-a-graph-ii Hard
3546-equal-sum-grid-partition-i Medium
3548-equal-sum-grid-partition-ii Hard
3550-smallest-index-with-digit-sum-equal-to-index Easy
3551-minimum-swaps-to-sort-by-digit-sum Medium
3559-number-of-ways-to-assign-edge-weights-ii Hard
3567-minimum-absolute-difference-in-sliding-submatrix Medium
3568-minimum-moves-to-clean-the-classroom Medium
3619-count-islands-with-total-value-divisible-by-k Medium
3620-network-recovery-pathways Hard
3629-minimum-jumps-to-reach-end-via-prime-teleportation Medium
3633-earliest-finish-time-for-land-and-water-rides-i Easy
3635-earliest-finish-time-for-land-and-water-rides-ii Medium
3643-flip-square-submatrix-vertically Easy
3644-maximum-k-to-sort-a-permutation Medium
3653-xor-after-range-multiplication-queries-i Medium
3655-xor-after-range-multiplication-queries-ii Hard
3660-jump-game-ix Medium
3661-maximum-walls-destroyed-by-robots Hard
3665-twisted-mirror-path-count Medium
3689-maximum-total-subarray-value-i Medium
3691-maximum-total-subarray-value-ii Hard
3693-climbing-stairs-ii Medium
3702-longest-subsequence-with-non-zero-bitwise-xor Medium
3718-smallest-missing-multiple-of-k Easy
3727-maximum-alternating-sum-of-squares Medium
3731-find-missing-elements Easy
3736-minimum-moves-to-equal-array-elements-iii Easy
3737-count-subarrays-with-majority-element-i Medium
3739-count-subarrays-with-majority-element-ii Hard
3740-minimum-distance-between-three-equal-elements-i Easy
3741-minimum-distance-between-three-equal-elements-ii Medium
3742-maximum-path-score-in-a-grid Medium
3761-minimum-absolute-distance-between-mirror-pairs Medium
3838-weighted-word-mapping Easy
3841-palindromic-path-queries-in-a-tree Hard
3867-sum-of-gcd-of-formed-pairs Medium
3875-construct-uniform-parity-array-i Easy
3876-construct-uniform-parity-array-ii Medium
3882-minimum-xor-path-in-a-grid Medium
3886-sum-of-sortable-integers Hard
3903-smallest-stable-index-i Easy
3904-smallest-stable-index-ii Medium
3942-minimum-operations-to-sort-a-permutation Medium

Greedy

Problem Name Difficulty
0678-valid-parenthesis-string Medium
0921-minimum-add-to-make-parentheses-valid Medium
1081-smallest-subsequence-of-distinct-characters Medium
1386-cinema-seat-allocation Medium
1520-maximum-number-of-non-overlapping-substrings Hard
1536-minimum-swaps-to-arrange-a-binary-grid Medium
1541-minimum-insertions-to-balance-a-parentheses-string Medium
1665-minimum-initial-energy-to-finish-tasks Hard
1727-largest-submatrix-with-rearrangements Medium
1846-maximum-element-after-decreasing-and-rearranging Medium
1927-sum-game Medium
2029-stone-game-ix Medium
2078-two-furthest-houses-with-different-colors Easy
2091-removing-minimum-and-maximum-from-array Medium
2126-destroying-asteroids Medium
2144-minimum-cost-of-buying-candies-with-discount Easy
2472-maximum-number-of-non-overlapping-palindrome-substrings Hard
2573-find-the-string-with-lcp Hard
2897-apply-operations-on-array-to-maximize-sum-of-squares Hard
3014-minimum-number-of-pushes-to-type-word-i Easy
3016-minimum-number-of-pushes-to-type-word-ii Medium
3296-minimum-number-of-seconds-to-make-mountain-height-zero Medium
3302-find-the-lexicographically-smallest-valid-sequence Medium
3348-smallest-divisible-digit-product-ii Hard
3474-lexicographically-smallest-generated-string Hard
3534-path-existence-queries-in-a-graph-ii Hard
3600-maximize-spanning-tree-stability-with-upgrades Hard
3633-earliest-finish-time-for-land-and-water-rides-i Easy
3635-earliest-finish-time-for-land-and-water-rides-ii Medium
3689-maximum-total-subarray-value-i Medium
3691-maximum-total-subarray-value-ii Hard
3720-lexicographically-smallest-permutation-greater-than-target Medium
3723-maximize-sum-of-squares-of-digits Medium
3727-maximum-alternating-sum-of-squares Medium
3789-minimum-cost-to-acquire-required-items Medium

Matrix

Problem Name Difficulty
0048-rotate-image Medium
0835-image-overlap Medium
1254-number-of-closed-islands Medium
1267-count-servers-that-communicate Medium
1301-number-of-paths-with-max-score Hard
1391-check-if-there-is-a-valid-path-in-a-grid Medium
1536-minimum-swaps-to-arrange-a-binary-grid Medium
1559-detect-cycles-in-2d-grid Medium
1582-special-positions-in-a-binary-matrix Easy
1594-maximum-non-negative-product-in-a-matrix Medium
1727-largest-submatrix-with-rearrangements Medium
1861-rotating-the-box Medium
1878-get-biggest-three-rhombus-sums-in-a-grid Medium
1886-determine-whether-matrix-can-be-obtained-by-rotation Easy
1914-cyclically-rotating-a-grid Medium
2033-minimum-operations-to-make-a-uni-value-grid Medium
2267-check-if-there-is-a-valid-parentheses-string-path Hard
2573-find-the-string-with-lcp Hard
2812-find-the-safest-path-in-a-grid Medium
2906-construct-product-matrix Medium
2946-matrix-similarity-after-cyclic-shifts Easy
3070-count-submatrices-with-top-left-element-and-sum-less-than-k Medium
3212-count-submatrices-with-equal-frequency-of-x-and-y Medium
3225-maximum-score-from-grid-operations Hard
3286-find-a-safe-walk-through-a-grid Medium
3418-maximum-amount-of-money-robot-can-earn Medium
3546-equal-sum-grid-partition-i Medium
3548-equal-sum-grid-partition-ii Hard
3567-minimum-absolute-difference-in-sliding-submatrix Medium
3568-minimum-moves-to-clean-the-classroom Medium
3619-count-islands-with-total-value-divisible-by-k Medium
3643-flip-square-submatrix-vertically Easy
3665-twisted-mirror-path-count Medium
3742-maximum-path-score-in-a-grid Medium
3882-minimum-xor-path-in-a-grid Medium

String

Problem Name Difficulty
0020-valid-parentheses Easy
0022-generate-parentheses Medium
0032-longest-valid-parentheses Hard
0115-distinct-subsequences Hard
0301-remove-invalid-parentheses Hard
0657-robot-return-to-origin Easy
0678-valid-parenthesis-string Medium
0856-score-of-parentheses Medium
0921-minimum-add-to-make-parentheses-valid Medium
0940-distinct-subsequences-ii Hard
1021-remove-outermost-parentheses Easy
1081-smallest-subsequence-of-distinct-characters Medium
1096-brace-expansion-ii Hard
1111-maximum-nesting-depth-of-two-valid-parentheses-strings Medium
1189-maximum-number-of-balloons Easy
1190-reverse-substrings-between-each-pair-of-parentheses Medium
1320-minimum-distance-to-type-a-word-using-two-fingers Hard
1358-number-of-substrings-containing-all-three-characters Medium
1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n Medium
1520-maximum-number-of-non-overlapping-substrings Hard
1541-minimum-insertions-to-balance-a-parentheses-string Medium
1545-find-kth-bit-in-nth-binary-string Medium
1614-maximum-nesting-depth-of-the-parentheses Easy
1758-minimum-changes-to-make-alternating-binary-string Easy
1784-check-if-binary-string-has-at-most-one-segment-of-ones Easy
1807-evaluate-the-bracket-pairs-of-a-string Medium
1871-jump-game-vii Medium
1888-minimum-number-of-flips-to-make-the-binary-string-alternating Medium
1927-sum-game Medium
1967-number-of-strings-that-appear-as-substrings-in-word Easy
1980-find-unique-binary-string Medium
2075-decode-the-slanted-ciphertext Medium
2213-longest-substring-of-one-repeating-character Hard
2452-words-within-two-edits-of-dictionary Medium
2472-maximum-number-of-non-overlapping-palindrome-substrings Hard
2515-shortest-distance-to-target-string-in-a-circular-array Easy
2573-find-the-string-with-lcp Hard
2833-furthest-point-from-origin Easy
2839-check-if-strings-can-be-made-equal-with-operations-i Easy
2840-check-if-strings-can-be-made-equal-with-operations-ii Medium
2904-shortest-and-lexicographically-smallest-beautiful-string Medium
3014-minimum-number-of-pushes-to-type-word-i Easy
3016-minimum-number-of-pushes-to-type-word-ii Medium
3043-find-the-length-of-the-longest-common-prefix Medium
3090-maximum-length-substring-with-two-occurrences Easy
3093-longest-common-suffix-queries Hard
3120-count-the-number-of-special-characters-i Easy
3121-count-the-number-of-special-characters-ii Medium
3302-find-the-lexicographically-smallest-valid-sequence Medium
3348-smallest-divisible-digit-product-ii Hard
3474-lexicographically-smallest-generated-string Hard
3498-reverse-degree-of-a-string Easy
3499-maximize-active-section-with-trade-i Medium
3501-maximize-active-section-with-trade-ii Hard
3517-smallest-palindromic-rearrangement-i Medium
3518-smallest-palindromic-rearrangement-ii Hard
3612-process-string-with-special-operations-i Medium
3614-process-string-with-special-operations-ii Hard
3720-lexicographically-smallest-permutation-greater-than-target Medium
3734-lexicographically-smallest-palindromic-permutation-greater-than-target Hard
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii Medium
3838-weighted-word-mapping Easy
3841-palindromic-path-queries-in-a-tree Hard
3863-minimum-operations-to-sort-a-string Medium
3970-shortest-path-with-at-most-k-consecutive-identical-characters Medium

Recursion

Problem Name Difficulty
0486-predict-the-winner Medium
1545-find-kth-bit-in-nth-binary-string Medium
3483-unique-3-digit-even-numbers Easy

Simulation

Problem Name Difficulty
0657-robot-return-to-origin Easy
0874-walking-robot-simulation Medium
1545-find-kth-bit-in-nth-binary-string Medium
1606-find-servers-that-handled-most-number-of-requests Hard
1914-cyclically-rotating-a-grid Medium
2069-walking-robot-simulation-ii Medium
2075-decode-the-slanted-ciphertext Medium
2161-partition-array-according-to-given-pivot Medium
2553-separate-the-digits-in-an-array Easy
2751-robot-collisions Hard
2946-matrix-similarity-after-cyclic-shifts Easy
3069-distribute-elements-into-two-arrays-i Easy
3498-reverse-degree-of-a-string Easy
3612-process-string-with-special-operations-i Medium
3614-process-string-with-special-operations-ii Hard
3653-xor-after-range-multiplication-queries-i Medium
3838-weighted-word-mapping Easy
3867-sum-of-gcd-of-formed-pairs Medium

Dynamic Programming

Problem Name Difficulty
0022-generate-parentheses Medium
0032-longest-valid-parentheses Hard
0115-distinct-subsequences Hard
0396-rotate-function Medium
0486-predict-the-winner Medium
0678-valid-parenthesis-string Medium
0788-rotated-digits Medium
0877-stone-game Medium
0940-distinct-subsequences-ii Hard
1140-stone-game-ii Medium
1301-number-of-paths-with-max-score Hard
1320-minimum-distance-to-type-a-word-using-two-fingers Hard
1340-jump-game-v Hard
1406-stone-game-iii Hard
1477-find-two-non-overlapping-sub-arrays-each-with-target-sum Medium
1510-stone-game-iv Hard
1563-stone-game-v Hard
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard
1594-maximum-non-negative-product-in-a-matrix Medium
1621-number-of-sets-of-k-non-overlapping-line-segments Medium
1871-jump-game-vii Medium
1872-stone-game-viii Hard
1888-minimum-number-of-flips-to-make-the-binary-string-alternating Medium
2267-check-if-there-is-a-valid-parentheses-string-path Hard
2463-minimum-total-distance-traveled Hard
2472-maximum-number-of-non-overlapping-palindrome-substrings Hard
2573-find-the-string-with-lcp Hard
2770-maximum-number-of-jumps-to-reach-the-last-index Medium
3129-find-all-possible-stable-binary-arrays-i Medium
3130-find-all-possible-stable-binary-arrays-ii Hard
3225-maximum-score-from-grid-operations Hard
3302-find-the-lexicographically-smallest-valid-sequence Medium
3336-find-the-number-of-subsequences-with-equal-gcd Hard
3414-maximum-score-of-non-overlapping-intervals Hard
3418-maximum-amount-of-money-robot-can-earn Medium
3505-minimum-operations-to-make-elements-within-k-subarrays-equal Hard
3524-find-x-value-of-array-i Medium
3534-path-existence-queries-in-a-graph-ii Hard
3559-number-of-ways-to-assign-edge-weights-ii Hard
3620-network-recovery-pathways Hard
3660-jump-game-ix Medium
3661-maximum-walls-destroyed-by-robots Hard
3665-twisted-mirror-path-count Medium
3693-climbing-stairs-ii Medium
3699-number-of-zigzag-arrays-i Hard
3700-number-of-zigzag-arrays-ii Hard
3742-maximum-path-score-in-a-grid Medium
3751-total-waviness-of-numbers-in-range-i Medium
3753-total-waviness-of-numbers-in-range-ii Hard
3882-minimum-xor-path-in-a-grid Medium

Sliding Window

Problem Name Difficulty
1358-number-of-substrings-containing-all-three-characters Medium
1477-find-two-non-overlapping-sub-arrays-each-with-target-sum Medium
1658-minimum-operations-to-reduce-x-to-zero Medium
1871-jump-game-vii Medium
1888-minimum-number-of-flips-to-make-the-binary-string-alternating Medium
2747-count-zero-request-servers Medium
2904-shortest-and-lexicographically-smallest-beautiful-string Medium
2958-length-of-longest-subarray-with-at-most-k-frequency Medium
3090-maximum-length-substring-with-two-occurrences Easy
3505-minimum-operations-to-make-elements-within-k-subarrays-equal Hard

Hash Table

Problem Name Difficulty
0001-two-sum Easy
0874-walking-robot-simulation Medium
1096-brace-expansion-ii Hard
1189-maximum-number-of-balloons Easy
1331-rank-transform-of-an-array Easy
1345-jump-game-iv Hard
1346-check-if-n-and-its-double-exist Easy
1358-number-of-substrings-containing-all-three-characters Medium
1386-cinema-seat-allocation Medium
1477-find-two-non-overlapping-sub-arrays-each-with-target-sum Medium
1520-maximum-number-of-non-overlapping-substrings Hard
1658-minimum-operations-to-reduce-x-to-zero Medium
1674-minimum-moves-to-make-array-complementary Medium
1807-evaluate-the-bracket-pairs-of-a-string Medium
1980-find-unique-binary-string Medium
2196-create-binary-tree-from-descriptions Medium
2540-minimum-common-value Easy
2615-sum-of-distances Medium
2657-find-the-prefix-common-array-of-two-arrays Medium
2747-count-zero-request-servers Medium
2784-check-if-array-is-good Easy
2840-check-if-strings-can-be-made-equal-with-operations-ii Medium
2897-apply-operations-on-array-to-maximize-sum-of-squares Hard
2913-subarrays-distinct-element-sum-of-squares-i Easy
2916-subarrays-distinct-element-sum-of-squares-ii Hard
2956-find-common-elements-between-two-arrays Easy
2958-length-of-longest-subarray-with-at-most-k-frequency Medium
2996-smallest-missing-integer-greater-than-sequential-prefix-sum Easy
3016-minimum-number-of-pushes-to-type-word-ii Medium
3020-find-the-maximum-number-of-elements-in-subset Medium
3043-find-the-length-of-the-longest-common-prefix Medium
3090-maximum-length-substring-with-two-occurrences Easy
3120-count-the-number-of-special-characters-i Easy
3121-count-the-number-of-special-characters-ii Medium
3312-sorted-gcd-pair-queries Hard
3471-find-the-largest-almost-missing-integer Easy
3483-unique-3-digit-even-numbers Easy
3488-closest-equal-element-queries Medium
3505-minimum-operations-to-make-elements-within-k-subarrays-equal Hard
3518-smallest-palindromic-rearrangement-ii Hard
3532-path-existence-queries-in-a-graph-i Medium
3548-equal-sum-grid-partition-ii Hard
3551-minimum-swaps-to-sort-by-digit-sum Medium
3568-minimum-moves-to-clean-the-classroom Medium
3629-minimum-jumps-to-reach-end-via-prime-teleportation Medium
3718-smallest-missing-multiple-of-k Easy
3720-lexicographically-smallest-permutation-greater-than-target Medium
3731-find-missing-elements Easy
3737-count-subarrays-with-majority-element-i Medium
3739-count-subarrays-with-majority-element-ii Hard
3740-minimum-distance-between-three-equal-elements-i Easy
3741-minimum-distance-between-three-equal-elements-ii Medium
3761-minimum-absolute-distance-between-mirror-pairs Medium

Backtracking

Problem Name Difficulty
0022-generate-parentheses Medium
0301-remove-invalid-parentheses Hard
1096-brace-expansion-ii Hard
1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n Medium
1980-find-unique-binary-string Medium
3348-smallest-divisible-digit-product-ii Hard

Prefix Sum

Problem Name Difficulty
1140-stone-game-ii Medium
1621-number-of-sets-of-k-non-overlapping-line-segments Medium
1658-minimum-operations-to-reduce-x-to-zero Medium
1674-minimum-moves-to-make-array-complementary Medium
1732-find-the-highest-altitude Easy
1871-jump-game-vii Medium
1872-stone-game-viii Hard
1878-get-biggest-three-rhombus-sums-in-a-grid Medium
2574-left-and-right-sum-differences Easy
2615-sum-of-distances Medium
2906-construct-product-matrix Medium
3070-count-submatrices-with-top-left-element-and-sum-less-than-k Medium
3129-find-all-possible-stable-binary-arrays-i Medium
3130-find-all-possible-stable-binary-arrays-ii Hard
3212-count-submatrices-with-equal-frequency-of-x-and-y Medium
3225-maximum-score-from-grid-operations Hard
3312-sorted-gcd-pair-queries Hard
3546-equal-sum-grid-partition-i Medium
3548-equal-sum-grid-partition-ii Hard
3699-number-of-zigzag-arrays-i Hard
3737-count-subarrays-with-majority-element-i Medium
3739-count-subarrays-with-majority-element-ii Hard
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii Medium
3903-smallest-stable-index-i Easy
3904-smallest-stable-index-ii Medium

Bit Manipulation

Problem Name Difficulty
1009-complement-of-base-10-integer Easy
1386-cinema-seat-allocation Medium
2657-find-the-prefix-common-array-of-two-arrays Medium
2897-apply-operations-on-array-to-maximize-sum-of-squares Hard
3116-kth-smallest-amount-with-single-denomination-combination Hard
3513-number-of-unique-xor-triplets-i Medium
3514-number-of-unique-xor-triplets-ii Medium
3534-path-existence-queries-in-a-graph-ii Hard
3559-number-of-ways-to-assign-edge-weights-ii Hard
3568-minimum-moves-to-clean-the-classroom Medium
3644-maximum-k-to-sort-a-permutation Medium
3702-longest-subsequence-with-non-zero-bitwise-xor Medium
3841-palindromic-path-queries-in-a-tree Hard
3882-minimum-xor-path-in-a-grid Medium

Binary Search

Problem Name Difficulty
0033-search-in-rotated-sorted-array Medium
0153-find-minimum-in-rotated-sorted-array Medium
0154-find-minimum-in-rotated-sorted-array-ii Hard
1346-check-if-n-and-its-double-exist Easy
1385-find-the-distance-value-between-two-arrays Easy
1477-find-two-non-overlapping-sub-arrays-each-with-target-sum Medium
1658-minimum-operations-to-reduce-x-to-zero Medium
1855-maximum-distance-between-a-pair-of-values Medium
2089-find-target-indices-after-sorting-array Easy
2540-minimum-common-value Easy
2812-find-the-safest-path-in-a-grid Medium
3116-kth-smallest-amount-with-single-denomination-combination Hard
3161-block-placement-queries Hard
3296-minimum-number-of-seconds-to-make-mountain-height-zero Medium
3312-sorted-gcd-pair-queries Hard
3414-maximum-score-of-non-overlapping-intervals Hard
3464-maximize-the-distance-between-points-on-a-square Hard
3488-closest-equal-element-queries Medium
3501-maximize-active-section-with-trade-ii Hard
3532-path-existence-queries-in-a-graph-i Medium
3534-path-existence-queries-in-a-graph-ii Hard
3600-maximize-spanning-tree-stability-with-upgrades Hard
3620-network-recovery-pathways Hard
3633-earliest-finish-time-for-land-and-water-rides-i Easy
3635-earliest-finish-time-for-land-and-water-rides-ii Medium
3661-maximum-walls-destroyed-by-robots Hard

Union-Find

Problem Name Difficulty
1254-number-of-closed-islands Medium
1267-count-servers-that-communicate Medium
1391-check-if-there-is-a-valid-path-in-a-grid Medium
1559-detect-cycles-in-2d-grid Medium
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard
1722-minimize-hamming-distance-after-swap-operations Medium
2492-minimum-score-of-a-path-between-two-cities Medium
2573-find-the-string-with-lcp Hard
2685-count-the-number-of-complete-components Medium
2812-find-the-safest-path-in-a-grid Medium
2948-make-lexicographically-smallest-array-by-swapping-elements Medium
3532-path-existence-queries-in-a-graph-i Medium
3600-maximize-spanning-tree-stability-with-upgrades Hard
3619-count-islands-with-total-value-divisible-by-k Medium

Graph Theory

Problem Name Difficulty
2492-minimum-score-of-a-path-between-two-cities Medium
2685-count-the-number-of-complete-components Medium
3286-find-a-safe-walk-through-a-grid Medium
3310-remove-methods-from-project Medium
3532-path-existence-queries-in-a-graph-i Medium
3534-path-existence-queries-in-a-graph-ii Hard
3600-maximize-spanning-tree-stability-with-upgrades Hard
3620-network-recovery-pathways Hard
3970-shortest-path-with-at-most-k-consecutive-identical-characters Medium

Minimum Spanning Tree

Problem Name Difficulty
3600-maximize-spanning-tree-stability-with-upgrades Hard

Math

Problem Name Difficulty
0048-rotate-image Medium
0396-rotate-function Medium
0453-minimum-moves-to-equal-array-elements Medium
0462-minimum-moves-to-equal-array-elements-ii Medium
0486-predict-the-winner Medium
0628-maximum-product-of-three-numbers Easy
0788-rotated-digits Medium
0836-rectangle-overlap Easy
0877-stone-game Medium
1140-stone-game-ii Medium
1344-angle-between-hands-of-a-clock Medium
1401-circle-and-rectangle-overlapping Medium
1406-stone-game-iii Hard
1510-stone-game-iv Hard
1563-stone-game-v Hard
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard
1621-number-of-sets-of-k-non-overlapping-line-segments Medium
1622-fancy-sequence Hard
1840-maximum-building-height Hard
1872-stone-game-viii Hard
1878-get-biggest-three-rhombus-sums-in-a-grid Medium
1927-sum-game Medium
1979-find-greatest-common-divisor-of-array Easy
2029-stone-game-ix Medium
2033-minimum-operations-to-make-a-uni-value-grid Medium
2946-matrix-similarity-after-cyclic-shifts Easy
3014-minimum-number-of-pushes-to-type-word-i Easy
3116-kth-smallest-amount-with-single-denomination-combination Hard
3296-minimum-number-of-seconds-to-make-mountain-height-zero Medium
3300-minimum-element-after-replacement-with-digit-sum Easy
3312-sorted-gcd-pair-queries Hard
3336-find-the-number-of-subsequences-with-equal-gcd Hard
3345-smallest-divisible-digit-product-i Easy
3348-smallest-divisible-digit-product-ii Hard
3464-maximize-the-distance-between-points-on-a-square Hard
3505-minimum-operations-to-make-elements-within-k-subarrays-equal Hard
3513-number-of-unique-xor-triplets-i Medium
3514-number-of-unique-xor-triplets-ii Medium
3518-smallest-palindromic-rearrangement-ii Hard
3524-find-x-value-of-array-i Medium
3525-find-x-value-of-array-ii Hard
3536-maximum-product-of-two-digits Easy
3550-smallest-index-with-digit-sum-equal-to-index Easy
3558-number-of-ways-to-assign-edge-weights-i Medium
3559-number-of-ways-to-assign-edge-weights-ii Hard
3622-check-divisibility-by-digit-sum-and-product Easy
3629-minimum-jumps-to-reach-end-via-prime-teleportation Medium
3658-gcd-of-odd-and-even-sums Easy
3700-number-of-zigzag-arrays-ii Hard
3723-maximize-sum-of-squares-of-digits Medium
3736-minimum-moves-to-equal-array-elements-iii Easy
3751-total-waviness-of-numbers-in-range-i Medium
3753-total-waviness-of-numbers-in-range-ii Hard
3754-concatenate-non-zero-digits-and-multiply-by-sum-i Easy
3756-concatenate-non-zero-digits-and-multiply-by-sum-ii Medium
3761-minimum-absolute-distance-between-mirror-pairs Medium
3783-mirror-distance-of-an-integer Easy
3789-minimum-cost-to-acquire-required-items Medium
3867-sum-of-gcd-of-formed-pairs Medium
3870-count-commas-in-range Easy
3871-count-commas-in-range-ii Medium
3875-construct-uniform-parity-array-i Easy
3876-construct-uniform-parity-array-ii Medium
3886-sum-of-sortable-integers Hard

Heap (Priority Queue)

Problem Name Difficulty
1464-maximum-product-of-two-elements-in-an-array Easy
1606-find-servers-that-handled-most-number-of-requests Hard
1878-get-biggest-three-rhombus-sums-in-a-grid Medium
1882-process-tasks-using-servers Medium
2812-find-the-safest-path-in-a-grid Medium
3286-find-a-safe-walk-through-a-grid Medium
3296-minimum-number-of-seconds-to-make-mountain-height-zero Medium
3505-minimum-operations-to-make-elements-within-k-subarrays-equal Hard
3620-network-recovery-pathways Hard
3691-maximum-total-subarray-value-ii Hard
3970-shortest-path-with-at-most-k-consecutive-identical-characters Medium

Design

Problem Name Difficulty
1622-fancy-sequence Hard
2069-walking-robot-simulation-ii Medium

Segment Tree

Problem Name Difficulty
1622-fancy-sequence Hard
2213-longest-substring-of-one-repeating-character Hard
2913-subarrays-distinct-element-sum-of-squares-i Easy
2916-subarrays-distinct-element-sum-of-squares-ii Hard
3161-block-placement-queries Hard
3501-maximize-active-section-with-trade-ii Hard
3525-find-x-value-of-array-ii Hard
3691-maximum-total-subarray-value-ii Hard
3737-count-subarrays-with-majority-element-i Medium
3739-count-subarrays-with-majority-element-ii Hard
3841-palindromic-path-queries-in-a-tree Hard

Sorting

Problem Name Difficulty
0462-minimum-moves-to-equal-array-elements-ii Medium
0628-maximum-product-of-three-numbers Easy
1096-brace-expansion-ii Hard
1288-remove-covered-intervals Medium
1331-rank-transform-of-an-array Easy
1340-jump-game-v Hard
1346-check-if-n-and-its-double-exist Easy
1385-find-the-distance-value-between-two-arrays Easy
1464-maximum-product-of-two-elements-in-an-array Easy
1520-maximum-number-of-non-overlapping-substrings Hard
1665-minimum-initial-energy-to-finish-tasks Hard
1727-largest-submatrix-with-rearrangements Medium
1840-maximum-building-height Hard
1846-maximum-element-after-decreasing-and-rearranging Medium
1878-get-biggest-three-rhombus-sums-in-a-grid Medium
2033-minimum-operations-to-make-a-uni-value-grid Medium
2089-find-target-indices-after-sorting-array Easy
2126-destroying-asteroids Medium
2144-minimum-cost-of-buying-candies-with-discount Easy
2463-minimum-total-distance-traveled Hard
2747-count-zero-request-servers Medium
2751-robot-collisions Hard
2784-check-if-array-is-good Easy
2840-check-if-strings-can-be-made-equal-with-operations-ii Medium
2948-make-lexicographically-smallest-array-by-swapping-elements Medium
2996-smallest-missing-integer-greater-than-sequential-prefix-sum Easy
3016-minimum-number-of-pushes-to-type-word-ii Medium
3414-maximum-score-of-non-overlapping-intervals Hard
3464-maximize-the-distance-between-points-on-a-square Hard
3517-smallest-palindromic-rearrangement-i Medium
3534-path-existence-queries-in-a-graph-ii Hard
3536-maximum-product-of-two-digits Easy
3551-minimum-swaps-to-sort-by-digit-sum Medium
3567-minimum-absolute-difference-in-sliding-submatrix Medium
3633-earliest-finish-time-for-land-and-water-rides-i Easy
3635-earliest-finish-time-for-land-and-water-rides-ii Medium
3661-maximum-walls-destroyed-by-robots Hard
3727-maximum-alternating-sum-of-squares Medium
3731-find-missing-elements Easy
3867-sum-of-gcd-of-formed-pairs Medium
3886-sum-of-sortable-integers Hard

Two Pointers

Problem Name Difficulty
0061-rotate-list Medium
1346-check-if-n-and-its-double-exist Easy
1385-find-the-distance-value-between-two-arrays Easy
1855-maximum-distance-between-a-pair-of-values Medium
1861-rotating-the-box Medium
2095-delete-the-middle-node-of-a-linked-list Medium
2161-partition-array-according-to-given-pivot Medium
2472-maximum-number-of-non-overlapping-palindrome-substrings Hard
2540-minimum-common-value Easy
3302-find-the-lexicographically-smallest-valid-sequence Medium
3534-path-existence-queries-in-a-graph-ii Hard
3633-earliest-finish-time-for-land-and-water-rides-i Easy
3635-earliest-finish-time-for-land-and-water-rides-ii Medium
3643-flip-square-submatrix-vertically Easy
3734-lexicographically-smallest-palindromic-permutation-greater-than-target Hard
3867-sum-of-gcd-of-formed-pairs Medium

Enumeration

Problem Name Difficulty
1291-sequential-digits Medium
2778-sum-of-squares-of-special-elements Easy
3020-find-the-maximum-number-of-elements-in-subset Medium
3345-smallest-divisible-digit-product-i Easy
3483-unique-3-digit-even-numbers Easy
3499-maximize-active-section-with-trade-i Medium
3514-number-of-unique-xor-triplets-ii Medium
3546-equal-sum-grid-partition-i Medium
3548-equal-sum-grid-partition-ii Hard
3720-lexicographically-smallest-permutation-greater-than-target Medium
3734-lexicographically-smallest-palindromic-permutation-greater-than-target Hard
3751-total-waviness-of-numbers-in-range-i Medium
3886-sum-of-sortable-integers Hard

String Matching

Problem Name Difficulty
3474-lexicographically-smallest-generated-string Hard

Stack

Problem Name Difficulty
0020-valid-parentheses Easy
0032-longest-valid-parentheses Hard
0678-valid-parenthesis-string Medium
0856-score-of-parentheses Medium
0921-minimum-add-to-make-parentheses-valid Medium
1021-remove-outermost-parentheses Easy
1081-smallest-subsequence-of-distinct-characters Medium
1096-brace-expansion-ii Hard
1111-maximum-nesting-depth-of-two-valid-parentheses-strings Medium
1190-reverse-substrings-between-each-pair-of-parentheses Medium
1541-minimum-insertions-to-balance-a-parentheses-string Medium
1614-maximum-nesting-depth-of-the-parentheses Easy
2751-robot-collisions Hard

Divide and Conquer

Problem Name Difficulty
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard
3653-xor-after-range-multiplication-queries-i Medium
3655-xor-after-range-multiplication-queries-ii Hard
3737-count-subarrays-with-majority-element-i Medium
3739-count-subarrays-with-majority-element-ii Hard
3841-palindromic-path-queries-in-a-tree Hard

Depth-First Search

Problem Name Difficulty
1254-number-of-closed-islands Medium
1267-count-servers-that-communicate Medium
1306-jump-game-iii Medium
1391-check-if-there-is-a-valid-path-in-a-grid Medium
1559-detect-cycles-in-2d-grid Medium
1722-minimize-hamming-distance-after-swap-operations Medium
2265-count-nodes-equal-to-average-of-subtree Medium
2492-minimum-score-of-a-path-between-two-cities Medium
2685-count-the-number-of-complete-components Medium
3310-remove-methods-from-project Medium
3558-number-of-ways-to-assign-edge-weights-i Medium
3559-number-of-ways-to-assign-edge-weights-ii Hard
3619-count-islands-with-total-value-divisible-by-k Medium
3841-palindromic-path-queries-in-a-tree Hard

Trie

Problem Name Difficulty
2452-words-within-two-edits-of-dictionary Medium
3043-find-the-length-of-the-longest-common-prefix Medium
3093-longest-common-suffix-queries Hard

Counting

Problem Name Difficulty
1189-maximum-number-of-balloons Easy
1267-count-servers-that-communicate Medium
2029-stone-game-ix Medium
2833-furthest-point-from-origin Easy
3016-minimum-number-of-pushes-to-type-word-ii Medium
3312-sorted-gcd-pair-queries Hard
3518-smallest-palindromic-rearrangement-ii Hard
3720-lexicographically-smallest-permutation-greater-than-target Medium
3737-count-subarrays-with-majority-element-i Medium

Geometry

Problem Name Difficulty
0836-rectangle-overlap Easy
1401-circle-and-rectangle-overlapping Medium
3464-maximize-the-distance-between-points-on-a-square Hard

Breadth-First Search

Problem Name Difficulty
0301-remove-invalid-parentheses Hard
1096-brace-expansion-ii Hard
1254-number-of-closed-islands Medium
1267-count-servers-that-communicate Medium
1306-jump-game-iii Medium
1345-jump-game-iv Hard
1391-check-if-there-is-a-valid-path-in-a-grid Medium
1559-detect-cycles-in-2d-grid Medium
2492-minimum-score-of-a-path-between-two-cities Medium
2685-count-the-number-of-complete-components Medium
2812-find-the-safest-path-in-a-grid Medium
3286-find-a-safe-walk-through-a-grid Medium
3310-remove-methods-from-project Medium
3568-minimum-moves-to-clean-the-classroom Medium
3619-count-islands-with-total-value-divisible-by-k Medium
3629-minimum-jumps-to-reach-end-via-prime-teleportation Medium

Linked List

Problem Name Difficulty
0061-rotate-list Medium
2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points Medium
2095-delete-the-middle-node-of-a-linked-list Medium

Number Theory

Problem Name Difficulty
1979-find-greatest-common-divisor-of-array Easy
3116-kth-smallest-amount-with-single-denomination-combination Hard
3312-sorted-gcd-pair-queries Hard
3336-find-the-number-of-subsequences-with-equal-gcd Hard
3348-smallest-divisible-digit-product-ii Hard
3629-minimum-jumps-to-reach-end-via-prime-teleportation Medium
3658-gcd-of-odd-and-even-sums Easy
3867-sum-of-gcd-of-formed-pairs Medium

Binary Indexed Tree

Problem Name Difficulty
2913-subarrays-distinct-element-sum-of-squares-i Easy
2916-subarrays-distinct-element-sum-of-squares-ii Hard
3161-block-placement-queries Hard
3841-palindromic-path-queries-in-a-tree Hard

Tree

Problem Name Difficulty
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard
2196-create-binary-tree-from-descriptions Medium
2265-count-nodes-equal-to-average-of-subtree Medium
3558-number-of-ways-to-assign-edge-weights-i Medium
3559-number-of-ways-to-assign-edge-weights-ii Hard
3841-palindromic-path-queries-in-a-tree Hard

Binary Tree

Problem Name Difficulty
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard
2196-create-binary-tree-from-descriptions Medium
2265-count-nodes-equal-to-average-of-subtree Medium

Merge Sort

Problem Name Difficulty
3737-count-subarrays-with-majority-element-i Medium
3739-count-subarrays-with-majority-element-ii Hard

Shortest Path

Problem Name Difficulty
3286-find-a-safe-walk-through-a-grid Medium
3620-network-recovery-pathways Hard
3970-shortest-path-with-at-most-k-consecutive-identical-characters Medium

Topological Sort

Problem Name Difficulty
3620-network-recovery-pathways Hard

Combinatorics

Problem Name Difficulty
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard
1621-number-of-sets-of-k-non-overlapping-line-segments Medium
3116-kth-smallest-amount-with-single-denomination-combination Hard
3312-sorted-gcd-pair-queries Hard
3518-smallest-palindromic-rearrangement-ii Hard

Monotonic Stack

Problem Name Difficulty
1081-smallest-subsequence-of-distinct-characters Medium

Counting Sort

Problem Name Difficulty
3517-smallest-palindromic-rearrangement-i Medium

Game Theory

Problem Name Difficulty
0486-predict-the-winner Medium
0877-stone-game Medium
1140-stone-game-ii Medium
1406-stone-game-iii Hard
1510-stone-game-iv Hard
1563-stone-game-v Hard
1872-stone-game-viii Hard
1927-sum-game Medium
2029-stone-game-ix Medium

Minimax

Problem Name Difficulty
1140-stone-game-ii Medium
1510-stone-game-iv Hard
1872-stone-game-viii Hard
2029-stone-game-ix Medium

Zero-Sum Game

Problem Name Difficulty
1140-stone-game-ii Medium
1510-stone-game-iv Hard
1872-stone-game-viii Hard
2029-stone-game-ix Medium

Nim Game

Problem Name Difficulty
1510-stone-game-iv Hard
2029-stone-game-ix Medium

Sprague–Grundy Theorem

Problem Name Difficulty
1510-stone-game-iv Hard

Ordered Set

Problem Name Difficulty
1606-find-servers-that-handled-most-number-of-requests Hard
2213-longest-substring-of-one-repeating-character Hard

Bracket Sequences

Problem Name Difficulty
0020-valid-parentheses Easy
0022-generate-parentheses Medium
0032-longest-valid-parentheses Hard
0678-valid-parenthesis-string Medium
0856-score-of-parentheses Medium
0921-minimum-add-to-make-parentheses-valid Medium
1021-remove-outermost-parentheses Easy
1111-maximum-nesting-depth-of-two-valid-parentheses-strings Medium
1190-reverse-substrings-between-each-pair-of-parentheses Medium
1541-minimum-insertions-to-balance-a-parentheses-string Medium
1614-maximum-nesting-depth-of-the-parentheses Easy
2267-check-if-there-is-a-valid-parentheses-string-path Hard

Binary Search Tree

Problem Name Difficulty
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard

Memoization

Problem Name Difficulty
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard

Fermat's Little Theorem

Problem Name Difficulty
1569-number-of-ways-to-reorder-array-to-get-same-bst Hard

About

This repository serves as an excellent resource for anyone looking to improve their problem-solving skills, particularly in TypeScript, JavaScript, Python, PHP, and Java.

www.youtube.com/playlist?list=PLxNcomId_fMv00RZmyRR9iNJLOTsQ376_

Topics

javascriptjsleetcodeleetcode-solutionsleetcode-typescriptphppython3tstypescript

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.