Ok, maybe not development since we’re just talking about HTML, but that is not an excuse to not take advantage of the many tools we have at our disposal.
In this post, I’ll walk you through my process of setting up an HTML project with automated builds, SASS compilation, image minification and automatic browser reloads.
Continuing the algorithm practice saga, I bumped into an exercise that illustrates the "brute force/ideal/best" scenarios when solving algorithm exercises. As we know, there are not only multiple ways to reach an answer, but just because our answers work it doesn’t mean they’re optimal.
In my previous post, I explained how to solve an algorithm exercise and analyzed its big O efficiency. However, someone pointed out to me that the post assumes the reader is familiar with big O notation to begin with, and that I should at least clarify how it works.
I ‘ve been working on my algorithm skills and recently came upon an excercise that while simple, proved to be both amusing and deceptively challenging. We are given an array comprised of n arrays. Each array, in turn, is also n in length:
As much as we love CSS, there are times in which we can’t be bothered to design the complete look and feel of our site. We just want to churn out, but in our rush, we often neglect our styles.
In a previous post, I talked about Bulma and how easy it makes developing a good looking app. This time I want to tell you about the framework that started it all.
