Some famous algorithms not yet included [SWoC]
AdityaArunSharma opened this issue · comments
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 :-
- count all possible paths from top left to bottom right in a square matric
- longest palindromic subsequence
- number of unique (structurally different) BST with given number of nodes
- rod cutting problem
Greedy based :-
- fractional knapsnack
- minimum spanning tree
- activity selection
Tree based :-
- symmetric tree
- level order traversal
- zigziag level order traversal
- maximum depth of binary tree
- invert binary tree
Hi @Abhijit2505 .
I also noticed that some of the major algorithms in string pattern matching and many others are not yet available here.
I would also want to work on these algorithms for SWOC if available!
Thanks.
We know there are algorithms which are not included in the package. Don't open an issue collectively, instead create issues of algorithms one by one.