lintcode-solutions
  • LintCode 刷题笔记
  • 课程笔记
    • Backtracking
    • Binary Search
    • Divide & Conquer
    • Breadth First Search
    • Depth First Search
    • Linked List & Array
    • Two Pointers
    • Stack, Queue and Heap
    • Dynamic Programming
    • Two Pointers Advanced
    • Union Find and Trie
    • Dynamic Programming Advanced
  • 基础知识储备
    • Python
      • Stack and Queue
      • Namedtuple
      • Priority Queue
      • isinstance()
      • OrderedDict
      • set and frozen set
      • Counter
      • Heap
    • Bit Manipulation
    • Fenwick Tree or Binary Indexed Tree
    • Rabin-Karp Algorithm
    • Sort
      • Merge Sort
      • Quick Sort
      • Heap Sort
  • LintCode 练习题
    • Binary Search
  • OJ Review
    • Aug 7, 2018
    • Aug 8, 2018
    • Aug 9, 2018
    • Aug 13, 2018
    • Aug 17, 2018
    • Aug 19, 2018
    • Aug 24, 2018
    • Aug 26, 2018
    • Aug 27, 2018
    • Aug 29, 2018
    • Sep 1, 2018
    • Sep 2, 2018
    • Sep 3, 2018
    • Sep 4, 2018
    • Oct 28, 2018
    • Nov 13, 2018
Powered by GitBook
On this page

课程笔记

PreviousLintCode 刷题笔记NextBacktracking

Last updated 5 years ago

算法基础

  4. Breadth-first Search

  5. Depth-first Search

  6. Linked List and Array

  7. Two Pointers

  8. Common Data Structures (Stack, Queue, Heap)

  9. Dynamic Programming

算法强化

  1. Union Find and Trie

  2. Heap and Stack

  3. Deque and Binary Search (Hard)

  4. Dynamic Programming I (Sliding Array & Memoization)

  5. Dynamic Programming II (Backpack)

  6. Follow up Questions

系统设计

  1. 第

  2. 一

  3. 节

Recursion and Backtracking
Binary Search
Binary Tree (Divide & Conquer and Traverse)