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 -~----------~----~----~----~------~----~------~--~---
