Simple solution in 2 lines
InterviewBit Problems
Max Min : Solved
Kevlin
2020-08-11 23:08:59 UTC
#1
sort(A.begin() , A.end()) ; return A[0] + A[A.size() -1] ;