算法面试之题目分类，按类型和规律刷题，事半功倍

算法面试过程中，题目类型多，数量大。大家都不可避免的会在LeetCode上进行训练。但问题是，题目杂，而且已经超过1000道题。全部刷完且掌握，不是一件容易的事情。那我们应该怎么办呢？找规律，总结才是制胜法宝。下面我们就来看看Grokking the Coding Interview: Patterns for Coding Questions的分类及每个类型的经典题目：

1. Pattern: Sliding window，滑动窗口类型

经典题目：
Maximum Sum Subarray of Size K (easy)
Smallest Subarray with a given sum (easy)
Longest Substring with K Distinct Characters (medium)
Fruits into Baskets (medium)
No-repeat Substring (hard)
Longest Substring with Same Letters after Replacement (hard)
Longest Subarray with Ones after Replacement (hard)

2. Pattern: two points, 双指针类型

经典题目：
Pair with Target Sum (easy)
Remove Duplicates (easy)
Squaring a Sorted Array