I'm trying to find an online source or textbook with problems+solutions for problems in dynamic programming, number theory, graph theory, greedy algorithms, etc. Do you know of any?
$\begingroup$
$\endgroup$
6
-
2$\begingroup$ Google is your friend. $\endgroup$– BuffyOct 10, 2019 at 20:38
-
1$\begingroup$ Google has been not friendly lately, but I will try again. Thanks! $\endgroup$– Drimades BoyOct 11, 2019 at 15:17
-
$\begingroup$ It's been noted before that most resources are not organized this way. I'm not sure why even one online resource is hard to find, but that does seem to be the case. $\endgroup$– Ben I. ♦Oct 11, 2019 at 16:51
-
$\begingroup$ Jeff Erickson's page (U of Illinois) is a good source with plenty of materials, but the provided solutions are quite fragmented. $\endgroup$– Drimades BoyOct 11, 2019 at 23:31
-
$\begingroup$ Could you clarify online? Would a paper textbook whose code is available online meet your needs? $\endgroup$– Peter TaylorOct 15, 2019 at 8:26
|
Show 1 more comment
3 Answers
$\begingroup$
$\endgroup$
1
Based on clarification in comments, Algorithms 4th ed. by Sedgewick and Wayne seems to meet your criteria. The book itself doesn't seem to have an official PDF version (I haven't searched for unofficial ones of dubious provenance), but the code is available both at the linked page and on Github, and includes solutions to selected exercises.
-
$\begingroup$ That's a great resource! It would be perfect if we could find also solved problems in the style of Jeff Erickson's Algorithms textbook. $\endgroup$ Oct 15, 2019 at 22:29
$\begingroup$
$\endgroup$
There are a number of sites with challenges- once you complete a challenge you can often view other solutions, and many of these sites (not all) support multiple languages.
Even the "Python Challenge" tasks can be solved with another language since all you are looking for each time is the next url. A scan of each site will give you a good idea if the problem sets are useful, or if they spark ideas for your own challenges.
Worth a look I think.
$\begingroup$
$\endgroup$
The Sedgwick resource is excellent. Besides online chapter summaries and code examples, it has a corresponding Coursera class with videos and grades exercises.
