Martin's Blog

Home Archives Categories About tags
2016
Feb 10

Leetcode-Implement Trie (Prefix Tree)(Java)

Feb 9

Leetcode-Serialize and Deserialize Binary Tree(Java)

Categories

  • Algorithm
  • Leetcode
  • Network
  • Web
  • uncategoried

Tags

  • Array
  • BFS
  • BackTracking
  • Backtracing
  • Backtracking
  • Binary Search
  • Bit Manipulation
  • DFS
  • Design
  • Divide and Conquer
  • Dynamic Programming
  • Graph
  • Graph, DFS, BFS
  • Greedy
  • Hash Table
  • Heap
  • Linked List
  • Math
  • Sort
  • Stack
  • String
  • Topological Sort
  • Tree
  • Trie
  • Two Pointers
  • Two Points
  • Union Find

Tag Cloud

Array BFS BackTracking Backtracing Backtracking Binary Search Bit Manipulation DFS Design Divide and Conquer Dynamic Programming Graph Graph, DFS, BFS Greedy Hash Table Heap Linked List Math Sort Stack String Topological Sort Tree Trie Two Pointers Two Points Union Find

Archives

  • March 2016
  • February 2016
  • January 2016

Recents

  • Leetcode Counting Bits(Java)
  • Leetcode Largest Number(Java)
  • Leetcode Reverse Words in a String(Java)
  • Leetcode Wiggle Sort II(Java)
  • Leetcode Range Sum Query 2D - Immutable(Java)
© 2016 Martin
Powered by Hexo
Home Archives Categories About tags