As input you will be given a ragged list of positive integers containing at least one integer at some level. For example:
You should output the depth of the least deep integer. For example if the input is just a list of integers, then the every integer is 1 level deep so the answer is 1. There may be a tie for the crown of least deep but it doesn't matter since we only need to output the depth not the least deep integer itself.
This is code-golf so answers will be scored in bytes with fewer bytes being the goal.
 -> 1 [[[]],] -> 4 [[[]],[]] -> 4 [[[]],] -> 2 [[,1,2,3,[4,5]]] -> 2 [,[[1,2,]],] -> 3 [[[]],] -> 2