Data Structure

Given a non-empty binary tree, find the maximum path sum.

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizesthe sum of all numbers along its path.

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

Given an encoded string, return it's decoded string.