- No1 Two Sum
- No42 Trapping Rain Water
- No4 Median of Two Sorted Arrays
- No53 Maximum Subarray
- No238 Product of Array Except Self
- No56 Merge Intervals
- No121 Best Time to Buy and Sell Stock
- No560 Subarray Sum Equals K
- No15 3Sum
- No31 Next Permutation
- No11 Container With Most Water
- No1 Two Sum
- No3 Longest Substring Withoud Repeating Characters
- No953 Verifying an Alien Dictionary
- No560 Subarray Sum Equals K
- No692 Top K Frequent Words
- No76 Minimus Window Substring
- No85 Maximal Rectangle
- No380 Insert Delete GetRandom O(1)
- No49 Group Anagrams
- No981 Time Based Key-Value Store
- No138 Copy List with Random Pointer
- No706 Design HashMap
- No2 Add Two Numbers
- No206 Reverse Linked List
- No763 Partition Labels
- No76 Minimum Window Substring
- No88 Merge Sorted Array
- No5 Longest Palindromic Substring
- No322 Coin Change
- No22 Generate Parentheses
- No17 Letter Combinations of Phone Number
- No393 UTF-8 Validation
- No937 Reorder Data in Log Files
- No200 Number of Islands
- No1192 Critical Connections in a Network
- No994 Rotting Oranges
- No763 Partition Labels
- No692 Top K Frequent Words
- No819 Most Common Word
- No146 Least Recently Used (LRU) cache
- No1152 Analyze User Website Visit Pattern
- No23 Merge k Sorted Lists
- No588 Design In-Memory File System
- No472 Concatenated Words
//TODO
443 547 1163 1051 647 1041 54 83 189 289 322 387 532 643 746 780 796 1010 52 1086 870 209 78 70 76 724 Balanced Array 收费站 Petrol Cost New Channel Meandering Array
//TODO
//TODO
//TODO
//TODO
//TODO
- Bit Set + + +//
- Word Search + + + + word Search II
- Birthday +(count odd number in a list + + +)
- Prime and Composite + +// + 204 Count Primes
- chocolate jails。参考leetcode 198 house robber + + + maximum chocolate这道题一定要one pass, 边读边做,不要读完了存在数组里再做,这样会有test case过不去 (负数)
- intput n, output char[n][n] 'W''B'交错的array(易)+ + + + +
- Decode Ways(91+ 394) + + + + + + + + +
- mean and mode + + 找most freq number和平均数。
- print chessboard pattern (Queen Attack ++)+ + + queen attack, 给x1, y1, x2, y2 判断是否在一条线上(水平,竖直,对角线)
- Maximus Difference +
- read in array of numbers and determien array length + +
- rotate matrix (48)+ +
- 判断输出内有多少个数字 +
-
- Maximum Sum Circular Subarray (53)
- IPV4