1. Given a binary tree find longest path length starting anywhere where path values are strictly increasing
2. Given a matrix with values as row sorted but not column sorted, return the nth smallest element.

P.S heap solution not accepted for 2nd question

Good luck!!