My Awesome Book

This file file serves as your book's preface, a great place to describe your book's content and ideas.

Contents

Summary

• DFS,

  • Maximum Depth of Binary Tree

  • Number of Islands

  • Same Tree

  • Balanced Binary Tree

  • Convert Sorted Array to Binary Search Tree

  • Max Area of Island

  • Symmetric Tree

  • Construct Binary Tree from Preorder and Inorder Traversal

  • Construct Binary Tree from Inorder and Postorder Traversal

  • Remove Invalid Parentheses

  • Populating Next Right Pointers in Each Node

  • Populating Next Right Pointers in Each Node II

  • Recover Binary Search Tree

  • Path Sum

  • Path Sum II

• BFS

  • Number of Islands

  • Perfect Squares

  • Remove Invalid Parentheses

  • Word Ladder & Word Ladder II

  • Binary Tree Level Order Traversal

  • Clone Graph

  • Minimum Depth of Binary Tree

  • Binary Tree Level Order Traversal II

  • Binary Tree Right Side View

  • Course Schedule

  • Binary Tree Zigzag Level Order Traversal

• Backtracking

• Union-Find

• Trie

• Priority Queue,

• Heap

  • Kth Largest Element in an Array

  • Merge k Sorted Lists

  • Top K Frequent Elements

  • The Skyline Problem

  • Sliding Window Maximum

• Stack

  • Trapping Rain Water

  • Valid Parentheses

  • Min Stack

• Queue

  • Task Scheduler

  • Moving Average from Data Stream

  • Max Sum of Rectangle No Larger Than K

Find the Connected Component in the Undirected Graph

https://aaronice.gitbooks.io/lintcode/content/two_pointers/container_with_most_water.html