Given an array of point structure element whose X and Y values are both int, write a boolean function to decide whether there is any midpoint(at least 1) of any two points in the array whose X and Y coordinate value are all integer.
Anonymous
First discuss the n square naive algorithm and then the interviewer give me a hint on using pattern to solve the question (even odd pattern ). Then easy complete the question in O1
Check out your Company Bowl for anonymous work chats.