Post by shivam kumar
🎓CSE Undergrad @Graphic Era | AI ML | Problem Solver | Chasing Excellence
Ever seen a LeetCode problem where the entire solution is just return n;? 🤯 Today's LeetCode POTD (Problem of the Day) is a perfect example of why math is your best friend in competitive programming! Instead of writing loops to calculate sums and then finding the GCD, we can simplify this using basic algebra: The sum of the first n odd numbers is always n^2. The sum of the first n even numbers is always n(n+1). Now, we need to find GCD(n^2, n(n+1)). If we factor out the common n, we get: n. GCD(n, n+1) Here is the crucial math property: Consecutive integers are always coprime. This means their GCD is always 1! (For example, if n=5, the next number is 6. Their only common divisor is 1). So, the equation simplifies to: n .1 = n And just like that, a seemingly complex logic problem becomes a brilliant one-liner: return n;! #LeetCode #Coding #Programming #Mathematics #Algorithms #ProblemSolving #Tech #SoftwareEngineering
Video Content