{"push_id":1540059573,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e780899e684ef070a97206d9f825500ba63bbf7c","before":"c86a268914ca94a234ea81a07459d447bc325c61","commits":[{"sha":"e780899e684ef070a97206d9f825500ba63bbf7c","author":{"name":"Shivam Chawla","email":"421e2bbe2c6a155ad8b6ed59cf320fc0482585fc@gmail.com"},"message":"Flipping the Matrix\n\nlogic is that using multiple rotations, you can bring any number into\nthe upper left quadrant.\nHence, for any position in the upper left quadrant (position [x][y],\nwhere x and y < n (not 2*n)), we can move numbers in any quadrant at the\nfollowing positions to [x][y]:\n[x][y] or // upper left quadrant [x][2*n-1-y] or // upper right quadrant\n[2*n-1-x][y], or // lower left quadrant [2*n-1-x][2*n-1-y] // lower\nright quadrant\nall you need to do then is, for every position (x and y) in the upper\nleft quadrant, we need to find the maximum of the four numbers at the\nabove positions, sum them and print the answer","distinct":true,"url":"https://api.github.com/repos/Shivam60/hackerrank-questions/commits/e780899e684ef070a97206d9f825500ba63bbf7c"}]}
{"actor":{"display_login":"Shivam60"}}