DSA-Questions icon indicating copy to clipboard operation
DSA-Questions copied to clipboard

very-important-problem-on-manhatten-distance

Open navjotdadwal opened this issue 4 years ago • 3 comments

There are N points on the 2D plane, i-th of which is located on (xi,yi)(xi,yi). There can be multiple points that share the same coordinate. What is the maximum possible Manhattan distance between two distinct points? Here, the Manhattan distance between two points (xi,yi)(xi,yi) and (xj,yj)(xj,yj) is defined by |xi−xj|+|yi−yj||xi−xj|+|yi−yj|.

navjotdadwal avatar Sep 30 '21 17:09 navjotdadwal

sir this is a standard problem related to manhatten distance please assign this tags of hacktoberfest as i can very clearly explain the problem and provide the code. Why you should assign this to me? I am rated 5 star at codechef with rating of 2153 and rated expert at codeforces with rating of 1776 and i use cpp language for competitive programming and can resolve this issue. following are my accounts: https://codeforces.com/profile/navjotdadwal https://www.codechef.com/users/navjot1234

navjotdadwal avatar Sep 30 '21 17:09 navjotdadwal

@navjotdadwal Awesome , go ahead :)

avinash201199 avatar Sep 30 '21 18:09 avinash201199

Ok sir

navjotdadwal avatar Oct 01 '21 00:10 navjotdadwal