The Code
  • Home
  • Archives
  • Tags
  • About

Posts Tagged “Memorizing”

  • 19 Oct 2017 Target Sum

    backtracking using Brute-force, Memorizing, and DP.

Recent Posts

  • Sort Colors
  • Sort Colors II
  • Copy List with Random Pointer
  • Subarray Sum Closest
  • Maximum Subarray

Tags

  • Algorithm
  • Amazon
  • Array
  • Automata
  • BFS
  • BST
  • Backtracking
  • Binary Search
  • Binary Search - XXXOOO
  • Bit Operations
  • Boyer–Moore–Horspool algorithm
  • Brute-Force
  • Caching
  • Circular Array
  • Combination
  • DFS
  • DP
  • Divide & Conquer
  • Dynamic Programming
  • Easy
  • Graph
  • Hard
  • HashMap
  • Hashmap
  • In-order
  • Iterator
  • Java
  • KMP
  • Leetcode
  • LinkedList
  • Lintcode
  • Math
  • Matrix
  • Medium
  • Memorizing
  • Merge Sort
  • Moving Window
  • Permutations
  • Post Order
  • Post-Order DFS
  • Post-order
  • Postorder
  • Pre Order
  • PrefixSum
  • Preorder
  • Priority Queue
  • Python
  • Quick Sort
  • Quisk Sort
  • Regex
  • Single Scan
  • Space Complexity
  • Stack
  • String
  • Subarray
  • Subset Sum
  • TODO
  • ToDo
  • Topology
  • Tree
  • Two Pointers
  • Two Sum
  • Union-Find
  • backtracing
  • jekyll
  • leetcode

Weihan Jiang © 2017

Follow me