LeetCode Most in Java, partly in C and Ruby
Dynamic Programming
44. Wildcard Matching 63. Unique Paths II
64. Minimum Path Sum
72 Edit Distance hard
78. Subsets mid
87. Scramble String
89. Gray Code
90. Subsets II mid
91. Decode Ways
96. Unique Binary Search Trees mid
97. Interleaving String
115. Distinct Subsequences
120. Triangle mid
131. Palindrome Partitioning
132. Palindrome Partitioning II
139. Word Break mid
140. Word Break II hard
152. Maximum Product Subarray
174. Dungeon Game
188. Best Time to Buy and Sell Stock IV *
198. House Robber*
213. House Robber II
221. Maximal Square
264. Ugly Number II
216. Combination Sum III

Tree
314. Binary Tree Vertical Order Traversal. fb
235. Lowest Common Ancestor of a Binary Search Tree.fb 285. Inorder Successor in BST

BackTracking/DFS
46. Permutations
47. Permutations II
216. Combination Sum III
212. Word Search II
320. Generalized Abbreviation
[332. Reconstruct Itinerary] (https://leetcode.com/problems/reconstruct-itinerary/)

String
13. Roman to Integer
281 Zigzag Iterator

Queue/Stack
239. Sliding Window Maximum
388. Longest Absolute File Path

Array
54. Spiral Matrix
59. Spiral Matrix II

Segment Tree. see also here
308. Range Sum Query 2D - Mutable

Bit-Operation
318. Maximum Product of Word Lengths
393. UTF-8 Validation