Search results for #MathInCode
Just an update: Rediscovered Pascal’s Triangle today, and it’s mind blowing how a simple pattern hides so much depth.From binomial coefficients and much more. Next time you code it, try visualizing its connections to probability or recursion,pure magic #MathInCode #PascalTriangle
A Recurrence Relation defines each term of sequence via prior terms eg. T(n) = T(n-1) + n, T(0) = 1. Few ways to solve it : 1. Back substitution 2. Tree method 3. Master Theorem Cracking recurrences = unlocking algorithm complexity! #MathInCode #Algorithms #RecurrenceRelations
🚀 From 1 element → 1 row → full triangle! Pascal’s Triangle III builds all rows: row[j] = row[j-1] * (i-j+1) / j ⏱ O(N²) | 🗂 O(N²) #Day8 #100DaysOfCode #DSA #MathInCode #StriversSheet
🚀 Pascal’s Triangle II shortcut: Skip building the triangle — build just the row! row[0] = 1 row[i] = row[i-1] * (n-i+1) / i ⏱ O(n), 🗂 O(n) #Day7 #100DaysOfCode #DSA #MathInCode #StriversSheet
🚀 Pascal’s Triangle Hack: Instead of building the whole triangle… 1️⃣ Use nCr = n! / (r! * (n-r)!) 2️⃣ Pick smaller of r & n-r 3️⃣ Calculate iteratively → avoid overflow ⏱ O(r), 🗂 O(1) #Day6 #100DaysOfCode #DSA #MathInCode #StriversSheet
Sometimes revisiting old problems makes you realize how much you’ve grown 🚀 #LeetCode #JavaScript #CodingJourney #100DaysChallenge #MathInCode
Just published a breakdown on rendering LaTeX in React — no more math chaos in your UI 🧮✨ If you're building a slick frontend and want equations to look sharp, this blog's your toolkit. 🔗medium.com/@adwait.purao/… #ReactJS #LaTeX #FrontendDesign #DevTips #MathInCode
Day 112 of #GFG160 Today's challenge: 🧮 Sum of All Subarrays! Smartly calculating the total sum using contributions of each element 💡 No brute force – just pure math & optimization magic ✨ @geeksforgeeks #GFG160 #GeekStreak2025 #ArrayChallenge #Optimization #MathInCode 💻📊
🔸 Day 110 of #GFG160 Today's challenge: Count Coprime Pairs in an Array! Using number theory magic 🧮 — Möbius Function, Inclusion-Exclusion Principle, and GCD logic to count all coprime pairs efficiently! 💡 @geeksforgeeks #GFG160 #GeekStreak2025 #NumberTheory #MathInCode 💻🔢
Count Numbers Containing Specific Digits Start with the total number of n-digit numbers (9 × 10ⁿ⁻¹) ➖ Subtract those that completely avoid the digits in the set 🤔 Tweaked the math to account for 0 not being allowed in the first digit #LearnInPublic #MathInCode #100DaysOfCode
Never really got math in school 🤯 But seeing it broken down like this in code just clicks 💡 Way easier to visualise and actually interpret — maybe it’s just me? 😅 #JavaScript #LinearAlgebra #MathInCode #AI #LearningInPublic
Day 193 💻 🔢 Euclid’s Algorithm (GCD using recursion) ✅ Efficiently finds greatest common divisor using GCD(a, b) = GCD(b, a % b) One of the most powerful & ancient algorithms! #Java #EuclidsAlgorithm #GCD #MathInCode #200DaysOfCode
🚀 Day 332 of Code 🚀 Solved : ✅ 3443. Maximum Manhattan Distance After K Changes (POTD) #Day332 #LeetCode #DSA #ManhattanDistance #MathInCode #POTD #Greedy #Algorithm #ProblemSolving #100DaysOfCode
Monads follow 3 laws: Left Identity, Right Identity, and Associativity. These ensure consistent behavior when chaining operations. Sound math-y? It’s simpler in practice! 🔷 #MathInCode
🧮 Day 168 of #200DaysOfCode Solved LeetCode #2894: Divisible and Non-divisible Sums Difference using Java! 🔍➗ Clean math-based problem — focused on modulus, summation, and clear logic 💡 #Java #LeetCode #MathInCode #ProblemSolving #100DaysOfCode #CodingJourney
Day 38 of DSA Grind Went full math mode today—prime checks, GCDs, digit counts, palindromes, Armstrong flex, Euclid’s genius, reversed numbers, and cracked modulo logic. Even ran the Sieve of Eratosthenes like I was filtering primes for VIP access. 🧠➗ #DSA #LeetCode #MathInCode
@Sam_Witteveen @googleaistudio Then... MATH! 🤯 Okay, basic math (2+3 lol), but seeing code do something = mind-blown. Real-time guidance explained the "why," not just "how." #MathInCode #LearningMoment
🧮 Finding GCD of a List: from math import gcd nums = [24, 36, 48] result = reduce(gcd, nums) print(result) # Output: 12 💡 Combine reduce with pre-built functions for reusable, clean code. #PythonProgramming #MathInCode
DSA Today's focus was all about mathematical techniques in DSA: Prime Numbers Square Root of a Number (Newton-Raphson) Factors of a Number Properties of Modulo HCF (Euclid's Algorithm) LCM #DSAwithKunal #CodingJourney #MathInCode #commclassroom
Math in code often seems way easier than in realityfewer variables, more structure! But when you try to solve it in the real world, things get complicated fast. #MathInCode #RealWorld #TechVsReality #assignmenthelp Visit: abnerassignmenthelp.com for expert assignment help!
