Smit Lunagariya
Smit Lunagariya
We don't assign issues. You can come up with a PR, we will label it appropriately
Hi @kratimitra , Can you show some rough idea of how the class structure will look and what methods will you use in it?
Yes, this looks fine. You can raise a PR for that
IMHO, since LCA requires sparse table/segment tree for finding the minimum in a segment(Sparse table is prefered due to O(1) time for range min.queries), we should firstly focus on sparse...
> Sparse table can be added after discussion. https://github.com/codezonediitj/pydatastructs/issues/25 : Issue for Sparse Table. We should try adding this initially > [Segment Tree](https://en.wikipedia.org/wiki/Segment_tree) is already there as far as I...
The main problem I see here is the constraints on the range of `sum`. There are many techniques present using DP, bitsets for subset sum tasks, but the range in...
> However, the way it is formulated [here](https://en.wikipedia.org/wiki/Knapsack_problem#Definition) can motivate the creation of an `optimisation` module There exists a module of solving optimisation problems. Have a look https://cvxopt.org/
> . can you please assign me this issue? You are free to work on the issue and raise a PR. We generally don't assign issues.
> Can I work on this issue? Feel free to work on it. Please provide the implementation/API plan below in the comments
Can we also add update operation? As I think this is the most necessary feature for which segment tree is used as it can update the interval list in O(logN)...