GFG Weekly Coding Contest - 174 Post Analysis | GeeksforGeeks Practice

Join us for a post-contest analysis with Geetesh Yadav where we will discuss the problems from the GFG Weekly Coding Contest - 174. In this session, Geetesh will share his approach to solving problems and provide valuable insights on approaching similar problems in the future.
Whether you participated in the contest or not, this session is a great opportunity to learn new problem-solving techniques and deepen your understanding of data structures and algorithms. You'll have the chance to ask questions and interact with other participants, making this a fun and engaging learning experience.
🏆 Register for the Upcoming GFG Weekly Coding Contest 174: practice.geeks...
-----------------------------------------------------------------------------------------
📆 Solve PROBLEM OF THE DAY Daily: practice.geeks...
📖 Master Competitive Programming: practice.geeks...
-----------------------------------------------------------------------------------------
Follow us and stay updated on everything happening in the world of geeks:
📱 Twitter- / geeksforgeeks
📝 LinkedIn- / geeksforgeeks
🌐 Facebook- / geeksforgeeks.org
📷 Instagram- www.instagram....
#GFGPractice #GeeksforGeeks #WeeklyCodingContest #CodingQuestions
#WeeklyCodingContest174 #GeeteshYadav

[@dhananjoydey1337]

Really good editorial! Liked this type of explanation. No need to hurry and finish the video within 20 mintes.

[@ITACHIUCHIHA-dr8sz]

Come on gfg, due to weak tests O(n^3) where n = 1500 passes for problem 3, i dismissed that solution idea due to this during contest and went with a O(n ^ 2) hashing approach which tled due to high constant factor

[@keeplearning6770]

Why mod u have taken I didn't get it

[@devanshsinghla4677]

in 2nd question?

[@loveleshbhagat1114]

int longestSubarray(int n, vector &arr, int k) {
unordered_maprem;
int ans=0;
long long sum=0;
rem[0]=-1;
for(int i=0;i0 && arr[i-1]>arr[i]){
sum=0;
rem.clear();
rem[0]=i-1;
}
sum+=arr[i];
int r=sum%k;
if(rem.find(r)!=rem.end()){
ans=max(ans,i-rem[r]);
}else rem[r]=i;
}
return ans;
} 2nd Question

[@MelvilleAlbert-h2j]

Taylor Jennifer Martin Brenda Jones Nancy

[@tharunreddy7453]

explanation is very poor

[@subhamsaha3810]

Poor explanation

[@kodurisaivishnu4916]

bad explanation question 2 anyone suggest better video

[@AnandSharma-ei1fv]

very bad explaination of 2nd question ..