Skip to content
/ JavaScript-Problem-Solving Public

✈ JavaScript solutions for 🚜 coding challenges,🐟 algorithms, and interview problems 🛩 Well-optimized solutions 🚍 with explanations 🚕 Covers LeetCode, CodeWars, 🚁HackerRank, and more 🚢 Includes problem-solving patterns & techniques 🐬Great for interview prep & JS mastery Open for contributions 🚁 discussions! Let’s learn ⚽and grow together

github.com/Hazrat-Ali9/JavaScript-Problem-Solving

License

MIT, Unknown licenses found

Licenses found

MIT
LICENCE
Unknown
license-key-formatting.js
33 stars 1 fork Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

Hazrat-Ali9/JavaScript-Problem-Solving

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

284 Commits
3Sum.js
3Sum.js
 
 
Binary-tree.js
Binary-tree.js
 
 
Final Value of Variable After Performing Operations.js
Final Value of Variable After Performing Operations.js
 
 
LICENCE
LICENCE
 
 
README.md
README.md
 
 
Subarray-Sum-Equals-K.js
Subarray-Sum-Equals-K.js
 
 
Univalued-Binary-Tree.js
Univalued-Binary-Tree.js
 
 
add-binary.js
add-binary.js
 
 
add-strings.js
add-strings.js
 
 
add-two-numbers-ii.js
add-two-numbers-ii.js
 
 
add-two-numbers.js
add-two-numbers.js
 
 
array-utilities.js
array-utilities.js
 
 
backspace-string-compare.js
backspace-string-compare.js
 
 
balanced-binary-tree.js
balanced-binary-tree.js
 
 
beautiful-arrangement.js
beautiful-arrangement.js
 
 
best-time-to-buy-and-sell-stock-with-cooldown.js
best-time-to-buy-and-sell-stock-with-cooldown.js
 
 
best-time-to-buy-and-sell-stock-with-transaction-fee.js
best-time-to-buy-and-sell-stock-with-transaction-fee.js
 
 
best-time-to-buy-and-sell-stock.js
best-time-to-buy-and-sell-stock.js
 
 
binary-search-tree-iterator.js
binary-search-tree-iterator.js
 
 
binary-tree-inorder-traversal.js
binary-tree-inorder-traversal.js
 
 
binary-tree-level-order-traversal.js
binary-tree-level-order-traversal.js
 
 
binary-tree-maximum-path-sum.js
binary-tree-maximum-path-sum.js
 
 
binary-tree-paths.js
binary-tree-paths.js
 
 
binary-tree-postorder-traversal.js
binary-tree-postorder-traversal.js
 
 
binary-tree-right-side view.cpp
binary-tree-right-side view.cpp
 
 
binary-tree-zigzag-level-order-traversal.js
binary-tree-zigzag-level-order-traversal.js
 
 
binary-watch.js
binary-watch.js
 
 
brick-wall.js
brick-wall.js
 
 
buddy-strings.js
buddy-strings.js
 
 
bulls-and-cows.js
bulls-and-cows.js
 
 
burst-balloons.js
burst-balloons.js
 
 
can-place-flowers.js
can-place-flowers.js
 
 
candy-crush.js
candy-crush.js
 
 
candy.js
candy.js
 
 
chunk_array.js
chunk_array.js
 
 
combination-sum-iv.js
combination-sum-iv.js
 
 
combination-sum.js
combination-sum.js
 
 
combinations.js
combinations.js
 
 
compare-version-numbers.js
compare-version-numbers.js
 
 
construct-binary-tree-from-preorder-and-inorder-traversal.js
construct-binary-tree-from-preorder-and-inorder-traversal.js
 
 
container-with-most-water.js
container-with-most-water.js
 
 
contains-duplicate-ii.js
contains-duplicate-ii.js
 
 
contiguous-array.js
contiguous-array.js
 
 
continuous-subarray-sum.js
continuous-subarray-sum.js
 
 
convert-bst-to-greater-tree.js
convert-bst-to-greater-tree.js
 
 
convert-sorted-array-to-binary-search-tree.js
convert-sorted-array-to-binary-search-tree.js
 
 
convert-sorted-list-to-binary-search-tree.js
convert-sorted-list-to-binary-search-tree.js
 
 
count-and-say.js
count-and-say.js
 
 
count-numbers-with-unique-digits.js
count-numbers-with-unique-digits.js
 
 
count-of-smaller-numbers-after-self.js
count-of-smaller-numbers-after-self.js
 
 
count-primes.js
count-primes.js
 
 
counter.js
counter.js
 
 
course-schedule-ii.js
course-schedule-ii.js
 
 
course-schedule.js
course-schedule.js
 
 
daily temperatures.js
daily temperatures.js
 
 
decode-string.js
decode-string.js
 
 
decode-ways.js
decode-ways.js
 
 
delete-node-in-a-bst.js
delete-node-in-a-bst.js
 
 
delete-operation-for-two-strings.js
delete-operation-for-two-strings.js
 
 
detect-capital.js
detect-capital.js
 
 
diagonal-traverse.js
diagonal-traverse.js
 
 
diameter-of-binary-tree.js
diameter-of-binary-tree.js
 
 
different-ways-to-add-parentheses.js
different-ways-to-add-parentheses.js
 
 
dijkstra-shortest-path.js
dijkstra-shortest-path.js
 
 
divide-two-integers.js
divide-two-integers.js
 
 
dungeon-game.js
dungeon-game.js
 
 
escape-the-ghosts.js
escape-the-ghosts.js
 
 
evaluate-reverse-polish-notation.js
evaluate-reverse-polish-notation.js
 
 
excel-sheet-column-title.js
excel-sheet-column-title.js
 
 
excel_sheet_column_number.js
excel_sheet_column_number.js
 
 
expression-add-operators.js
expression-add-operators.js
 
 
factorial-trailing-zeroes.js
factorial-trailing-zeroes.js
 
 
filter_elements_from_array.js
filter_elements_from_array.js
 
 
find-all-anagrams-in-a-string.js
find-all-anagrams-in-a-string.js
 
 
find-all-duplicates-in-an-array.js
find-all-duplicates-in-an-array.js
 
 
find-all-numbers-disappeared-in-an-array.js
find-all-numbers-disappeared-in-an-array.js
 
 
find-bottom-left-tree-value.js
find-bottom-left-tree-value.js
 
 
find-duplicate-number.js
find-duplicate-number.js
 
 
find-first-and-last-position-of-element-in-sorted-array.js
find-first-and-last-position-of-element-in-sorted-array.js
 
 
find-k-closest-elements.js
find-k-closest-elements.js
 
 
find-largest-value-in-each-tree-row.js
find-largest-value-in-each-tree-row.js
 
 
find-mode-in-binary-search-tree.js
find-mode-in-binary-search-tree.js
 
 
find-peak-element.js
find-peak-element.js
 
 
first-missing-positive.js
first-missing-positive.js
 
 
first-unique-character-in-a-string.js
first-unique-character-in-a-string.js
 
 
flipping-an-image.js
flipping-an-image.js
 
 
fraction-to-recurring-decimal.js
fraction-to-recurring-decimal.js
 
 
game-of-life.js
game-of-life.js
 
 
gas-station.js
gas-station.js
 
 
generate-parentheses.js
generate-parentheses.js
 
 
gray-code.js
gray-code.js
 
 
group-anagrams.js
group-anagrams.js
 
 
guess-number-higher-or-lower-ii.js
guess-number-higher-or-lower-ii.js
 
 
h-index-ii.js
h-index-ii.js
 
 
h-index.js
h-index.js
 
 
hamming-distance.js
hamming-distance.js
 
 
heaters.js
heaters.js
 
 
house-robber-iii.js
house-robber-iii.js
 
 
implement-magic-dictionary.js
implement-magic-dictionary.js
 
 
increasing-triplet-subsequence.js
increasing-triplet-subsequence.js
 
 

Repository files navigation

JavaScript Problem Solving Collection

A comprehensive collection of JavaScript solutions to common coding interview problems and algorithmic challenges.

About

This repository contains solutions to various programming problems, including:

  • Array and String manipulation
  • Binary Trees and BST operations
  • Dynamic Programming challenges
  • Graph algorithms
  • Linked List problems
  • Mathematical problems
  • And many more!

Author

Hazrat Ali
Software Engineering

License

This project is licensed under the MIT License - see the LICENCE file for details.

Usage

Each file contains a self-contained solution to a specific problem. You can run individual files using Node.js:

node two-sum.js
node power_of_two.js

Contributing

Feel free to contribute by adding new solutions or improving existing ones!

About

✈ JavaScript solutions for 🚜 coding challenges,🐟 algorithms, and interview problems 🛩 Well-optimized solutions 🚍 with explanations 🚕 Covers LeetCode, CodeWars, 🚁HackerRank, and more 🚢 Includes problem-solving patterns & techniques 🐬Great for interview prep & JS mastery Open for contributions 🚁 discussions! Let’s learn ⚽and grow together

github.com/Hazrat-Ali9/JavaScript-Problem-Solving

Topics

javascript programming leetcode string array backtracking leetcode-solutions problem-solving bfs-algorithm

Resources

Readme

License

MIT, Unknown licenses found

Licenses found

MIT
LICENCE
Unknown
license-key-formatting.js
Activity

Stars

33 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •  

Languages