DFS - Michael's Blog

DFS

A collection of 6 posts

Graph Valid Tree

261. Graph Valid Tree [https://leetcode.com/problems/graph-valid-tree] Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree. For example: Given n = 5

Binary Tree Maximum Path Sum

[124. Binary Tree Maximum Path Sum] Given a binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path must contain at least one node and

Topological Sorting

LintCode-127.Topological Sorting [http://www.lintcode.com/en/problem/topological-sorting/] Given an directed graph, a topological order of the graph nodes is defined as follow: For each directed edge A -> B in graph, A must before B in the order list. The first node in the order can be

Number of Connected Components in an Undirected Graph

323. Number of Connected Components in an Undirected Graph [https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/] Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected components in an undirected

Binary Tree Path Sum

LintCode-376. Binary Tree Path Sum [http://www.lintcode.com/en/problem/binary-tree-path-sum/] > Given a binary tree, find all paths that sum of the nodes in the path equals to a given number target. > A valid path is from root node to any of the leaf nodes. > Example: Given a binary

Palindrome Partitioning

LintCode-136.Palindrome Partitioning [http://www.lintcode.com/en/problem/palindrome-partitioning/] > Given a string s, partition s such that every substring of the partition is a palindrome. > Return all possible palindrome partitioning of s. > Example: Given s = "aab", return: [ ["aa","b"], ["a","a","b"] ] public class Solution { /** * @param s: A string