Fizzbuzz, Functional Style

Knowing and Doing: November 2025 Archives » cs.uni.edu | cs.uni.edu

28 de noviembre de 2025 · 1 min · 10 palabras · Nacho Cano

La teoría de juegos de cómo los algoritmos pueden hacer subir los precios

Estudios recientes revelan que incluso los algoritmos de fijación de precios más simples pueden encarecer las cosas. » César Tomé | culturacientifica.com

4 de noviembre de 2025 · 1 min · 22 palabras · Nacho Cano

Métodos de compresión: qué son y cómo funciona

Aquí podrás conocer todos los métodos de compresión que existen para reducir el tamaño de los archivos y datos » Isaac | profesionalreview.com

26 de diciembre de 2024 · 1 min · 23 palabras · Nacho Cano

Learn Data Structures and Algorithms in 48 Hours

In the realm of software development, mastering Data Structures and Algorithms could be a critical step towards securing your dream job. We just posted a course on the freeCodeCamp.org YouTube channel that will equip you with the knowledge to excel i… » freeCodeCamp.org | freecodecamp.org

20 de febrero de 2024 · 1 min · 45 palabras · Nacho Cano

The Avalanche Algorithm — How To Calculate the Maximum Possible Path in a Binary Tree

In this article we try to calculate the maximum possible path in a binary tree, describing a more efficient method than the brute force solution. » hackernoon.com | hackernoon.com

12 de febrero de 2024 · 1 min · 29 palabras · Nacho Cano

Data Structures Handbook – The Key to Scalable Software

If you’re regularly confronted by the complexity of modern data, you’re not alone. In our data-centric world, understanding data structures isn’t optional — it’s essential. Whether you’re a novice coder or an experienced developer, this handbook is … » freeCodeCamp.org | freecodecamp.org

23 de noviembre de 2023 · 1 min · 42 palabras · Nacho Cano

Binary Search – Algorithm and Time Complexity Explained

When working with arrays, you’ll often have to search through them to check if they contain a target element. You can always run a sequential search—scanning the array from the beginning to the end—on the array. But if the array is sorted, running th… » freeCodeCamp.org | freecodecamp.org

13 de julio de 2023 · 1 min · 48 palabras · Nacho Cano

Exploring Graph Traversal: From Breadth-First Search to Dijkstra's Algorithm

In this article, the breadth-first search algorithm is explained with examples and implementations, including how it can be modified to find the shortest paths. » hackernoon.com | hackernoon.com

14 de marzo de 2023 · 1 min · 28 palabras · Nacho Cano

Convert Sorted Array to Binary Search Tree

Using Kotlin at your technical interviews! » hackernoon.com | hackernoon.com

12 de febrero de 2023 · 1 min · 10 palabras · Nacho Cano

Big O Cheat Sheet – Time Complexity Chart

An algorithm is a set of well-defined instructions for solving a specific problem. You can solve these problems in various ways. This means that the method you use to arrive at the same solution may differ from mine, but we should both get the same r… » olawanletjoel | freecodecamp.org

7 de octubre de 2022 · 1 min · 50 palabras · Nacho Cano