Explore tweets tagged as #MathInCode
๐ 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
0
0
1
What? You have to know math coordinates to code? Ss starting to understand impt of #mathincode. @cospaces_edu
1
1
7
๐ 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
0
0
1
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
0
0
1
๐ 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
0
0
2
๐ย Day 332 of Codeย ๐. Solved :. โ
ย 3443. Maximum Manhattan Distance After K Changes (POTD). #Day332 #LeetCode #DSA #ManhattanDistance #MathInCode #POTD #Greedy #Algorithm #ProblemSolving #100DaysOfCode
0
0
1
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.
1
0
0
Transforming todayโs math class challenge into Python code ๐๐ โ a hands-on proof using the Pigeonhole Principle, now fully executable! ๐.#math #python #MathInCode #PigeonholePrinciple #Python #CodingChallenge #STEM #ProblemSolving #LearnToCode #MathProof #CodeSnippet
0
0
0
๐ธ 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 ๐ป๐ข
0
0
2
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 ๐ป๐
0
0
2
Day 25 of #100DaysOfCode: ๐ถ A symphony of joy and pain as I revisited each coding challenge. Pen and paper in hand, I danced with the difficulty, mastering xcor() and ycor(). Each line,a note in the beautiful music of my coding journey. ๐ #CodeRecap #NumberLineMagic #MathInCode
0
1
2
๐น Day 148: Java Learning Journey ๐.Solved LeetCode #790: Domino and Tromino Tiling ๐ฏ.Applied dynamic programming to solve tiling problems efficiently. Challenging but rewarding! ๐ช.#Java #LeetCode #DynamicProgramming #100DaysOfCode #CodingJourney #200DaysOfCode #MathInCode
0
0
3
๐งฎ 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
0
0
1
๐งฎ 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.
1
0
0
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. ๐ #ReactJS #LaTeX #FrontendDesign #DevTips #MathInCode.
0
0
1
๐ Day 156 of #365DaysOfCode! ๐. Explored:.1. All Divisors (.2. Count Primes (. Prime numbers are the building blocks of number theory. How do you approach prime-related problems? ๐ค. #Coding #PrimeNumbers #Prog #MathInCode #anime
0
0
4
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
0
0
0
๐ Day 155 of #365DaysOfCode! ๐. Explored:.1. Odd Occurrence Numbers (.2. Prime Factorization.(. How often do you revisit basic math in coding? ๐ค. #Coding #Programming #BitManipulation #MathInCode #TechJourney
0
0
4
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: for expert assignment help!
0
0
0