I wanna find out the length of shortes cycle in graph , one approach is just do brute force , but time complexity is N^{2} ,

Question : “https://www.e-olymp.com/en/contests/16924/problems/175331”

After solving above problem , I google but here what i found -

GFG article : “https://www.geeksforgeeks.org/shortest-cycle-in-an-undirected-unweighted-graph/”

My more optimised solution : “https://ideone.com/hjaBe1”

But as I said it is still N^{2} can we do something better , by using concept of LCA or something else ?