I would appreciate some advise/mentoring on self-study of algorithms. Based on my several years of work as a software developer (non CS background), I have some good grip on standard data structures (linked lists, stacks etc.) and basic sorting and searching algorithm characteristics (time/space complexity).
My goal of learning is to take my knowledge to next level (learning graph theory and advanced algorithm techniques such as dynamic and linear programming) to be able to use it in a variety of situations incl. AI and computationally complex domain problems.
So I purchased 2 books — Algorithm Design Manual from Skiena and Algorithms by Dasgupta et al. I am aware of the usual advice of CLRS, but decided to skip it for now as my goal at this stage is not proofs.
Now my question is: even though I found the style of writing of Dasgupta book rather appealing, topic is often difficult for unguided, unsupervised learning.
Are there any recommendable online courses (free or otherwise) which would cover topics from Dasgupta book? In general, I found the topics covered in Stanford Algorithm specialization (coursera and edX) rather good, but any further options would be helpful!