Nikhil Patro

Intuitive solution for Pair sum to zero in language tools and time complexity module

1

/* Given a random integer array A of size N. Find and print the pair of elements in the array which sum to 0. Array A can contain duplicate elements....

Fixed failing testcase...optimised the code for 1<=N<=1000

1

/* Its Gary's birthday today and he has ordered his favourite square cake consisting of '0's and '1's . But Gary wants the biggest piece of '1's and no '0's...