yes calculation is fully correct
First she has taken 21 square.
then taken 3 square of diagonal √2 , as each 2 diagonal gives 4 triangles. and each triangle one side must be 1 cm
then taken √2/2 , which is half of diagonal. So, gives 2 triangle as output.
It will give maximum number of triangles
But bro a solution means one solution
and a solution doesnot mean many solution
yes bro, but could u give me a reference where it is saying BFS traversal is false due to conflict?
I donot think conflict makes one BFS traversal true another false.
here so many conflict, but that doesnot make any BFS traversal false
S1: if each edge increased by 1, then why there will be any change in shortest path?
ST2: if I think about almost skewed tree , where a middle node has a branch. Height may be O(N)