GFG Weekly Coding Contest - 157 Post Analysis | GeeksforGeeks Practice
Vložit
- čas přidán 1. 06. 2024
- Join us for a post-contest analysis with Yash Dwivedi where we will be discussing the problems from the GFG Weekly Coding Contest - 157. In this session, Yash 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.
🏆 Register for the Upcoming GFG Weekly Coding Contest 157: practice.geeksforgeeks.org/co...
-----------------------------------------------------------------------------------------
📆 Solve PROBLEM OF THE DAY Daily: practice.geeksforgeeks.org/pr...
📖 Master Competitive Programming: practice.geeksforgeeks.org/co...
-----------------------------------------------------------------------------------------
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
#WeeklyCodingContest157 #YashDwiedi
ques 2 main why are we going from square root of l to square root of r? didn't understand
how can I practice question 3 type questions as I have lots of doubt in such questions
same problem 🥲
@@priyanshukansal6060 same here
didn't get the last code
calculating the hi
and why 10^5 didn't work
please check and explain...
weekly 158 kab ayga ?????????????
Why not traverse string from start?
Cuz we can't apply the count b
because, after putting bba in place of ab, you'll effectively shift a to the right, try with examples and you'll get it
guys i have a doubt can anyone solve ...for the second problem since ceil( root value )) is being taken here so lets suppose if the range is from 1 to 10 then suppose if l = root 2 then its 1.414 (2) and then lets suppose root 3 is 1.732 is also 2 now there will be double counts right ....(same 4 is counted twice) then for that particular case either we keep track of the above answers if it occurs again we can ignore that ... hope it makes sense ryt?
class Solution:
def countSuperPalindrome(self, l : int, r : int) -> int:
# code here
import math
x = math.floor(math.sqrt(l))
y = math.ceil(math.sqrt(r))
def checkPalin(r):
r=str(r)
return r==r[::-1]
c=0
for i in range(x,y+1):
if i*i>=l and i*i
Live editorials were good as we can ask questions and convey if we understood or not .
Could not understand 3rd and 4rth
which part the complete question or certain part of it ?