PROBLEM LINK:
Author: Rahul Ojha
Tester Arkapravo Ghosh
Editorialist: Soham Chakrabarti
DIFFICULTY :
Cakewalk
PROBLEM EXPLANATION
Given an array of length N, Find Ai and Aj, where the elements are the minimum and maximum in the array respectively.
Editorialist’s SOLUTIONS:
Editorialist solution : Can be found here