edualgo / edualgo Goto Github PK

I'm starting working on

• Coin Change Problem

Binary Search tree implementation
I will include functions for insertion lookup deletion.
Also i want to include Breadth First Tree and Depth Search Tree algorithms.

Is your feature request related to a problem? Please describe.
Yes, the library does not contain randomized quick sort algorithm

Describe the solution you'd like
Will implement a function randomizedQuickSort(arr,hint)

Describe alternatives you've considered
nothing as of now

Can I work on this?

Need to add additional methods

1. KthLevel -> This method is for print elements present on the Kth level from the top root.
2. CountNode -> This method is for counting the total elements present in the Tree.

Here is a list of algorithmic implementations using a linked list,

• Design Linked List -
• Rotate List -
• Insert Into a Sorted Circular Linked List -
• Add Two Numbers -
• Remove Nth Node From End of List -
• Copy List with Random Pointer -
• Remove Duplicates From The Sorted List (Second Version) -
• Reorder List -
• Linked List Cycle (Second Version) -
• Reverse Linked List (Second Version) -
• Linked List In Binary Tree -
• Insertion Sort List -
• Remove Zero-Sum Consecutive Nodes from Linked List -
• Partition List -
• Sort List -
• Design Phone Directory -
• Convert Sorted List to Binary Search Tree -
• Swap Nodes in Pairs -
• Split Linked List in Parts -
• Add Two Numbers(Second Version) -
• Flatten a Multilevel Doubly Linked List -
• Odd-Even Linked List -
• Linked List Components -
• Next Greater Node in Linked List -
• Plus One Linked List -
• Convert Binary Search Tree to Sorted Doubly Linked List -

Work upon these algorithms are going on.

Here is a list of algorithmic implementations using a linked list,

• Palindromic Linked List -
• Remove Linked List Elements -
• Intersection Of Two Linked List -
• Linked List Cycle -
• Remove Duplicates From a Sorter List -
• Merge Two Sorted List -
• Reverse Linked List -
• Delete Node In a Linked List -
• Middle Of the Linked List -
• Delete M Modes after N Nodes of a Linked List -
• Convert Binary Number In a Linked List to integer -

The addition of code for these implementations is ongoing.

I am a participant of SWOC 2021. I would like to contribute by adding the code for searching and sorting
Kindly assign this issue to me
Thank you

Is your feature request related to a problem? Please describe.
I would like to add Segment Tree Implementation under algorithm folder.

Describe the solution you'd like
Implementing Segment Tree with various range based query implementation.

Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.

Additional context
Add any other context or screenshots about the feature request here.

I am starting with Hamiltonian cycle:
Hamiltonian cycle is a Hamiltonian Path such that there is an edge (in the graph) from the last vertex to the first vertex of the Hamiltonian Path. Determine whether a given graph contains Hamiltonian Cycle or not. If it contains, then prints the path.

For example:
Hamiltonian Cycle in the following graph is {0, 1, 2, 4, 3, 0}
(0)--(1)--(2)
| / \ |
| / \ |
| / \ |
(3)-------(4)
And the following graph doesn’t contain any Hamiltonian Cycle
(0)--(1)--(2)
| / \ |
| / \ |
| / \ |
(3) (4)

• Climbing Stairs Problem

This issue is for adding contributors to the python package readme

No software package can be free of bugs practically, we would like you to point out the bugs you see in the package and create an issue first describing the bug.

You can also point the bugs out as a reply to this issue.

your repository lacks maths algorithms.

These are the popular algorithms, that use backtracking. Your task is to design the code for these algorithms inside the package.

• Print all permutations of a given string(@Prakhar-Mangal)
• The Knight’s tour problem (@Priyaa-Agrawal)
• Rat in a Maze (@charlie219)
• N Queen Problem (@charlie219 )
• Subset Sum (@vedantgoswami)
• m Coloring Problem(@Prakhar-Mangal)
• Hamiltonian Cycle
• Sudoku (@vedantgoswami)
• Tug of War
• Solving Cryptarithmetic Puzzles

As these are quite popular, you just need to google the name for the problem statement, but never use google for the solution, try to solve it first, if not possible, try again. Try two times more.

As a final step, you may contact the project admin. But never use google for a solution directly.

Stack is an abstract data type

• User can insert object in to a stack
• Remove the recent added element from the stack
• Check is the stack is empty
• Calculate the length of the stack

I'm working on

• Longest Common Subsequence

• is_empty will return true if data is empty
• I have to change the doc string from Returns boolean False if data is empty or True to Returns boolean False if the data is not empty else True

• Add element to a queue
• Remove element from a queue
• Check queue is empty
• find the length of queue
• get the first added element in the queue using a function

Is your feature request related to a problem? Please describe.
travelling salesman problem is missing from graph algorithms.

Describe the solution you'd like
will add the DP solution for the travelling salesman problem.
DP solution is slightly efficient than factorial time methods.

Is your feature request related to a problem? Please describe.
To check the storage of your device, tracking the size and information of all files in directory

Describe the solution you'd like
The script displays the size of the current directory in bytes, kilobytes, gigabytes, and megabytes.

Describe alternatives you've considered

Additional context

I am a participant of SWOC 2020,
I would like to contribute by adding the code for Boyer Moore under the string algorithms.
Kindly assign this issue to me.
Thank you.

Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]

Describe the solution you'd like
A clear and concise description of what you want to happen.
I would like to add:
Binary search algo
Sublinear search algo
Bilinear search algo
Random select algo

Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.

Additional context
Add any other context or screenshots about the feature request here.

The python package currently doesn't cover Dijkstra Algorithm

• Dijkstra Algorithm - @Siddhant-K-code

**Suggest two differerent parition method **
The partition method implemented so far is taking the last element as the pivot point i.e Lomuto. Suggest to make two different parition and explain why Hoare performs better.

How will this impact the quicksort already in the code
It will not, by default we can make it either one and additionally let the user type the string 'Hoore' as a parameter if they want this paritioning to be used.

Extra feature
guide users to the necessary material for the difference and the importance of choosing the right parition (using help() like done in the previous ones)

Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]

Describe the solution you'd like
A clear and concise description of what you want to happen.

Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.

Additional context
Add any other context or screenshots about the feature request here.

I'm working on

• 0/1 Knapsack Problem

Found some famous algorithms that are not yet included in the library. Please go through it and mention those on which I can work

Dynammic Programming based :-

1. count all possible paths from top left to bottom right in a square matric
2. longest palindromic subsequence
3. number of unique (structurally different) BST with given number of nodes
4. rod cutting problem

Greedy based :-

1. fractional knapsnack
2. minimum spanning tree
3. activity selection

Tree based :-

1. symmetric tree
2. level order traversal
3. zigziag level order traversal
4. maximum depth of binary tree
5. invert binary tree

Need to Add Heap Sort Algorithm
Heap Sort Algorithm with explanation and visualization

Add the sorting algorithm: Quicksort.

Three binary tree traversal methods have been added,

• Inorder Traversal
• Preorder Traversal
• Postorder Traversal

Added by @yash872

Description

The variable name is not defined where it is used.

Occurrences

There are 6 occurrences of this issue in the repository.

See all occurrences on DeepSource → deepsource.io/gh/Abhijit2505/eduAlgo/issue/PYL-E0602/occurrences/

I wish to contribute some important greedy algorithms like maximizing sum of absolute difference in an array,Water Connection problem,activity selection problem.Kindly assign me the issue.

An array of jobs is given where every job has a deadline and associated profit if the job is finished before the deadline. It is also given that every job takes the single unit of time, so the minimum possible deadline for any job is 1. finding a way to maximize total profit if only one job can be scheduled at a time.

Is your feature request related to a problem? Please describe.
It is a feature for additional enhancement

Describe the solution you'd like
This is a feature that helps to find the shortest distance between two nodes. It uses pygame, and has keys functionalities that even a layman can use.

Describe alternatives you've considered
Alternatives include creating the same without a GUI

Adding 5 different searching, sorting algorithms in the project such as insertion ,linear search ,binary search, selection sort, merge sort ,quick sort,heap sort and also adding the worst,best,average complexities of each algorithms

Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
I would like to add Cryptography Algorithms
Affine Cipher
Burrows-Wheeler Transform
Caesar Cipher
RSA Algorithm
XOR Cipher
Vigenere Cipher

Describe the solution you'd like
A clear and concise description of what you want to happen.
Cryptography Algorithms

Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.

Additional context
Add any other context or screenshots about the feature request here.

I'm starting with:

• House Robber Problem

Help me to getting things.

Cheers !! PyCon Devsprint is here 🎉🎉

You may add any of your favourite algorithms to our modules.

Just comment the name of the algorithms below in this issue and I will be assigning you the same.
Join the discuss here - eduAlgo Zulip

Assigned Issues

• Delete nth node from the end in a Linked List - @Abhaskar1
• Insertion Sort - @24apurv
• Binary Search algorithm based on Divide and Conquer Methodology - @KanakKvdi
• Mege sort and Shell Sort - @nihilistdbanana

Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
I would like to add Fibonacci Numbers Algorithms

Describe the solution you'd like
A clear and concise description of what you want to happen.
Fibonacci Number's algorithms

Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.

Additional context
Add any other context or screenshots about the feature request here.

Hello , I want to contribute to add sorting algorithm Selectionsort.

Hello sir, I am a participant in SWOC 2021, I would like to contribute by adding the code for Min Steps to 1 In Dynamic Programming.
Kindly assign this issue to me.
Thank you.

Here is a list of algorithmic implementations using a linked list,

• Reverse Nodes in k-Group -
• Merge k Sorted Lists -

The addition of code for these implementations is ongoing.

I am a participant of SWOC 2021, I would like to contribute by adding the code for Cycle Sort.
Kindly assign this issue to me.
Thank you.

There are various popular Dynamic Programming Problems and I'm starting with:

• Kadane’s Algorithm

Description

Variable is being assigned to itself.

Occurrences

There is 1 occurrence of this issue in the repository.

See all occurrences on DeepSource → deepsource.io/gh/Abhijit2505/eduAlgo/issue/PYL-W0127/occurrences/

Description

Hi @Abhijit2505

I'm in total love with your Project, especially since I got to use your Package for a personal Project. That's a great work put up by you and the Team at EduAlgo.

I would like to highlight few issues in the Project Code right now:

• You can stop tracking your VS Code Configuration by removing .vscode
• You can remove the Project Build build/lib/edualgo from the Repository.
• You can remove the Egg Packaging eduAlgo.egg-info from the Repository.

These are healthy suggestions to keep the Project hassle-free while installation and preventing leaks.

Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
I would like to add areas algorithm.

Describe the solution you'd like
A clear and concise description of what you want to happen.
We can add areas algorithms

Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.

Additional context
Add any other context or screenshots about the feature request here.

cheat sheet of time and space complexity of searching, sorting ,linkedlist ,arrays operations

Testing is a very important phase for any software package. Although there are awesome libraries like pytest etc available in python for testing, still we like to prefer maintaining our own testing module.

Your task is to come up with the testing module for all the methods described in the package.