John Jr

Disclaimer: Everything here is just my personal opinion, and this text does not reflect any opinion of my employer.

One of the most fundamental algorithms that appears in interviews at big tech companies is Binary Search.

In this post, I will explain in detail how I used the builder design pattern together with the bit mask field technique to reduce complexity.

In software development, organizing our codebase in a way that is easy to maintain is always a good practice, and this idea is not new.

In this post, I will present how I improved an ETL process to be more than 4x faster using the same resources.

The Global interpreter lock(GIL) is a mechanism in CPython implementation to ensure only one thread is running at a time.

Redis is an in-memory data structure store, very powerful, with an excellent abstraction via its API to manipulate its data structure.

I was verifying the performance of an endpoint in an API using framegraph when I noticed that checking if an object is in a set or a hash data structure was consuming a lot of time.

First things first, this is a classic book by Tom DeMarco and Timothy Lister that everyone working in the software industry must read.

When we study transactions in relational databases, one of the first things we learn are the guarantees that a transaction must provide.

The Quicksort algorithm was created by Tony Hoare in 1961 and it is a very powerful algorithm to sort an array in memory until today.

Disclaimer: Don’t read this review, go ahead and read the book, it will be much better for you.

Sometimes, when I execute the Chrome inside a docker container I receive the error below: selenium.common.exceptions.WebDriverException: Message: unknown error: Chrome failed to start: crashed It is caused because Chrome uses the /dev/shm to share memory…

I’m learning computer vision and I’m using the Opencv and Python to write algorithms in this field of computer science.

I wrote a list of operational research resource which contains many name of books, events, groups, solvers and teachers.

Callbacks in Cplex I used LazyConstraintCallback to implement a Branch and Cut algorithm with CPLEX, but when I implemented and run this algorithm, it was very slow if I compare it with its version that doesn’t use callbacks in Cplex.