Nine notes

Nine notes

Live long and prosper

Home Archive About RSS

Reading articles in Leetcode

2016

  • 2016/01/30Paint House I
  • 2016/01/26014.Longest Common Prefix
  • 2016/01/26013.Roman to Integer
  • 2016/01/26Container With Most Water
  • 2016/01/26010.Regular Expression Matching
  • 2016/01/21ZigZag Conversion
  • 2016/01/20026.Remove Duplicates From Sorted Array II
  • 2016/01/20Remove Duplicates From Sorted Array
  • 2016/01/12326.Power of Three
  • 2016/01/11219.Contains Duplicate II
  • 2016/01/11Majority Element
  • 2016/01/11020.Valid Parentheses
  • 2016/01/11217.Contains Duplicate
  • 2016/01/11171.Excel Sheet Column Number
  • 2016/01/11288.Unique Word Abbreviation
Previous1…89101112Next
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
  • Rahul Manghnani

    Video...

    129.Sum Root to Leaf Numbers · 4 years ago

  • 嗯大爷

    赞赞赞!!Thanks so...

    Notes for Harvard CS75 Web Development Lecture 9 Scalability by David Malan · 8 years ago

© Nine notes. Powered by Hexo. Theme by Cho.