Find duplicates using Python

Originally published on Medium: https://dariodip.medium.com/find-duplicates-like-a-boss-f46422f54dd1 The exercise of finding duplicates in a list is a classical example of a didactic problem that you may find during your journey through learning algorithms. During this post, we will try solving this problem using different algorithms, showing the differences between each one. This article has been mainly written for fun and as a writing exercise. Its main purpose is to show different solutions to a single problem, explaining the reasoning behind certain decisions. ...

January 19, 2022 · 6 min · Dario Di Pasquale

Binary Search with Go, Python and C

The Binary Search Algorithm This page has been migrated to Medium The Binary Search Algorithm is a search algorithm that works for sorted collections (e.g. sorted arrays). It takes as input a collection, the length of that collection and an element to find, and gives as output the index of the element in the collection (if it exists). This algorithm is as efficient as easy to learn due to its simplicity. ...

December 1, 2019 · 3 min · Dario Di Pasquale