Become a Fullstack JavaScript Developer, Part 4: The Frontend

August 17, 2019 • ☕️☕️ 9 min read

Frontend development has been flooded with insane amount of technologies! The big decision, then, is what to focus on. What are the critical skills you need to master, and what order should you tackle them

Protecting The First Website, Part 1: Common Threats

August 08, 2019 • ☕️ 2 min read

It's not a big deal if you're just running a static blog. But if you are planning to deploy a serious web app then you must know these common security threats before it's too late

Advanced Algorithms: Levenshtein Distance

August 02, 2019 • ☕️ 5 min read

The Levenshtein distance is a string metric for measuring the difference between two sequences.

Bull - Queue system for handling distributed jobs and messages in Node

July 26, 2019 • ☕️ 4 min read

Bull is the fastest, most reliable, Redis-based queue for Node. I have been using it for years to handle async jobs and schedule messages

Advanced Algorithms: Rabin–Karp

July 25, 2019 • ☕️ 3 min read

The Rabin–Karp algorithm seeks to speed up the testing of equality of the pattern to the substrings in the text by using a hash function.

Become a Fullstack JavaScript Developer, Part 3: The Backend

July 24, 2019 • ☕️☕️ 10 min read

These are my curated (not exhausted) list of must-know backend related knowledge and technologies which a fullstack Javascript developer should follow.

Advanced Algorithms: Topological Sorting

July 23, 2019 • ☕️ 2 min read

In the field of computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices

Advanced Algorithms: Floyd–Warshall

July 22, 2019 • ☕️ 3 min read

Floyd–Warshall is an algorithm for finding shortest paths in a weighted graph with positive or negative edge weights but with no negative cycles.

Lerna - the best tool to manage JavaScript monorepo

July 21, 2019 • ☕️ 3 min read

Lerna is a tool that optimizes the workflow around managing multi-package repositories with git and npm.

Advanced Data Structures: Bloom Filter

July 20, 2019 • ☕️ 4 min read

A bloom filter is a space-efficient probabilistic data structure designed to test whether an element is present in a set.