all folders must contain Readme with description of a task or data structure with notes to implementation

Existing solution can't processes duplicates and treats them as different strings

Given a binary tree, find all duplicate subtrees. For each duplicate subtrees, we only need to return the root node of any one of them. Two trees are duplicate if they have the same structure with same node values.

Finding optimal BST which keys are assigned weights (searching priorities), which cost of weights + depths(i) is minimum. Greedy solution is to pick the biggest weight node and place it in the root of the tree, but if both key and weight are max then resulting BST is unbalanced and not optimal

Given an array of integers, find two numbers whose sum is closest to 0

Graph Coloring requires either storing of colors in a DS or having special class ColoredVertex to assign colors efficiently

Some of the tasks like non-recursive traversals etc. must use parent pointer.

There is no way to particularly create Directed Graph yet. Need to come up with elegant solution to give an option during the test

related to longest common subsequence

Bst implementation within one class is causing problems in use and data duplication into root pointer. TNode struct is required to be implemented.

Some of the files are not correctly suitable for new structure. Need to refactor

The Dynamic Programming approach doesn't work with all possible cases. Probably DP is not suitable approach for this task. Need to come up with effective solution time complexity of which is better then O(n^2)

Given an array of integers, find the max length of consecutive numbers present in array. The numbers don't need to be in order. Ex. 7 1 5 3 9 2 4 => Ans.: 1 2 3 4 5

sometimes there is a need to find out whether vertex presented in the graph or not and to get its id if exists already