knaxus / problem-solving-javascript Goto Github PK
View Code? Open in Web Editor NEW:fire: Crack you JS interviews β‘ Collection of most common JS Interview questions with Unit Tests π
Home Page: https://ashokdey.in
License: MIT License
:fire: Crack you JS interviews β‘ Collection of most common JS Interview questions with Unit Tests π
Home Page: https://ashokdey.in
License: MIT License
The algorithm is here : Fibonacci
Thank You!
Linked-list removeAt function not working properly.
File location linked-list
Please go through the Contribution Guide here https://github.com/knaxus/problem-solving-javascript#contribution-guide before going forward with this issue.
Thanks
The algorithm is here : A* pathFinder
Thank You!
Problem: Given two string A and B. Check if A is Substring of B.
Return true if substring , else return false.
Create a new folder KMP
in Classics
Highly recommended to watch this video to understand KMP
Thank You!
Just correct the spelling of Find under contribution in Readme.md file of the repository. Can I do it?
PS- I am newbie, sorry for this silly issue.
If this is a valid issue, please assign it to me.
The algorithm is here : Caeser Cipher
Thank You!
File location - Queue
Example:
Queue q = [1,2,3,4,5,6];
q.empty() false
q.size() 6
q.front() 1
q.back() 6
q.push(10) [1, 2, 3, 4, 5, 6, 10]
q.pop() [2, 3, 4, 5, 6, 10]
The algorithm is here : check-binary-tree-subtree-another-binary-tree
Thank You!
The algorithm is here : LRU-Cache
Thank You!
The algorithm is here : get-smallest-common-number
Thank You!
Function to test: preOrder();
The algorithm is here : Binary Tree
Thank You!
Hello folks! Unit testing is one of the best ways to build robust applications. If you are a beginner, it's a great place to start with Unit Testing and your Open Source contribution journey.
You can find ample of examples in the repo itself and hence can kickstart with the unit tests for solutions not having test cases.
Hello all, I am working on the implementation of Segment Tree. You can read more about it here: Segment Tree Hackerearth
Create a new folder bottom-view-binary-tree
in Binary Tree .
Use implemented BinaryTree.
Problem is statement here: bottom-view-binary-tree.
Thank You!
What do we need in the Contribution Guide?
When adding a new problem with solution
When adding a Unit Test
for (let i = arr.length - 1; i > 0; i -= 1)
(At line 24 of src/Problems/product-of-elements/index.js)
It should be :
for (let i = arr.length - 1; i >= 0; i -= 1)
For more information- lowest-common-ancestor-in-a-binary-search-tree
Hello folks, please go through the Contribution Guide here https://github.com/knaxus/problem-solving-javascript#contribution-guide before going forward with this issue.
Thanks
Hey! I have just added a new problem.
Can you please review it so that I can make a PR.
Caesar cipher should raise and error when second argument is not a number, instead it's returning a string of "undefinedundefinedundefined"
Create a new folder check-binary-tree-subtree-another-binary-tree
in Binary Tree .
Use implemented BinaryTree.
Problem is statement here: check-binary-tree-subtree-another-binary-tree.
Thank You!
Add Reverse first k elements of queue problem and solution
The algorithm is here : get-mazePath
Thank You!
If you are very new to the world of software development and you are finding it hard to start your open source contribution, here is the easiest way to kick-off!
This issue is not bounded to a single person
Mention the Problems you will be adding so that people do not collide
Function fibonacciTabular is not handled if a negative number is provided. It returns undefined as output.
If 0 is given as index in fibonacciTabular it returns 0 instead of 1.
@ashokdey For the functions fibonacci and fibonacciMemoized if negative numbers are provided the output is coming as 1. Is it correct to handle in such a way that the output should be 1 or it should be handled that the output comes as 0?
Thank You!
File location : Suffix tree
Hello folks, please go through the Contribution Guide here https://github.com/knaxus/problem-solving-javascript#contribution-guide before going forward with this issue.
Thanks
Hello folks, please go through the Contribution Guide here https://github.com/knaxus/problem-solving-javascript#contribution-guide before going forward with this issue.
Thanks
Hey - just wanted to let you know that I will be creating genetic algorithm for solving n-queens problem in JavaScript. Hope you will like it.
The algorithm is here : get-unique-words
Thank You!
The algorithm is here : all-words-in-trie
Thank You!
Hello folks, please go through the Contribution Guide here https://github.com/knaxus/problem-solving-javascript#contribution-guide before going forward with this issue.
Thanks
Add unit test to find total word count in a trie.
The algorithm is here : total-words-in-trie
Contribution guide is here : CONTRIBUTION
Thank You!
Add the Unit Test for #33
What is required?
Thank You!
Function to test: search();
The algorithm is here : Trie
Thank You!
Add unit test to find unique word count in a trie.
The algorithm is here : unique-word-count
Contribution guide is here : CONTRIBUTION
Thank You!
I am taking up the task to implement Heap Data Structure. You can find more details here: Heap Data Structure on Wikipedia
Display in Doubly Linked List should not log to console, instead return an array so that I can be tested easily.
I am adding the same in Contribution guide and correcting for previous non-linear data structures
If you liked the work add a star to it.
π€ Why I am worried?
I can see that the CI here is working great and I have an idea of having CD as well.
To have a CD pipeline in place we can do the following:
π
The algorithm is here : Loop in list
Thank You!
For more information- Binary Tree to Binary Search Tree Conversion
Hello folks, please go through the Contribution Guide here https://github.com/knaxus/problem-solving-javascript#contribution-guide before going forward with this issue.
Thanks
I would gladly take up the task for adding Armstrong no.
Create a new folder print-nodes-top-view-binary-tree
in Binary Tree .
Use implemented BinaryTree.
Problem is statement here: print-nodes-top-view-binary-tree.
Thank You!
File location postfix-expression-evaluation
If too few number arguments are passed then it should throw error or expression is not in order.
Few cases:
12
Error1
Error+
Error1+2
Error+12
ErrorLinked-list addAt function not working properly.
File location linked-list
Please go through the Contribution Guide here https://github.com/knaxus/problem-solving-javascript#contribution-guide before going forward with this issue.
Thanks
Hello folks, please go through the Contribution Guide here https://github.com/knaxus/problem-solving-javascript#contribution-guide before going forward with this issue.
Thanks
The algorithm is here : bottom-view-binary-tree
Thank You!
A declarative, efficient, and flexible JavaScript library for building user interfaces.
π Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. πππ
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google β€οΈ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.