排序map、pq、stack。固定 递归 贪心 开关 二分 滑动窗口（固递贪开二滑）

摘要： 【简历装逼篇】先标记名词，然后一个个搜：某某某+面试题。主要是问基础定义、优缺点。项目描述改改，加一些细节-再看看有啥不会的地方-搜一下-然后就背吧-自己也可以搞个水mock 【好好想想怎么说 才能多说】我觉得就这样吧，没啥好加的了。项目描述：不太一致，简历上的没说全。问了：别人在项目里做了什么，自 阅读全文

摘要： 【假设只有一周的复习时间，抱佛脚思路】我不得不说，算法题的内容真是太多了：浏览一遍都老费力了，宛如GRE。 数组、链表、字符串、q、stack、hash：有很多小技巧的题目，但是也懒得去看了。临时看看基本的一些翻转就行了 快速排序、n sum：都是固定的模板，临时看看就行了前向窗口：写了--设计数据 阅读全文

摘要： Implement the RandomizedSet class: bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, fal 阅读全文

摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Remov 阅读全文

摘要： Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k num 阅读全文

摘要： Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two 阅读全文

摘要： Given two 1d vectors, implement an iterator to return their elements alternately. Example: Input: v1 = [1,2] v2 = [3,4,5,6] Output: [1,3,2,4,5,6] Expl 阅读全文

摘要： Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation -- it e 阅读全文

摘要： Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer or a list -- wh 阅读全文

摘要： Given a nested list of integers, implement an iterator to flatten it. Each element is either an integer, or a list -- whose elements may also be integ 阅读全文