Leetcode Biweekly Contest 98 | 2567: Minimum Score By Changing Two Elements Solution | Newton School

[@KaranMashru]

Subscribe for more such videos
Code :
class Solution {
public:

int minimizeSum(vector& nums) {
int n=nums.size(), ans=2000000000, i, j, s1, s2;
sort(nums.begin(), nums.end());
int b[n];

for(i=0; i

[@t.bmusic8957]

Outstanding Explanation sir.

[@harsh21012]

Awesome explanation as always