knaxus / problem-solving-javascript Goto Github PK

Hello all, I am working on the implementation of Segment Tree. You can read more about it here: Segment Tree Hackerearth

👽 What is required?

The algorithm is here : check-binary-tree-subtree-another-binary-tree

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

I am taking up the task to implement Heap Data Structure. You can find more details here: Heap Data Structure on Wikipedia

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

Add the Unit Test for #33

What is required?

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

Knuth–Morris–Pratt(KMP) Pattern Matching(Substring search)

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

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

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.

🤡 What is required?

The algorithm is here : Caeser Cipher

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

Linked-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

👽 What is required?

Function to test: search();
The algorithm is here : Trie

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

🕵️‍♂️ What is required?

You can learn about it from here

• Create a new folder in Searching
• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

👽 What is required?

The algorithm is here : Fibonacci

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

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

Add Reverse first k elements of queue problem and solution

Add This Question To Binary Tree Section.

👽 What is required?

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!

👽 What is required?

The algorithm is here : all-words-in-trie

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

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

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 Error
• 1 Error
• + Error
• 1+2 Error
• +12 Error

👽 What is required?

Function to test: preOrder();
The algorithm is here : Binary Tree

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

👽 What is required?

The algorithm is here : bottom-view-binary-tree

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

🥶 What is required?

• Create a new folder in Searching
• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Follow the Contribution Guide strictly, go through the codebase pattern and add tests accordingly

Thank You!

I would gladly take up the task for adding Armstrong no.

🤡 What is required?

The algorithm is here : Loop in list

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

🤖 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:

• Create a web page of problem listing
• Create an express server to serve that weeb page
• Finally, Heroku can be used to showcase the repo to the world in the form of a website

🎉

👽 What is required?

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!

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)

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.

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

🤡 What is required?

The algorithm is here : LRU-Cache

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

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.

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

What do we need in the Contribution Guide?

• When adding a new problem with solution

  • Take care of the filename convention (Very Important)
  • Problem statement should be there with examples
  • Make sure you add the Run Time complexity of your solution
  • Please take care of the segregation of the Problems as per the given Folder Structure
  • It's great if you can add the Unit Tests to verify your solutions as well
  • Strictly follow ESLINT rules

• When adding a Unit Test

  • Take care of the file name convention
  • Make sure CI (Travis) is passing

Need following functions in queue:

File location - Queue

1. empty() – Returns whether the queue is empty.
2. size() – Returns the size of the queue.
3. front() – Function returns a the first element of the queue.
4. back() – Function returns a the last element of the queue.
5. push(g) – Function adds the element ‘g’ at the end of the queue.
6. pop() – Function deletes the first element of the 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]

⚠️ Issue

Caesar cipher should raise and error when second argument is not a number, instead it's returning a string of "undefinedundefinedundefined"

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

🤖 What is required?

The algorithm is here : A* pathFinder

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

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.

👽 What is required?

The algorithm is here : get-mazePath

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

Hey! I have just added a new problem.
Can you please review it so that I can make a PR.

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.

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

• Add a logical problem with the solution
• Follow the pattern for file names and folder name (adding Contribution Guide ASAP)
• Add Unit Test as well to verify the solution

Create a new folder bottom-view-binary-tree in Binary Tree .
Use implemented BinaryTree.
Problem is statement here: bottom-view-binary-tree.

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

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

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.

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?

Check for balanced parentheses in the given string.

 ()() --> return true
 (((  --> return false
 ((()  --> return false

I want to implement this problem using reduce() method in JS.

Can I work on this problem ?

👽 What is required?

The algorithm is here : get-smallest-common-number

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

👽 What is required?

The algorithm is here : get-unique-words

• Follow the ESLint rules strictly
• Follow the filename and folder structure strictly
• Since the Contribution Guide is not ready yet, go through the codebase pattern and add tests accordingly

Thank You!

This is a famous backtracking problem

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