Leetcode

#	Title	Solution	Runtime
2	Add Two Numbers	C++	12 ms
4	Median of Two Sorted Arrays	C++	72 ms
33	Search in Rotated Sorted Array	Java	0 ms
74	Search a 2D Matrix	C++	0 ms
121	Best Time to Buy and Sell Stock	C++	N/A
123	Best Time to Buy and Sell Stock III	C++	120 ms
287	Find the Duplicate Number	C++	4 ms
686	Repeated String Match	C++	4 ms
1356	Sort Integers by The Number of 1 Bits	C++	8 ms

LeetCode Topics

Array

0001-two-sum
1396-count-servers-that-communicate
1458-max-dot-product-of-two-subsequences
1975-maximum-matrix-sum
3219-make-lexicographically-smallest-array-by-swapping-elements

Hash Table

0001-two-sum
0865-smallest-subtree-with-all-the-deepest-nodes

Depth-First Search

0820-find-eventual-safe-states
0865-smallest-subtree-with-all-the-deepest-nodes
1339-maximum-product-of-splitted-binary-tree
1396-count-servers-that-communicate

Breadth-First Search

0820-find-eventual-safe-states
0865-smallest-subtree-with-all-the-deepest-nodes
1396-count-servers-that-communicate

Union Find

1396-count-servers-that-communicate
3219-make-lexicographically-smallest-array-by-swapping-elements

Matrix

1396-count-servers-that-communicate
1975-maximum-matrix-sum

Counting

1396-count-servers-that-communicate

Graph

0820-find-eventual-safe-states

Topological Sort

0820-find-eventual-safe-states

Sorting

3219-make-lexicographically-smallest-array-by-swapping-elements

Greedy

1975-maximum-matrix-sum

Tree

0865-smallest-subtree-with-all-the-deepest-nodes
1339-maximum-product-of-splitted-binary-tree

Binary Tree

0865-smallest-subtree-with-all-the-deepest-nodes
1339-maximum-product-of-splitted-binary-tree

Dynamic Programming

1458-max-dot-product-of-two-subsequences