Nine notes

Nine notes

Live long and prosper

Home Archive About RSS

Reading articles in DFS

2016

  • 2016/09/27108.Convert Sorted Array to Binary Search Tree
  • 2016/09/19124.Binary Tree Maximum Path Sum
  • 2016/09/17117.Populating Next Right Pointers in Each Node II
  • 2016/09/17116.Populating Next Right Pointers in Each Node
  • 2016/09/15112.Path Sum
  • 2016/09/15101.Symmetric Tree
  • 2016/09/12098.Validate Binary Search Tree
  • 2016/09/12257.Binary Tree Paths
  • 2016/09/11394.Decode String
  • 2016/09/08129.Sum Root to Leaf Numbers
  • 2016/08/29200.Number of Islands
  • 2016/08/28111.Minimum Depth of Binary Tree
  • 2016/03/06Max Root to Leaf Sum
  • 2016/01/09100.Same Tree
  • 2016/01/03104.Maximum Depth of Binary Tree
Categories
  • Distributed Computing
  • Interview
  • Leetcode
  • System Design
Tags
Web Leetcode Hash String System Design Reading List Technical Interview Interview Two Pointers Design Divide and Conquer Binary Search Dynamic Programming Tree DFS Bit Manipulation TODO Array Greedy Distributed Computing Backtracking Math Stack Bit Linked List Heap Queue Trie Sort Graph Topological Sort Binary Search Tree BFS Union Find trees
Recent
  • RelationCosts
  • PageDisplay
  • MeetingIntervals
  • KEditDistance
  • CIDR
  • Sliding Puzzle
  • 362. Design Hit Counter
  • 342. Power of Four
  • 231. Power of Two
  • 412. Fizz Buzz
Recent Comments
© Nine notes. Powered by Hexo. Theme by Cho.