HTML-код
- Опубликовано: 11 сен 2024
- 🚀 Solving Geeks for Geeks Problem of the Day(POTD) in C++ | Maximize Array Value After Rearrangement | Intuition Explained🧠
Problem Statement : www.geeksforge...
Solution Code : github.com/Mas...
----------------------------------------------------------------------------------------------------------
Linked List: • Linked List | Scratch ...
Binary Tree: • Binary Trees | Scratch...
----------------------------------------------------------------------------------------------------------
🌐 Connect with Me:
GitHub: github.com/Mas...
Instagram: www.instagram....
Linkedin: www.linkedin.com/in/yugayu-garg-47a001225
💬 Have questions or suggestions? Drop them in the comments below! Let's learn and grow together. Happy coding! 👨💻
#GFG #POTD #geeksforgeeks #problemoftheday #c++
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
In mod value ig one zero is less
@@maskedcoder-dy1ub tq so muchhhh .. it was a silly mistakee
can you made a separate video for this type of competitive programming concept ( like 1LL , 1e9+7 , ......)
Alright will try in near future
i have a doubt why have you used 1LL?
To convert right hand side into long long to avoid overflowing
@@maskedcoder-dy1ub can you made a separate video for this type of competitive programming concept
yeah i also felt that plz make a seprate video.