Preparing for coding interviews can be a real challenge with developers often spending several weeks reviewing and learning new material. The truth is, that most developers never quite feel fully ...

Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child ...

Though the problems number from 1 to 99, there are some gaps and some additions marked with letters. There are actually only 88 problems. There is no nested list type in OCaml, so we need to define ...