Dominic Farolino

See https://www.hackerrank.com/challenges/largest-rectangle/problem

See: https://leetcode.com/problems/last-stone-weight/description/. It's a good problem about using a binary search tree / set, but also needing to keep track of occurrences/duplicates. You can use a `map` or a `multiset`...

See: https://leetcode.com/problems/diameter-of-binary-tree/description/. It's a good problem about selectively propagating information up a tree's suspended stack frames.

LC example of this is: https://leetcode.com/problems/middle-of-the-linked-list/description/ This is a basic and fundamental problem to solve when learning linked lists, so this could be added to the [linked list data structure...

Some cursory research shows that `std::multiset::find` returns an iterator to the lowest node matching the given key. For example, this means if a tree consists only of one node value,...

All binary search tree iterators support the increment and decrement operators (delegating to the tree's `inorder_successor` and `inorder_predecessor` methods, except for the iterator returned by `end()`. The `end()` iterator is...

TravisCI Valgrind Tests?

1

Look into running valgrind memory tests on travis for ease of PR.

See https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/

See https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/

See: https://leetcode.com/problems/group-anagrams/description/