Tag Archives: BFS

01 Matrix
Leave a commentJune 20, 2017 by oneOokay
Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell. The distance …
Continue reading 
Course Schedule I II
Leave a commentDecember 19, 2016 by oneOokay
There are a total of n courses you have to take, labeled from 0 to n – 1. Some courses …
Continue reading 
Topological Sorting Related
Leave a commentDecember 18, 2016 by oneOokay
拓扑排序以及相关题目： 拓扑排序 For each directed edge A > B in graph, A must before B in the order list. The …
Continue reading 
Graph Valid Tree
Leave a commentNovember 30, 2016 by oneOokay
Given n nodes labeled from 0 to n – 1 and a list of undirected edges (each edge is a …
Continue reading 
Binary Tree Right Side View
Leave a commentNovember 22, 2016 by oneOokay
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you …
Continue reading 
Word Ladder I
Leave a commentNovember 21, 2016 by oneOokay
Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord …
Continue reading 
Word Ladder II
Leave a commentNovember 21, 2016 by oneOokay
Given two words (beginWord and endWord), and a dictionary’s word list, find all shortest transformation sequence(s) from beginWord to endWord, …
Continue reading