avinash201199 / DSA-Questions

Collection of data structure and algorithms questions
https://www.instagram.com/lets__code/
MIT License
75 stars 170 forks source link

very-important-problem-on-manhatten-distance #103

Open navjotdadwal opened 3 years ago

navjotdadwal commented 3 years ago

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 commented 3 years ago

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

avinash201199 commented 3 years ago

@navjotdadwal Awesome , go ahead :)

navjotdadwal commented 3 years ago

Ok sir