Nine notes

Nine notes

Live long and prosper

Home Archive About RSS

Reading articles in Leetcode

2016

  • 2016/09/16380.Insert Delete GetRandom O(1)
  • 2016/09/15215.Kth Largest Element in an Array
  • 2016/09/15059.Spiral Matrix II
  • 2016/09/15054.Spiral Matrix
  • 2016/09/15101.Symmetric Tree
  • 2016/09/14168.Excel Sheet Column Title
  • 2016/09/14075.Sort Colors
  • 2016/09/13121.Best Time to Buy and Sell Stock
  • 2016/09/13273.Integer to English Words
  • 2016/09/1388.Merge Sorted Array
  • 2016/09/12098.Validate Binary Search Tree
  • 2016/09/12257.Binary Tree Paths
  • 2016/09/12346.Moving Average From Data Stream
  • 2016/09/12295.Find Median From Data Stream
  • 2016/09/11374.Guess Number Higher or Lower
Previous1…34567…12Next
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.