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

摘要： Given a collection of numbers that might contain duplicates, return all possible unique permutations. Example: Input: [1,1,2] Output: [ [1,1,2], [1,2, 阅读全文

摘要： Given a collection of distinct integers, return all possible permutations. Example: Input: [1,2,3] Output: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1, 阅读全文

摘要： Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set). Note: The solution set must not conta 阅读全文

摘要： Given a set of distinct integers, nums, return all possible subsets (the power set). Note: The solution set must not contain duplicate subsets. Exampl 阅读全文

摘要： 202208面试常考 算法题lz自己遇到的高频题型有：LRU，超高频，lz后面真的是闭着眼睛能写出来的程度了DFS/BFS，最常见的算法，一定要掌握Union-Find，多次考到双指针/滑动窗口，套路就那么多，但是也很常见dp相关的题我没有刷非常多，但是常见的股票买卖问题这种一定要吃透，也是高频题型 阅读全文

摘要： Given a collection of numbers that might contain duplicates, return all possible unique permutations. Example: Input: [1,1,2] Output: [ [1,1,2], [1,2, 阅读全文

摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Input: S = "ADOB 阅读全文

摘要： Given a string s and a non-empty string p, find all the start indices of p's anagrams in s. Strings consists of lowercase English letters only and the 阅读全文

摘要： Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer 阅读全文

摘要： 687. Longest Univalue Path Easy 1566430Add to ListShare Given a binary tree, find the length of the longest path where each node in the path has the s 阅读全文