First Half 2019

Problem ID	Description	Code Link	Tag
515	Find Largest Value in Each Tree Row	cpp
54	Spiral Matrix Traversal	cpp
684	Redundant Connection	cpp	DFS
817	Linked List Components	cpp
347	Top K frequent element	cpp	Hash map
931	Minimum Falling Path Sum	cpp	Dynamic Programming
331	Verify Preorder Serialization of a Binary Tree	cpp	Queue
658	Find K Closest Elements	cpp	Search
494	Target Sum	cpp	DFS
809	Expressive Words	cpp	String
127	Word Ladder	cpp	String
1008	Construct Binary Search Tree from Preorder Traversal	cpp	DFS

Notes

Prob ID 1008