1 or 2 depends if diagonal sqaure are considered to be same as adjacent
On Wed, Sep 2, 2009 at 8:28 PM, Nagendra Kumar <[email protected]>wrote: > > Can anyone recheck and rephrase the question becuase i think it would > be always '0' > > > On Wed, Sep 2, 2009 at 10:40 AM, Nayn<[email protected]> wrote: > > > > Guys, We are anticipating an algorithm here. > > > > The input would be an array containing 0/1 representing black and > > white boxes. > > > > On Sep 1, 8:37 pm, yash <[email protected]> wrote: > >> Given a chessboard in which u dont know how the black and white boxes > >> are arranged but this is sure that there will 32 black squares and 32 > >> white squares.You have to find the least possible disatnce between any > >> two sqaures of same colour ... > > > > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
