Part 2
Studying Specific Algorithms
This lesson is really important and talks about :
- What is P vs NP?
- Djikstra's Algorithm
- Knapsack Algorithm ( Dynamic Programming )
- Traveling Salesman Problem ( Dynamic Programming )
If you've reached with all the knowledge from the previous topics, well done! You should now be able to solve the problems on DomeCode with fair amount of logic instead of trying to figure out even the simplest of keywords you might have missed as someone who was unknown to the algorithms.
What is P vs NP?
Djikstra's Algorithm
Knapsack Algorithm
Traveling Salesman Problem ( Dynamic Programming )
