This is the script that I have used to download the codechef problem statements. Each problem statement gets downloaded and is written in a text file. The file is named according to the code name ...

Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.