常见面试算法题

https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/description/

令牌桶是一种常见的限流算法，它的工作原理如下： 令牌生成：系统以固定的速率向桶中添加令牌 令牌消耗：请求需要消耗令牌才能被处理 容量限制：桶有最大容量，多余的令牌会被丢弃 请求处理

https://leetcode.cn/problems/ping-heng-er-cha-shu-lcof/description/

https://leetcode.cn/problems/er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/description/

携程面试题，找不到原题，有点类似https://leetcode.cn/problems/choose-k-elements-with-maximum-sum/

https://leetcode.cn/problems/design-circular-queue/description/

https://leetcode.cn/problems/basic-calculator/ 输入一个字符串，可以包含 + - * /、数字、括号以及空格，你的算法返回运算结果

给定一个 N x N 的二维数组，期望能找到一条波折路径，路径起点是能从任何一个位置开始，终点也可以是任何一个位置。每个位置只能访问一次，波折路径是指相邻元素严格交替增减。

https://leetcode.cn/problems/remove-duplicates-from-sorted-array/?envType=study-plan-v2&envId=top-in

https://leetcode.cn/problems/partition-list/description/?envType=study-plan-v2&envId=top-interview-1

https://leetcode.cn/problems/rotate-list/description/?envType=study-plan-v2&envId=top-interview-150

https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/description/?envType=study-plan-v

https://link.juejin.cn/?target=https%3A%2F%2Fleetcode.cn%2Fproblems%2Fmerge-two-sorted-lists%2F%3Fen

https://leetcode.cn/problems/permutation-in-string/description/

zoom coding interview zoom coding interview zoom coding interview

https://leetcode.cn/problems/maximum-length-of-repeated-subarray/description/