-
Hi there, I feel a couple of algorithms are not designed property and I think need to check the entire algorithms again to make sure about these.
I do not have free time now, But I must do it ASAP.…
-
In the Greedy Algorithms section, coin change problem is provided as an example. This creates an impression that every coin change problem can be solved with greedy approach. This is incorrect since u…
-
> ```
> # Progress Tracker
> ```
>
> ## DSA
> * [ ] Complete Git & GitHub Course
> * [ ] Introduction to Programming
>
> * * [ ] Types of languages
> * * [ ] Memory management…
-
https://julia.quantecon.org/dynamic_programming/discrete_dp.html and also https://julia.quantecon.org/multi_agent_models/aiyagari.html also uses it
- Uses a relatively standard MDP algorithm wi…
-
`(max 1.0 2)` results in `2.0`. I propose that it should return `2`.
For me, I mostly use `max` and `min` when I write dynamic programming algorithms. The initial value in these algorithms is usual…
-
Hi ,
I''m working on the mentioned challenge, and I see you made a CPP version.
With an algorithm of dynamic programming i reach good results, when L and R become LONG type, then it take forever to ca…
-
[Note: Not to confuse with our algorithm challenges in JavaScript]
We need solid articles on following Algorithm-related topics (similar to #1044 ):
- [ ] Big-O Notation (assigned to @angregor)
- [ ]…
-
I would like to implement an algorithm to find the number of possible paths from (0,0) to (M-1,N-1) in an MxN matrix where the only moves are right and down (so +1 on x or y) in C++. This would go und…
-
## Issue Description
We're looking to enhance the functionality of PyDS-A by adding more methods to our existing algorithms. This will provide users with a more comprehensive toolkit for solving va…
-
## Description:
The Longest Palindromic Substring (LPS) algorithm is used to find the longest contiguous substring in a given string that reads the same forward and backward. This is an efficient sol…