The Hypocrisy of 'No Math Needed' in Programming

Description

A screenshot of a tweet from the user 'Coding Drag Queen Anna Lytical' (@theannalytical) on a dark mode interface. The tweet reads: 'People will say you don't need math to be a programmer and then ask you to find the algorithmic complexity of a recursive function in an interview.' The user's profile picture features a person with styled hair and makeup, wearing glasses. This meme points out a significant contradiction in the tech industry. While it's often said that advanced math isn't necessary for most day-to-day programming jobs, the technical interview process frequently relies on computer science theory, such as Big O notation and analyzing recursive algorithms, which are fundamentally mathematical. This creates a frustrating gatekeeping scenario where the skills required to pass the interview differ from the skills used on the job, a sentiment that deeply resonates with experienced developers who have navigated this disconnect throughout their careers

Common Tags

BigONotation AlgorithmComplexityAnalysis Interview TechnicalInterviewProcess TechnicalInterviews CSFundamentals

Comments

Anonymous ★ Top Pick Sure, you don't need math to be a programmer, until the interview requires you to derive the Master Theorem on a whiteboard to prove you're qualified to update a legacy jQuery plugin

Anonymous ★ Top Pick

Sure, you don't need math to be a programmer, until the interview requires you to derive the Master Theorem on a whiteboard to prove you're qualified to update a legacy jQuery plugin
Anonymous

After two decades scaling microservices, the only exponential I still see is the interviewer’s faith that knowing the Big-O of toy recursion predicts my ability to debug a 3 AM Kubernetes cascade
Anonymous

After 20 years, I've realized the only math that matters in production is calculating how many story points it takes to convince product that O(n!) is "basically the same" as O(n) for our use case
Anonymous

The tech industry's version of 'no experience required, must have 5 years experience' - where we tell juniors 'you don't need math, just learn to code!' then immediately hit them with 'So, what's the amortized time complexity of this recursive Fibonacci implementation, and can you prove it using the substitution method?' It's the bait-and-switch that keeps LeetCode Premium subscriptions thriving and impostor syndrome flourishing
Anonymous

“You don’t need math to code,” until the interview asks for Big‑O of T(n) and production asks for Big‑O of $. Master Theorem meets MasterCard when fan‑out + retries accidentally go exponential
Anonymous

Love when a panel grills you on T(n)=2T(n/2)+n, then ships an N+1 ORM query behind a GraphQL resolver chain and wonders why p95 latency spiked
Anonymous

No math needed - until they drop a recursive tree traversal and expect O(log n) analysis mid-meltdown
@lord_nani 5y

You need gender studies for sure
@waterpasta 5y

no cap
@metya 5y

but it is not a math
1. Deleted Account 5y
  
  just a simple chart
@metya 5y

so they're right
Kademlia 5y

Remember when basic coding was still sfw?
@Withouthatewithoutfear 5y

Lol recursivec functions avoid them they show code down It's only if the function is called over and over again it should call it's self. Otherwise stick to while loops
@mvolfik 5y

Lol i read it as meth and didn't even question it
Deleted Account 5y

i'll have you know that a full drag getup is an essential part of coding and forgoing it is illegal in over 289 countries