## Reconstruct Itinerary | Leetcode #332

This video explains an important graph programming interview problem which is to reconstruct itinerary.This problem can be solved by using just simple graph traversal technique by using multiset and stack.Map is used to construct the adjacency list because we need Read full

## Cheapest Flights Within K Stops | DFS + Pruning | Leetcode #787

This video explains a very important graph programming interview problem which is to find the minimum cost path from source to destination.This is a very typical shortest path problem and can be solved by using a variety of algorithms like Read full

## Course Schedule | Deadlock Detection | Graph Coloring

This video explains a very important programming interview problem which is, given a course schedule with prerequisites for each course, find if it is possible to take all the courses satisfying the prerequisites for each course. If it is possible Read full

## Detect cycle in undirected graph

This video explains how to detect cycle in an undirected graph. I have explained the graph coloring method for this problem. This problem is very frequently asked in coding round as well as in interview.

## Implement LRU cache

Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. int get(int key) Return the value of the key if the key exists, otherwise return -1. void put(int key, int value)  Update Read full