How to Calculate the Edit Distance in Python?

Motivation Type “helo world” into your Google search bar and Google will ask you: “Did you mean: hello world”. How is this done? A simple method to detect these typos is the Levenshtein distance (also called edit distance). In fact, Google’s algorithm seems to use some variant of it. (source) By studying this article, you’ll … Read more

Iterative vs. Recursive Binary Search Algorithms in Python

In this article, you’ll learn about a basic algorithm, every computer scientist must know: the binary search algorithm. I have drawn the code from my NoStarch programming introductory book Python One-Liners: Applications Binary Search The algorithm has important practical applications in many basic data structures such as sets, trees, dictionaries, bags, bag trees, bag dictionaries, … Read more

Python Nested Multiple Ternary Operators

In which order does the nested ternary operator evaluate its conditions? Short Answer: The nested ternary operator ‘1’ if x else ‘2’ if y else ‘3’ evaluates the condition from left to right, i.e., ‘1’ if x else (‘2’ if y else ‘3’). In short, first condition first! Problem Formulation Given a nested ternary operator … Read more

Bucle for en una línea en Python [Un tutorial sencillo]

Python es potente: puedes condensar muchos algoritmos en una sola línea de código. Así que surge la pregunta natural: ¿se puede escribir un bucle for en una sola línea de código? Este artículo explora con todo detalle esta cuestión fundamental. ¿Cómo escribir un bucle for en una sola línea de código Python? Hay dos formas … Read more

The Shortest Quicksort Algorithm in Python

Quicksort is not only a popular question in many code interviews – asked by Google, Facebook, and Amazon – but also a practical sorting algorithm that is fast, concise, and readable. Because of its beauty, you won’t find many introductions to algorithms that don’t discuss the Quicksort algorithm. In this one-liner tutorial, you’ll learn about … Read more

A Simple Python Factorial Program Using Recursion

This article explains a simple and effective way of computing the factorial in a single line of code. Problem Formulation & Motivation Consider the following problem: There are 20 football teams in England’s premier league. Each team can possibly reach any of the 20 ranks at the end of the season. Problem: How many possible … Read more

La forma más pitónica de comparar dos listas en Python

Problema: Se dan dos listas l1 y l2. Quieres realizar una de las siguientes acciones: 1. Comparación booleana: comparar las listas por elementos y devolver True si la métrica de comparación devuelve True para todos los pares de elementos y False en caso contrario. 2. Diferencia: encontrar la diferencia entre los elementos de la primera … Read more

Cómo convertir una lista de enteros en una lista de cadenas en Python

English version of article (English): https://blog.finxter.com/how-to-convert-an-integer-list-to-a-string-list-in-python/ La forma más pitónica de convertir una lista de enteros ints en una lista de cadenas es usar el código de una línea strings = [str(x) for x in ints]. Recorre todos los elementos de la lista ints y convierte cada elemento de la lista x en una cadena … Read more

How to Generate a Random Hex String in Python?

Today I will go over four methods to generate a random hex string in Python.  Firstly, from Python’s secrets module, we will use the function token_hex(n), where n specifies the number of bytes.  The resulting hex string will be of length n * 2.  Next, we will look at another function within the secrets module … Read more

Python Palindromes One-Liner

This one-liner introduces another basic computer science term: palindromes. Similar to anagrams, palindromes are a popular coding interview question. First things first: What is a Palindrome? “A palindrome is a word, number, phrase, or other sequence of characters which reads the same backward as forward, such as madam or racecar or the number 10201.“ [source] … Read more

Cómo convertir una lista de cadenas en una lista de números en coma flotante (flotantes) en Python

La forma más pitónica de convertir una lista de cadenas en una lista de flotantes es usar una comprensión de listas floats = [float(x) for x in strings]. Recorre todos los elementos de la lista y convierte cada elemento de la lista x en un flotante utilizando la función incorporada float(x). Este artículo muestra las … Read more

Python Anagrams in One Line Python

Why Learning about Python Anagrams? A popular question in programming interviews is to create an anagram checker. The interviewer wants to test your knowledge about the basic terminology in computer science, and how good you are at developing your own simple algorithms to solve the problems you are facing. In this article, you’ll learn about … Read more