leetcode-blind-75

	A	B	C
1	Sno	Title	Strategey
2		Array
3	1	Two Sum
4	2	Best Time to Buy and Sell Stock
5	3	Contains Duplicate
6	4	Product of Array Except Self
7	5	Maximum Subarray
8	6	Maximum Product Subarray
9	7	Find Minimum in Rotated Sorted Array
10	8	Search in Rotated Sorted Array
11	9	3 Sum
12	10	Container With Most Water
13
14		Binary
15	11	Sum of Two Integers
16	12	Number of 1 Bits
17	13	Counting Bits
18	14	Missing Number
19	15	Reverse Bits
20
21		Dynamic Programming
22	16	Climbing Stairs
23	17	Coin Change
24	18	Longest Increasing Subsequence
25	19	Longest Common Subsequence
26	20	Word Break Problem
27	21	Combination Sum
28	22	House Robber
29	23	House Robber II
30	24	Decode Ways
31	25	Unique Paths
32	26	Jump Game
33
34		Graph
35	27	Clone Graph
36	28	Course Schedule
37	29	Pacific Atlantic Water Flow
38	30	Number of Islands
39	31	Longest Consecutive Sequence
40	32	Alien Dictionary (Leetcode Premium)
41	33	Graph Valid Tree (Leetcode Premium)
42	34	Number of Connected Components in an Undirected Graph (Leetcode Premium)
43
44		Interval
45	35	Insert Interval
46	36	Merge Intervals
47	37	Non-overlapping Intervals
48	38	Meeting Rooms (Leetcode Premium)
49	39	Meeting Rooms II (Leetcode Premium)
50
51		Linked List
52	40	Reverse a Linked List
53	41	Detect Cycle in a Linked List
54	42	Merge Two Sorted Lists
55	43	Merge K Sorted Lists
56	44	Remove Nth Node From End Of List
57	45	Reorder List
58
59		Matrix
60	46	Set Matrix Zeroes
61	47	Spiral Matrix
62	48	Rotate Image
63	49	Word Search
64
65		String
66	50	Longest Substring Without Repeating Characters
67	51	Longest Repeating Character Replacement
68	52	Minimum Window Substring
69	53	Valid Anagram
70	54	Group Anagrams
71	55	Valid Parentheses
72	56	Valid Palindrome
73	57	Longest Palindromic Substring
74	58	Palindromic Substrings
75	59	Encode and Decode Strings (Leetcode Premium)
76
77		Tree
78	60	Maximum Depth of Binary Tree
79	61	Same Tree
80	62	Invert/Flip Binary Tree
81	63	Binary Tree Maximum Path Sum
82	64	Binary Tree Level Order Traversal
83	65	Serialize and Deserialize Binary Tree
84	66	Subtree of Another Tree
85	67	Construct Binary Tree from Preorder and Inorder Traversal
86	68	Validate Binary Search Tree
87	69	Kth Smallest Element in a BST
88	70	Lowest Common Ancestor of BST
89	71	Implement Trie (Prefix Tree)
90	72	Add and Search Word
91	73	Word Search II
92
93		Heap
94	74	Merge K Sorted Lists
95	75	Top K Frequent Elements
96	76	Find Median from Data Stream
97
98
99
100