© 2023 Hashnode
#trie
The Longest Common Prefix problem is a classic challenge that has stumped many, but fear not: with the right approach, it can be conquered. In this article, we'll explore several methods for solving t…
Tech-letter #15 | March 28, 2023 Trie A Trie, also known as a Prefix Tree or a Radix Tree, is a tree-based data structure that is often used for efficient string searching and storage. It consists of a series of nodes that are connected …
Today we are going to make a C++ extension for Python code, wrap it and embed easily with Cython and then make it installable via Poetry. This article is a continuation of my previous article (you can…
Today we are going to implement a Trie optimized for T9 predictive text in Python. Let’s get right into it. The repository with the result can be found here. What is T9? Well, well, well, tell me who …
