Problems - UM 2016 Practice Contest 2

Sep 23, 2016, 6:00 pm EDT - 8:00 pm

UM 2016 Practice Contest 2
1 - Maximal Rectangle
2 - Best Time for Stock -- Easy
3 - Best Time for Stock -- Hard
4 - Longest Increasing Subsequence -- Easy
5 - Longest Increasing Subsequence -- Hard
6 - Optimal Binary Search Tree -- Easy
7 - Optimal Binary Search Tree -- Hard

For your questions, comments, and issues,
please contact your host today at

anyujie@umich.edu