DFS - Michael's Blog

Number of Connected Components in an Undirected Graph

323. 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 graph. Example 1: 0 3

LintCode

Binary Tree Path Sum

LintCode-376. 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 tree, and target = 5: 1 / \ 2 4

LintCode

Palindrome Partitioning

LintCode-136.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