Leetcode Classification
Shanghai, ChinaSort
- 56. Merge Intervals
- 75. Sort Colors
- 147. Insertion Sort List
- 148. Sort List
- 242. Valid Anagram
- 274. H-Index
- 324. Wiggle Sort II
- 349. Intersection of Two Arrays
- 350. Intersection of Two Arrays II
Array
- 1. Two Sum
- 4. Median of Two Sorted Arrays
- 11. Container With Most Water
- 15. 3Sum
- 16. 2Sum Cloest
- 26. Remove Duplicates from Sorted Array
- 27. Remove Element
- 39. Combination Sum
- 40. Combination Sum II
- 53. Maximum Subarray
- 56. Merge Intervals
- 62. Unique Paths
- 63. Unique Paths II
- 64. Minimum Path Sum
- 73. Set Matrix Zeroes
- 75. Sort Colors
- 79. Word Search
- 121. Best Time to Buy and Sell Stock
- 122. Best Time to Buy and Sell Stock II
- 123. *** Best Time to Buy and Sell Stock III
- 152. Maximum Product Subarray
- 169. Majority Element
- 216. Combination Sum III
- 217. Contains Duplicate
- 219. Contains Duplicate II
- 283. Move Zeroes
Dynamic Programming
- 32. Longest Valid Parentheses
- 53. Maximum Subarray
- 62. Unique Paths
- 63. Unique Paths II
- 64. Minimum Path Sum
- ***
- 70. Climbing Stairs
- 91. Decode Ways
- 121. Best Time to Buy and Sell Stock
- 152. Maximum Product Subarray
- 198. House Robber
- 213. House Robber II
- 279. Perfect Squares
- 303. Range Sum Query - Immutable
- 322. Coin Change
- 338. Counting Bits
Divide and Conquer
- 4. Median of Two Sorted Arrays
- 23. Merge k Sorted Lists
- 53. Maximum Subarray
- 169. Majority Element
Recursion
- 46. Permutations
Backtracking
- 17. Letter Combinations of a Phone Number
- 22. Generate Parentheses
- 39. Combination Sum
- 40. Combination Sum II
- 60. Permutation Sequence
- 79. Word Search
- 216. Combination Sum III
Binary Search
- 4. Median of Two Sorted Arrays
- 275. H-Index II
- 349. Intersection of Two Arrays
- 350. Intersection of Two Arrays II
Hash
- 1. Two Sum
- 3. Longest Substring Without Repeating Characters
- 136. Single Number
- 217. Contains Duplicate
- 219. Contains Duplicate II
- 242. Valid Anagram
- 274. H-Index
- 347. Top K Frequent Elements
- 349. Intersection of Two Arrays
Bit Manipulation
- 136. Single Number
- 169. Majority Element
- 338. Counting Bits
Two Points
- 3. Longest Substring Without Repeating Characters
- 11. Container With Most Water
- 15. 3Sum
- 16. 3Sum Cloest
- 19. Remove Nth Node from End of List
- 26. Remove Duplicates from Sorted Array
- 27. Remove Element
- 28. Implement strStr()
- 75. Sort Colors
- 283. Move Zeroes
- 349. Intersection of Two Arrays
- 350. Intersection of Two Arrays II
Tree
- 100. Same Tree
- 104. Maximum Depth of Binary Tree
- 226. Invert Binary Tree
- 235. Lowest Common Ancestor of a Binary Search Tree
- 236. Lowest Common Ancestor of a Binary Tree
- 337. House Robber III
Stack & Heap & Queue
- 20. Valid Parentheses
- 155. Min Stack
- 331. Verify Preorder Serialization of a Binary Tree
- 347. Top k Frequent Elements
- 23. Merge k Sorted Lists
String
public class Teisei {
public static void main(String args[]){
System.out.println("Hello world! This is Teisei's blog");
}
}If you like this post or if you use one of the Open Source projects I maintain, say hello by email. There is also my Amazon Wish List. Thank you ♥
Comments