Mar 22 · 8 min read · This is Part 2 of a four-part series, "The Specification as Quality Gate." Part 1 developed the correlated error hypothesis. This post grounds the specification-first argument in complexity science. Parts 3 and 4 will follow. Ask an engineering team ...
Join discussionJan 29 · 8 min read · Algorythms, data structures and maths. Those are the three legs of the tripod that holds programming. Today, let’s focus on data structures. You know how each one has it strengths and weakneses, each one has it’s own use cases. A “perfect” data struc...
Join discussion
Jan 19 · 2 min read · DSA - Data Structures and Algorithms Data Structures - The way we store data while building software Why is it important - While building the software we need to use the correct structures to store the data because meaning structures will saves the s...
Join discussionDec 16, 2025 · 8 min read · Stop Designing Starbucks APIs: Defaults, Options & Complexity I was re-reading John Ousterhout’s A Philosophy of Software Design recently. There’s a definition that's been resonating in my head for a few years now: “Complexity is anything related to...
Join discussionSep 10, 2025 · 4 min read · Shiksha, Deepak, and Sagar solved a coding assignment. Each used a different approach, and then Shiksha asked: Shiksha: “We solved the same problem in three different ways, but which one is the best?” Deepak: “Which one will be faster?” Sagar: “Faste...
Join discussion
Sep 6, 2025 · 4 min read · Wprowadzenie Pakiet System.IO dla .NET znacznie uproszcza zarządzanie plikami. Przykładowo, pozwala kopiować je jedną linijką kodu. Działa świetnie na lokalnym dysku. Niestety, gdy plik leży na zdalnym serwerze czy network share – proste API System.I...
Join discussion
Aug 26, 2025 · 5 min read · Entender la base de Logaritmo Antes de explicar el Big O notation es necesario explicar qué es un logaritmo. Un logaritmo es preguntar cuántas multiplicaciones del mismo número X son necesarias para llegar a un número Y. EJ: \(2^x= 8\)¿Cuántos 2 ten...
Join discussion
Aug 26, 2025 · 5 min read · Understanding the Base of a Logarithm Before explaining Big O notation, it's necessary to explain what a logarithm is. A logarithm asks how many multiplications of the same number X are needed to reach a number Y. Ex: \(2^x = 8\) How many 2s do I ne...
Join discussion
Aug 8, 2025 · 8 min read · Introduction: Ports at the Crossroads of Change Ports are becoming the battlefield of international business and security as well as the outposts of technology in an age of endless globalization and digital change. International cargo volumes, divers...
Join discussion
Aug 5, 2025 · 6 min read · In Part 1, we talked about loops, Big-O notation, and how to analyze the performance of basic code. Now, it’s time to talk about something that makes many DSA beginners sweat a little in their interviews, i.e., recursion. This is one of the favourite...
Join discussion
