GFG Weekly Coding Contest - 105 Post Analysis | GeeksforGeeks Practice

Join us for a post-contest analysis with Siddharth Hazra, where we will be discussing the problems from the GFG Weekly Coding Contest - 105. In this session, Siddharth will be sharing his approach to solving problems and providing valuable insights on how to approach 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.
-----------------------------------------------------------------------------------------
🏆 Master Competitive Programming - Complete Beginner to Advanced: practice.geeksforgeeks.org/co...
💻 Participate in GFG Weekly Coding Contest : practice.geeksforgeeks.org/ev...
-----------------------------------------------------------------------------------------
Follow us and stay updated on everything happening in the world of geeks:
📱 Twitter- / geeksforgeeks
📝 LinkedIn- / geeksforgeeks
🌐 Facebook- / geeksforgeeks.org
📷 Instagram- geeks_for_g...
#GFGPractice #GeeksforGeeks #Weeklycodingcontest #CodingQuestions

[@arjavkanadia9730]

Aree Bhai, problem 1 mai diya hai ki geek aur geekina grid mai placed hai toh agar grid starts from 1 how can they be on 0th row or col. Otherwise, aisa do ki they can be placed anywhere.... 1000 cell grid se door rakh do fir to

[@amanpandey2714]

q-1>> Logical just block 4 walls near the two person it may be possible there are less than 4 walls (border cells) so check for minimum walls required to wall either of the two person if they are adjacent retun -1 or if at same position int solve(int n,int m,vectorv,vectors) { int x=v[0],y=v[1]; if(x==s[0] and y==s[1]) return -1; int ans=0; if(x-1>=1) { ans++; if(x-1==s[0] and y==s[1]) return -1; } if(y-1>=1) { ans++; if(x==s[0] and y-1==s[1]) return -1; } if(x+1

[@kartikeygupta3958]

GeeksForGeeks be like a school math teacher "Teacher method use nhi kiya toh marks nhi milega"

[@amanpandey2714]

w-2> dp[i][j] represnets if it is reachable or not by some combination int a and b represent the two colums from where if we start we can reach column [j] vectordp(n+1,vector(m)); for(int i=0;i

[@amanpandey2714]

q-3> Find MIn - and max su possible using DP for all integers bw min

[@sravansainath7980]

One of the worst post-contest discussion I have every seen, First Question... wtf there many wrong test cases in that , any one who have solved that must have hardcoded the test cases . when I tried to test it with 1 row and geek and geekina not placed to each other result should be 1 but it showing 2 .

[@rekhamishra2129]

Can we upsolve this problems Reply

[@nirmal_t_rathod]

TO SPOIL THE SEEMINGLY PERFECT FIRST QUESTION: there is an error in the code: if Geek and Geekina were to be placed in the same cell initially, the code would not return -1. Instead, it will calculate a value, which will be the minimum of the number of directions Geek or Geekina can move based on the grid and their location. Even the if condition within the safe condition does not catch this, as a new position is calculated before this. Need to place this condition before performing any operation :)

[@itspriyanka2755]

Explanations are really good but can you also do a code in Java language

[@nirmal_t_rathod]

Yours and GFG's both codes are wrong. the output for- 10 10 7 0 5 2 should be 3. (if the indexing starts from 0) OR it should be -1. (if indexing starts from 1, which is mentioned in the question itself) whereas Yours and GFG's is 1.