Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

400 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

LeetCode_TypeScript(JavaScript)

Introduction

LeetCode_TypeScript is a project that refactors LeetCode solutions using TypeScript. The goal of this project is to provide clear and understandable solutions while converting JavaScript code to TypeScript to enhance code maintainability and readability.

File Structure

The main files and their functions are as follows:

├── 0001-two-sum.ts
├── 0003-longest-substring-without-repeating-characters.ts
├── 0005-longest-palindromic-substring.ts
├── 0008-string-to-integer.ts
├── 0009-palindrome-number.ts
├── 0011-container-with-most-water.ts
├── 0012-integer-to-roman.ts
├── 0013-roman-to-integer.ts
├── 0014-longest-common-prefix.ts
├── 0020-valid-parentheses.ts
├── 0026-remove-duplicates-from-sorted-array.ts
├── 0027-remove-element.ts
├── 0028-implement-strStr().js
├── 0035-search-insert-position.js
├── 0053-maximum-subarray.ts
├── 0055-jump-game.js
├── 0058-length-of-last-word.js
├── 0062-unique-paths.js
├── 0066-plus-one.js
├── 0067-add-binary.js
├── 0069-sqrt(x).js
├── 0070-climbing-stairs.ts
├── 0088-merge-sorted-array.js
├── 0094-binary-tree-inorder-traversal.js
├── 0100-same-tree.js
├── 0102-binary-tree-level-order-traversal.js
├── 0119-pascal's-triangle-ii.js
├── 0121-best-time-to-buy-and-sell-stock.ts
├── 0125-valid-palindrome.js
├── 0128-longest-consecutive-sequence.ts
├── 0136-single-number.js
├── 0144-binary-tree-preorder-traversal.js
├── 0169-majority-element.js
├── 0171-excel-sheet-column-number.js
├── 0191-number-of-1-bits.js
├── 0200-number-of-islands.js
├── 0202-happy-number.js
├── 0205-isomorphic-strings.js
├── 0217-contains-duplicate.js
├── 0219-contains-duplicate-ii.js
├── 0226-invert-binary-tree.js
├── 0231-power-of-two.js
├── 0242-valid-anagram.js
├── 0258-add-digits.js
├── 0263-ugly-number.js
├── 0268-missing-number.js
├── 0283-move-zeroes.js
├── 0299-bulls-and-cows.js
├── 0338-counting-bits.js
├── 0342-power-of-four.js
├── 0347-top-k-frequent-elements.js
├── 0383-ransom-note.js
├── 0392-is-subsequence.js
├── 0409-longest-palindrome.js
├── 0412-fizz-buzz.js
├── 0459-repeated-substring-pattern.js
├── 0509-fibonacci-number.js
├── 0561-array-partition.js
├── 0647-palindromic-substrings.ts
├── 0704-binary-search.js
├── 0724-find-pivot-index.js
├── 0746-min-cost-climbing-stairs.js
├── 0766-toeplitz-matrix.ts
├── 0954-array-of-doubled-pairs.ts
├── 0973-k-closest-points-to-origin.ts
├── 1002-find-common-characters.ts
├── 1004-max-consecutive-ones-iii.ts
├── 1042-flower-planting-with-no-adjacent.ts
├── 1390-four-divisors.ts
├── 1480-running-sum-of-1d-array.js
├── 1482-minimum-number-of-days-to-make-m-bouquets.ts
├── 1929-concatenation-of-array.js
├── 1952-three-divisor.ts
├── 2056-count-pairs-of-similar-strings.ts
├── 2507-smallest-value-after-replacing-with-sum-of-prime-factors.ts
├── 2508-add-edges-to-make-degrees-of-all-nodes-even.ts
├── 2509-cycle-length-queries-in-a-tree.ts
├── 2553-separate-the-digits-in-an-array.ts
├── 2554-maximum-number-of-integers-to-choose-from-a-range-i.ts
├── 2555-maximize-win-from-two-segments.ts
├── 2591-distribute-money-to-maximum-children.ts
├── 2592-maximize-greatness-of-an-array.ts
├── 2593-find-score-of-an-array-after-marking-all-elements.ts
├── 2594-minimum-time-to-repair-cars.ts
├── 2618-check-if-object-instance-of-class.js
├── 2619-array-prototype-last.js
├── 2620-counter.js
├── 2621-sleep.js
├── 2622-cache-with-time-limit.js
├── 2623-memoize.js
├── 2625-flatten-deeply-nested-array.js
├── 2626-array-reduce-transformation.js
├── 2627-debounce.js
├── 2628-json-deep-equal.js
├── 2629-function-composition.js
├── 2631-group-by.js
├── 2632-curry.js
├── 2633-convert-object-to-json-string.js
├── 2634-filter-elements-from-array.js
├── 2635-apply-transform-over-each-element-in-array.js
├── 2636-promise-pool.js
├── 2637-promise-time-limit.js
├── 2639-find-the-width-of-columns-of-a-grid.ts
├── 2640-find-the-score-of-all-prefixes-of-an-array.ts
├── 2641-cousins-in-binary-tree-ii.ts
├── 2642-design-graph-with-shortest-path-calculator.ts
├── 2648-generate-fibonacci-sequence.js
├── 2649-nested-array-generator.js
├── 2665-counter-ii.js
├── 2666-allow-one-function-call.js
├── 2667-create-hello-world-function.js
├── 2675-array-of-objects-to-matrix.js
├── 2676-throttle.js
├── 2677-chunk-array.js
├── 2682-find-the-losers-of-the-circular-game.ts
├── 2683-neighboring-bitwise-xor.ts
├── 2693-call-function-with-custom-context.js
├── 2694-event-emitter.js
├── 2695-array-wrapper.js
├── 2869-minimum-operations-to-collect-elements.ts
├── 2870-minimum-number-of-operations-to-make-array-empty.ts
├── 2871-split-array-into-maximum-number-of-subarrays.ts
├── 2872-maximum-number-of-k-divisible-components.ts
├── 3688-bitwise-or-of-even-numbers-in-an-array.ts
├── 3689-maximum-total-subarray-value-i.ts
├── 3690-split-and-merge-array-transformation.ts
├── 3697-compute-decimal-representation.ts
└── 3699-number-of-zigzag-array-i.ts

About

No description, website, or topics provided.

Resources

Stars

2 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages