Contents What is Dijkstra Algorithm Time Complexity Conditions for Dijkstra Algorithm Steps Basic Example Example with Priority Queue (Heap) What is Dijkstra Algorithm Dijkstra Algorithm is an algorithm for finding...

Contents What is Dynamic Programming Dynamic Programming and Divide and Conquer Condition of Dynamic Programming Memoization Bottom-up and Top-down Bottom-up Top-down What is Dynamic Programming Dynamic Programming is simplifying a...

Contents What is Observer Pattern? Why use Observer Pattern? Problems Example Implementation What is Observer Pattern? Observer pattern a design pattern that an object (subject) maintains a list of its...

Contents What is Adapter Pattern? Why use Adapter Pattern? Pros and Cons Example Implementation What is Adapter Pattern? Adapter pattern lets the interface of an existing class to be used...

Contents What is Strategy Pattern? Why use Strategy Pattern? Problems Example Simple structure of the game Implementation What is Strategy Pattern? Strategy lets the algorithm vary independently from clients that...