LeetCodeForJs

Hi my name is daniel and am attempting to answer every question on leet code with javascript

You welcomed to join me on this journey

How do you contribute

To contribute there are a few steps

0.Topics are in the .0Topics Folders , there i explain most of this algorithm as detailed as i can

Install The leed hub extention https://chrome.google.com/webstore/detail/leethub/aciombdipochlnkbpcbgdpjffcfdbggi?hl=en
fork this repo
Connect it to leethub
Pick a question like for this example https://leetcode.com/problems/two-sum/
Create and file with the slug of the question two-sum.js
Solve You Question and commit you solution and an explanation
Please write comments on how you solved it
That is all you just contributed

How Do I Use this repo as a study material

Pick a question
Attempt The question
If you can’t solve it check this repo for a solution like it

Note i also created a spread sheet

Here is the link

https://docs.google.com/spreadsheets/d/1h8McCfCWqujYMNAfzvL6k8JWCeZF6QiPepUrubRqjb8/edit?usp=sharing

Thats All for now

Name		Name	Last commit message	Last commit date
Latest commit History 1,130 Commits
.0Topics		.0Topics
0001-two-sum		0001-two-sum
0009-palindrome-number		0009-palindrome-number
0020-valid-parentheses		0020-valid-parentheses
0049-group-anagrams		0049-group-anagrams
0125-valid-palindrome		0125-valid-palindrome
0190-reverse-bits		0190-reverse-bits
0191-number-of-1-bits		0191-number-of-1-bits
0208-implement-trie-prefix-tree		0208-implement-trie-prefix-tree
0217-contains-duplicate		0217-contains-duplicate
0238-product-of-array-except-self		0238-product-of-array-except-self
0242-valid-anagram		0242-valid-anagram
0338-counting-bits		0338-counting-bits
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0451-sort-characters-by-frequency		0451-sort-characters-by-frequency
1-two-sum		1-two-sum
1007-minimum-domino-rotations-for-equal-row		1007-minimum-domino-rotations-for-equal-row
102-binary-tree-level-order-traversal		102-binary-tree-level-order-traversal
1029-two-city-scheduling		1029-two-city-scheduling
104-maximum-depth-of-binary-tree		104-maximum-depth-of-binary-tree
1046-last-stone-weight		1046-last-stone-weight
1050-actors-and-directors-who-cooperated-at-least-three-times		1050-actors-and-directors-who-cooperated-at-least-three-times
108-convert-sorted-array-to-binary-search-tree		108-convert-sorted-array-to-binary-search-tree
1080-insufficient-nodes-in-root-to-leaf-paths		1080-insufficient-nodes-in-root-to-leaf-paths
1091-shortest-path-in-binary-matrix		1091-shortest-path-in-binary-matrix
110-balanced-binary-tree		110-balanced-binary-tree
1114-print-in-order		1114-print-in-order
1137-n-th-tribonacci-number		1137-n-th-tribonacci-number
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
117-populating-next-right-pointers-in-each-node-ii		117-populating-next-right-pointers-in-each-node-ii
118-pascals-triangle		118-pascals-triangle
1192-critical-connections-in-a-network		1192-critical-connections-in-a-network
12-integer-to-roman		12-integer-to-roman
120-triangle		120-triangle
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
1249-minimum-remove-to-make-valid-parentheses		1249-minimum-remove-to-make-valid-parentheses
125-valid-palindrome		125-valid-palindrome
1281-subtract-the-product-and-sum-of-digits-of-an-integer		1281-subtract-the-product-and-sum-of-digits-of-an-integer
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
1302-deepest-leaves-sum		1302-deepest-leaves-sum
1337-the-k-weakest-rows-in-a-matrix		1337-the-k-weakest-rows-in-a-matrix
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
136-single-number		136-single-number
1376-time-needed-to-inform-all-employees		1376-time-needed-to-inform-all-employees
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
138-copy-list-with-random-pointer		138-copy-list-with-random-pointer
1385-find-the-distance-value-between-two-arrays		1385-find-the-distance-value-between-two-arrays
1396-design-underground-system		1396-design-underground-system
1408-string-matching-in-an-array		1408-string-matching-in-an-array
141-linked-list-cycle		141-linked-list-cycle
142-linked-list-cycle-ii		142-linked-list-cycle-ii
1448-count-good-nodes-in-binary-tree		1448-count-good-nodes-in-binary-tree
1450-number-of-students-doing-homework-at-a-given-time		1450-number-of-students-doing-homework-at-a-given-time
146-lru-cache		146-lru-cache
1480-running-sum-of-1d-array		1480-running-sum-of-1d-array
1484-group-sold-products-by-the-date		1484-group-sold-products-by-the-date
1491-average-salary-excluding-the-minimum-and-maximum-salary		1491-average-salary-excluding-the-minimum-and-maximum-salary
15-3sum		15-3sum
150-evaluate-reverse-polish-notation		150-evaluate-reverse-polish-notation
1502-can-make-arithmetic-progression-from-sequence		1502-can-make-arithmetic-progression-from-sequence
1523-count-odd-numbers-in-an-interval-range		1523-count-odd-numbers-in-an-interval-range
1527-patients-with-a-condition		1527-patients-with-a-condition
155-min-stack		155-min-stack
1588-sum-of-all-odd-length-subarrays		1588-sum-of-all-odd-length-subarrays
1630-arithmetic-subarrays		1630-arithmetic-subarrays
1641-count-sorted-vowel-strings		1641-count-sorted-vowel-strings
1646-get-maximum-in-generated-array		1646-get-maximum-in-generated-array
1663-smallest-string-with-a-given-numeric-value		1663-smallest-string-with-a-given-numeric-value
1667-fix-names-in-a-table		1667-fix-names-in-a-table
167-two-sum-ii-input-array-is-sorted		167-two-sum-ii-input-array-is-sorted
1679-max-number-of-k-sum-pairs		1679-max-number-of-k-sum-pairs
169-majority-element		169-majority-element
1693-daily-leads-and-partners		1693-daily-leads-and-partners
1729-find-followers-count		1729-find-followers-count
173-binary-search-tree-iterator		173-binary-search-tree-iterator
175-combine-two-tables		175-combine-two-tables
1757-recyclable-and-low-fat-products		1757-recyclable-and-low-fat-products
176-second-highest-salary		176-second-highest-salary
1795-rearrange-products-table		1795-rearrange-products-table
1822-sign-of-the-product-of-an-array		1822-sign-of-the-product-of-an-array
183-customers-who-never-order		183-customers-who-never-order
1873-calculate-special-bonus		1873-calculate-special-bonus
19-remove-nth-node-from-end-of-list		19-remove-nth-node-from-end-of-list
190-reverse-bits		190-reverse-bits
191-number-of-1-bits		191-number-of-1-bits
196-delete-duplicate-emails		196-delete-duplicate-emails
1965-employees-with-missing-information		1965-employees-with-missing-information
197-rising-temperature		197-rising-temperature
198-house-robber		198-house-robber
199-binary-tree-right-side-view		199-binary-tree-right-side-view
2-add-two-numbers		2-add-two-numbers
20-valid-parentheses		20-valid-parentheses
200-number-of-islands		200-number-of-islands
2022-convert-1d-array-into-2d-array		2022-convert-1d-array-into-2d-array
204-count-primes		204-count-primes
205-isomorphic-strings		205-isomorphic-strings
207-course-schedule		207-course-schedule
208-implement-trie-prefix-tree		208-implement-trie-prefix-tree

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCodeForJs

How do you contribute

How Do I Use this repo as a study material

Note i also created a spread sheet

About

Releases

Packages

Languages

Ifechukwudaniel/DSAandAlgortims

Folders and files

Latest commit

History

Repository files navigation

LeetCodeForJs

How do you contribute

How Do I Use this repo as a study material

Note i also created a spread sheet

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages