XML2 - Find the Maximum Depth Problem

This Python script is designed to parse an XML document and find the maximum depth of the XML tree. The depth of a node is the number of edges from the node to the tree's root node. A root node will have a depth of 0. The script uses the xml.etree.ElementTree module to parse the XML document and traverse the tree.

Secure your next interview 🎯

CodeRankGPT is a tool powered by GPT-4 that quietly assists you during your coding interview, providing the solutions you need.
In real-time and absolutely undetectable 🥷

Here is the XML2 - Find the Maximum Depth Problem HackerRank solution using CodeRankGPT:

The script works by defining a recursive function, 'depth', which takes an XML element and its current level as arguments. It then increments the level and updates the global 'maxdepth' variable if the current level is greater than the current 'maxdepth'. The function then calls itself for each child of the current element, effectively traversing the entire XML tree. The maximum depth of the tree is then printed to the console.


import xml.etree.ElementTree as etree

maxdepth = 0

def depth(elem, level):
    global maxdepth
    level = level + 1
    maxdepth = max(maxdepth, level)
    for child in elem:
        depth(child, level)

if __name__ == "__main__":
    n = int(input())
    xml = ""
    for i in range(n):
        xml = xml + input() + "\n"
    tree = etree.ElementTree(etree.fromstring(xml))
    depth(tree.getroot(), -1)
    print(maxdepth)

If you have a HackerRank coding test coming up, you can use CodeRankGPT to your advantage. It will assist you during your interview and help ensure you get the job.

AI is here now, and other candidates might be using it to get ahead and win the job. 🧐

Submission Successful

The form has been successfully submitted.

Built on Unicorn Platform