CodeWithWho

It was clear that my article for this week was going to be about communication in a team. And then, like clockwork, my device went "hello... hello... hello?" mid-convo. If you know Nigeria, you know the network madness. But sometimes, it’s not the network—it’s your gear.

Why learn this? - No parentheses to mess up - Easy for computers to evaluate - Used in calculators, compilers, and even some programming languages Once you see it, you can't unsee it. RPN just clicks. Now go evaluate something backwards

The whole process in one sentence: Numbers go onto the stack. Operators pop two numbers off, do the math, and push the result back on. That's it. That's the entire algorithm. Simple enough to memorize. Powerful enough to build calculators and compilers.

@temivalentine_ No need to say "asking for me". Even if you said it's for someone else, Nigerians have normalised it as, it is for you. Yeah, I think inasmuch as we try to niche down, I don't think modelling deters web development that much So I would say bio it up.

if you're a tech person who also loves modelling.. do you put it in your bio or just let the content speak? asking for me 😭🥹

Why does this distinction matter? When someone says "binary tree is O(log n) for search," they're talking about the ADT (balanced case) When someone says "I used a struct with left/right pointers," they're talking about the implementation Same name. Two meanings.

ADT = blueprint 📐 Data Structure = actual building 🏠 ADT says: "A tree should let you insert and traverse." Data Structure says: "Here's the Node class with left/right pointers that does exactly that." One is a theory. One is practice.

Binary tree = two hats. One hat: Abstract Data Type (ADT) — the "what." Other hat: Data Structure — the "how." Same name. Different meaning depending on how you're talking about it. Let me explain.

Why does RPN work so well with a stack? Stack = pile of plates. Last on, first off. Numbers go on top. When an operator appears, you grab the top two plates, do the math, and put the result back. It's like the stack was made for this.

Reverse Polish Notation (RPN) is just math where the operator comes AFTER the numbers. Normal: 3 × 4 RPN: 3, 4, × No parentheses. No order confusion. Just numbers first, then the operation.

Linked List = treasure hunt 🔗 Each item points to the next. Start at the head, follow the trail. Good: - Easy to add/remove anywhere - Grows as you need Bad: - Finding item #100? Walk from start 😮‍💨 - Think: scavenger hunt — flexible but slow to find things. #LinkedList

@Samaytwt Python

in which language you wrote your first "hello world"?

ADT(Abstract Data Type) = what you can do, not how List ADT says: Add item Get item Remove item Count items Could be an array. Could be a linked list: same buttons, different engine. #CodingForBeginners #DataStructures #LearnToCode

Array = items in a row 📏 Good: Jump to any spot instantly Super fast to read Bad: Inserting? Everyone shifts over 😅 Fixed size (unless dynamic) Think: parking spots — numbered, easy to find, hard to squeeze in. #Arrays #ProgrammingBasics #CodeNewbie #TechLearning

Array = fast reads 📖 Linked List = fast writes ✍️ That's 90% of what you need to know. The rest? You'll learn when you need it. #KeepItSimple #CodingWisdom #DevLife #TechMadeSimple

@_devEmmy Oh wow didn’t know this Ese sir

@CodeWithWho Stop # in your post It tends reduce how far you post can be

Guten Morgen. Just before Guten Tag slept late, woke up late, like my brother @_devEmmy, code yesterday, but got straight into it with two interviews. Pray we all have a great day today. Prost!! #BuildInPublic #DevLife #Programming #SoftwareEngineering #Coding

O(1) space ≠ O(1) time When we reverse a linked list: 3-pointer variables only (prev, curr, next) Same 3 pointers, whether list has 10 nodes or 10M nodes Multiple traversals? Yes. Extra memory? No. Space complexity = how much additional memory grows with input? It doesn't.

Dynamic array = array that grows! 🚀 Python list, Java ArrayList, JavaScript [] Fast to read Appending is quick Grows automatically What most apps use. Simple. Works. No overthinking. #CodingLife #WebDev #Python #JavaScript #Java

Time: O(n) — multiple passes Space: O(1) — just a handful of pointers No arrays. No recursion. Just pointer gymnastics. #LinkedList #Algorithms #DataStructures #TechInterview #CodeNewbie

"Split, Reverse, Merge" — the classic O(1) space linked list reordering pattern 🔄 Why reverse the 2nd half? Because singly linked lists can't go backward. Reversing lets us traverse the tail sequence forward after transformation.