All Stories

Big O Notation and Analysis of Algorithms - coding interview

Big O Notation and Analysis of Algorithms - coding interview

Big O Notation is a mathematical notation that helps us analyze how complex an algorithm is in terms of time and space. When we build an application for one user...

Moises Gamio Moises Gamio
22 Jun 2020
SOLID principles: The Definitive Guide (Part I)

SOLID principles: The Definitive Guide (Part I)

SOLID principles tell you how to arrange your functions into classes and how those classes should be interrelated.

Moises Gamio Moises Gamio
15 Jun 2020
Graphs: Depth-First Search

Graphs: Depth-First Search

Depth-First Search (DFS), is an algorithm to search for information in Graphs.

Moises Gamio Moises Gamio
01 Jun 2020
Tree data structure: Binary Search Tree

Tree data structure: Binary Search Tree

Tree data structures are non-linear data structures, and they allow us to implement algorithms much faster than when using linear data structures.

Moises Gamio Moises Gamio
12 May 2020
Combinational Optimization Problem

Combinational Optimization Problem

The Knapsack problem is a classic optimization problem in computer science and mathematics. It belongs to a class of problems known as combinatorial optimization problems. The basic idea of the...

Moises Gamio Moises Gamio
09 Apr 2020
Given N, find the smallest number with the same digits

Given N, find the smallest number with the same digits

Write a method that, given an original number N, returns the smallest number with the same number of digits.

Moises Gamio Moises Gamio
29 Jun 2019