WierdX — Programming Reference Browse tutorials →
Developer reference · Practical tutorials · CS fundamentals

Clear answers for working developers

Practical tutorials, cheat-sheets, and deep dives on the CS concepts and tools that show up in real work every day.

Browse all tutorials →

Latest tutorials

  • Recursion Explained

    A recursive function calls itself to solve a smaller version of the same problem. Understanding base cases, the call stack, and when to use iteration instead makes recursion a tool rather than a mystery.

  • Clean Code: Naming Things Well

    Good names make code read like prose. Bad names force you to hold state in your head that the code should hold for you. Practical rules for naming variables, functions, and classes.

  • Debugging Techniques That Actually Work

    Most debugging time is lost to guessing. A few systematic techniques — binary search, rubber duck, git bisect, real debuggers — eliminate the guesswork and find bugs faster.

  • SQL Joins Explained

    INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL OUTER JOIN, and CROSS JOIN explained with real SQL examples. The mental model that makes it click: what happens when there's no match?

  • How HTTP Status Codes Work

    Status codes are how the server tells the client what happened to a request. Getting them right in your API is as important as the response body — maybe more so.

  • Regular Expressions Explained

    Regular expressions look cryptic until you understand the small grammar behind them. This guide breaks that grammar into pieces you can combine and reuse for real-world matching problems.

  • REST API Design Principles

    REST isn't a specification — it's a set of architectural constraints. Understanding those constraints helps you build APIs that are intuitive, consistent, and easy to evolve over time.

  • Git Branching Basics

    Branches are how you work on something without breaking what already works. Understanding how Git tracks them — and when to merge versus rebase — is a foundation skill for any developer.

  • Understanding Big-O Notation

    Big-O notation describes how an algorithm's cost scales with input size. Once you can read it fluently, you can compare implementations without running them — and spot the O(n^2) trap before it hits production.