Position: SDE 1 Backend\nYoE: 1 year 3 months\n\n**Maximum Diameter**\n\nYou are given a tree of `N+1` levels from `0` to `N`. There is only one node at the level 0 that is called as root. There is an array `CNT` of size `N` where `CNT[i]` denotes the number of nodes at ith level. You have to find the maximum diameter possible in such a tree.\n*Note:* Diameter is the number of edges in the longest path of the tree.\n\n**Input fomat:**\n* First line: `T` denoting the number of test cases\nFor each test case:\n\t* First line: Integer `N`\n\t* Second line: `N` space seperated integers\n\n**Output format:**\n* For every test case, print the value of the maximum diameter in a new line.\n\n**Constraints:**\n`1 <= T <= 100`\n`1 <= N <= 100`\n`1 <= CNT[i] <= 1000`\n\n**Sample input :**\n```\n1\n1\n3\n```\n\n**Sample output :**\n```\n2\n```

Position: SDE 1 Backend\nYoE: 1 year 3 months\n\nMaximum Diameter\n\nYou are given a tree of N+1 levels from 0 to N. There is only one node at the level 0 that 