DSA For Non-Traditionals: 8 - Greedy algorithms

In the "DSA (Data Structures and Algorithms) for Non-Traditionals" series, I'll be going over algorithms that EVERY developer needs to be familiar with.

In this session, we'll be going over Greedy Algorithms, which is what you would use when you just have NO EFFICIENT SOLUTION to what you're trying to solve. 

Believe it or not, there are algorithms that there is NO efficient solution. For these you'll have to use approximation algorithms which we'll talk about as well.  

Video Key Points:

• Greedy algorithms and practical examples
• Greedy algorithms vs Exact algorithms
• Code examples
• What are NP-complete problems and how to recognize them

Recording