LeetCode-JavaScript-Solutions

Overview

Hello 👋, Welcome to my repository of LeetCode Solutions using JavaScript. I often solve LeetCode problems, which helps me to write more optimised and efficient code. It mainly focuses on our intuition to approach towards any problem.

How to solve these problems

If you wish to solve these problems on LeetCode, find the problem number through the readme of the problem folder and try it in LeetCode.
Else clone the project using the command git clone https://github.com/vtejaeta/LeetCode-JavaScript-Solutions.git
Move into the file directory you wish to run using cd {folder_name}. Read the problem statement through the readme file and try to solve it.
If you wish to see my solution, open the file {folder_name}.js within problem folder.

Questions

For questions related to using the project, please reachout to me through

Twitter

Happy Problem Solving!

Name		Name	Last commit message	Last commit date
Latest commit History 230 Commits
100-same-tree		100-same-tree
105-construct-binary-tree-from-preorder-and-inorder-traversal		105-construct-binary-tree-from-preorder-and-inorder-traversal
106-construct-binary-tree-from-inorder-and-postorder-traversal		106-construct-binary-tree-from-inorder-and-postorder-traversal
109-convert-sorted-list-to-binary-search-tree		109-convert-sorted-list-to-binary-search-tree
110-balanced-binary-tree		110-balanced-binary-tree
111-minimum-depth-of-binary-tree		111-minimum-depth-of-binary-tree
112-path-sum		112-path-sum
114-flatten-binary-tree-to-linked-list		114-flatten-binary-tree-to-linked-list
116-populating-next-right-pointers-in-each-node		116-populating-next-right-pointers-in-each-node
129-sum-root-to-leaf-numbers		129-sum-root-to-leaf-numbers
145-binary-tree-postorder-traversal		145-binary-tree-postorder-traversal
226-invert-binary-tree		226-invert-binary-tree
236-lowest-common-ancestor-of-a-binary-tree		236-lowest-common-ancestor-of-a-binary-tree
257-binary-tree-paths		257-binary-tree-paths
290-word-pattern		290-word-pattern
404-sum-of-left-leaves		404-sum-of-left-leaves
450-delete-node-in-a-bst		450-delete-node-in-a-bst
509-fibonacci-number		509-fibonacci-number
70-climbing-stairs		70-climbing-stairs
700-search-in-a-binary-search-tree		700-search-in-a-binary-search-tree
701-insert-into-a-binary-search-tree		701-insert-into-a-binary-search-tree
746-min-cost-climbing-stairs		746-min-cost-climbing-stairs
98-validate-binary-search-tree		98-validate-binary-search-tree
99-recover-binary-search-tree		99-recover-binary-search-tree
add-two-numbers		add-two-numbers
arranging-coins		arranging-coins
balanced-binary-tree		balanced-binary-tree
binary-search		binary-search
binary-tree-inorder-traversal		binary-tree-inorder-traversal
binary-tree-level-order-traversal-ii		binary-tree-level-order-traversal-ii
binary-tree-level-order-traversal		binary-tree-level-order-traversal
binary-tree-maximum-path-sum		binary-tree-maximum-path-sum
binary-tree-preorder-traversal		binary-tree-preorder-traversal
binary-tree-zigzag-level-order-traversal		binary-tree-zigzag-level-order-traversal
build-array-from-permutation		build-array-from-permutation
check-if-n-and-its-double-exist		check-if-n-and-its-double-exist
check-if-the-sentence-is-pangram		check-if-the-sentence-is-pangram
check-if-two-string-arrays-are-equivalent		check-if-two-string-arrays-are-equivalent
count-items-matching-a-rule		count-items-matching-a-rule
count-the-number-of-consistent-strings		count-the-number-of-consistent-strings
defanging-an-ip-address		defanging-an-ip-address
delete-node-in-a-linked-list		delete-node-in-a-linked-list
diameter-of-binary-tree		diameter-of-binary-tree
final-value-of-variable-after-performing-operations		final-value-of-variable-after-performing-operations
find-smallest-letter-greater-than-target		find-smallest-letter-greater-than-target
find-the-town-judge		find-the-town-judge
first-bad-version		first-bad-version
generate-parentheses		generate-parentheses
goal-parser-interpretation		goal-parser-interpretation
guess-number-higher-or-lower		guess-number-higher-or-lower
implement-strstr		implement-strstr
intersection-of-two-arrays-ii		intersection-of-two-arrays-ii
intersection-of-two-arrays		intersection-of-two-arrays
jewels-and-stones		jewels-and-stones
kth-missing-positive-number		kth-missing-positive-number
letter-combinations-of-a-phone-number		letter-combinations-of-a-phone-number
linked-list-cycle		linked-list-cycle
maximum-depth-of-binary-tree		maximum-depth-of-binary-tree
merge-two-sorted-lists		merge-two-sorted-lists
middle-of-the-linked-list		middle-of-the-linked-list
move-zeroes		move-zeroes
n-queens		n-queens
palindrome-linked-list		palindrome-linked-list
palindrome-number		palindrome-number
peak-index-in-a-mountain-array		peak-index-in-a-mountain-array
permutations		permutations
remove-linked-list-elements		remove-linked-list-elements
remove-nth-node-from-end-of-list		remove-nth-node-from-end-of-list
reorder-list		reorder-list
reverse-linked-list		reverse-linked-list
reverse-string		reverse-string
roman-to-integer		roman-to-integer
same-tree		same-tree
search-insert-position		search-insert-position
shuffle-string		shuffle-string
single-number		single-number
sorting-the-sentence		sorting-the-sentence
symmetric-tree		symmetric-tree
to-lower-case		to-lower-case
truncate-sentence		truncate-sentence
two-sum-ii-input-array-is-sorted		two-sum-ii-input-array-is-sorted
two-sum		two-sum
valid-perfect-square		valid-perfect-square
README.md		README.md

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

LeetCode-JavaScript-Solutions

Overview

How to solve these problems

Questions

About

Uh oh!

Releases

Packages

Languages

vtejaeta/LeetCode-JavaScript-Solutions

Folders and files

Latest commit

History

Repository files navigation

LeetCode-JavaScript-Solutions

Overview

How to solve these problems

Questions

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages