#238 | Maximize Array Value After Rearrangement | gfg potd | 09-08-2024 | GFG Problem of The Day

preview_player
Показать описание
🚀 Solving Geeks for Geeks Problem of the Day(POTD) in C++ | Maximize Array Value After Rearrangement | Intuition Explained🧠

----------------------------------------------------------------------------------------------------------

----------------------------------------------------------------------------------------------------------

🌐 Connect with Me:

💬 Have questions or suggestions? Drop them in the comments below! Let's learn and grow together. Happy coding! 👨‍💻

#GFG #POTD #geeksforgeeks #problemoftheday #c++
Рекомендации по теме
Комментарии
Автор

can you made a separate video for this type of competitive programming concept ( like 1LL, 1e9+7,

rajanchauhan
Автор

pls could u help me in java code .. some test cases are failing ...
class Solution {

int Maximize(int arr[]) {
Arrays.sort(arr);
long ans=0;
for(int i=0;i<arr.length;i++){

ans+=(long)arr[i]*i;

}
return (int)ans;

}
}

crekso