LeetCode

Two Pointers

#	Title	Solution	Time	Space	Difficulty	Topics	Note
283	Move Zeros	JAVA	O(n)	O(1)	Easy	Array, Two Pointers
26	Remove Duplicates from Sorted Array	JAVA	O(n)	O(1)	Easy	Array, Two Pointers
27	Remove Element	JAVA	O(n)	O(1)	Easy	Array, Two Pointers
11	Container With Most Water	JAVA	O(n)	O(1)	Medium	Array, Two Pointers

Binary Tree

#	Title	Solution	Time	Space	Difficulty	Topics	Note
94	Binary Tree Inorder Traversal	JAVA	O(n)	O(n)	Medium	Hash Table, Stack, Tree
144	Binary Tree Preorder Traversal	JAVA	O(n)	O(n)	Medium	Hash Table, Stack, Tree

DFS

#	Title	Solution	Time	Space	Difficulty	Topics	Note
108	Convert Sorted Array to Binary Search Tree	JAVA	O(n)	O(n)	Medium	DFS, Tree

Dynamic Programming

#	Title	Solution	Time	Space	Difficulty	Topics	Note
70	Climbing Stairs	JAVA	O(n)	O(1)	Easy	Dynamic Programming
53	Maximum Subarray	JAVA	O(n)	O(1)	Easy	Dynamic Programming
152	Maximum Product Subarray	JAVA	O(n)	O(1)	Medium	Dynamic Programming
64	Minimum Path Sum	JAVA	O(m*n)	O(1)	Medium	Dynamic Programming
322	Coin Change	JAVA	O(S*n) S -> amount, n -> denomation count	O(S)	Medium	Dynamic Programming
32	Longest Valid Parentheses	JAVA	O(n)	O(n)	Hard	Dynamic Programming
44	Wildcard Matchiing	JAVA	O(mn)	O(mn)	Hard	Dynamic Programming

Trie

#	Title	Solution	Time	Space	Difficulty	Topics	Note
208	Implement Trie (Prefix Tree)	JAVA	O(m)	O(m) / O(n)	Medium	Trie