Eddy的记事本

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.) You have the following 3 operations permitted on a word: a

Two Sum, Two Sum II – Input array is sorted, Two Sum III – Data structure design, 3Sum, 3Sum Closest, 4Sum, k Sum, k Sum II.

Path Sum, Path Sum II, Binary Tree Maximum Path Sum

Maximum Depth of Binary Tree, Minimum Depth of Binary Tree, Balanced Binary Tree

Stock Maximize Your algorithms have become so good at predicting the market that you now know what the share price of Wooden Orange Toothpicks Inc. (WOT) will be for the next N days. Each day,

Given two strings, find the longest common substring. Return the length of it.Note The characters in substring should occur continiously in original string. This is different with subsequnce. Exampl

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, given s = “leetcode”, dict = [“leet”, “co

Validate Binary Search Tree, Recover Binary Search Tree, Successor of Binary Search Tree, Binary Search Tree Iterator, Largest Binary Search Tree (BST) in a Binary Tree