Given a vector of binary strings of size n. Tell the minimum operations you should perform so that a column has only 1s in it. \nIn one operation you can either shift the string to right or to left by 1 position.\n\nTestcase - \n```\nvector <string> bs = ["0101" , "1010" , "0100" , "0001"]\n```\nassume bs.size() as rows and bs[0].size() as columns.\nOutput - 3\nExplanation-\n0101 -> 1010 (shifted string 1 place clockwise)\n1010 -> 1010(no need to shift)\n0100 -> 0010(1 shift clockwise)\n0001 -> 0010 (1 shift anticlockwise)\n\nI couldn\'t solve it in the OA. Any help would be appreciated.

Given a vector of binary strings of size n. Tell the minimum operations you should perform so that a column has only 1s in it. \nIn one operation you can either