leetcode.com , algoexpert.io solutions in python and swift
-
Updated
Aug 18, 2022 - Python
leetcode.com , algoexpert.io solutions in python and swift
LeetCode solutions
Efficient string matching with regular expressions
Contains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.
Python package for lexicon; Trie and DAWG implementation.
extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.
PyPruningRadixTrie - Python version of super fast Radix trie for prefix search & auto-complete
RDT: Russian Distributional Thesaurus (Русский Дистрибутивный Тезаурус)
🚀 Extremely fast fuzzy matcher & spelling checker in Python!
⚡ Lightning fast URL routing in Python (radix-trie router)
An efficient data structure for fast string similarity searches
Build a trie-structured regular expression from a list of words
Text pattern search using marisa-trie
A Radix Tree based router for HTTP and other routing needs with support for middlewares and endpoints with a Cython boost
Competitive Programming Journey
python3 implementation of trees. Including AVL Tree, Interval Tree and More.
Repository for learning Data Structures and Algorithms in Python
Trie implementation for approximate string matching.
Add a description, image, and links to the trie topic page so that developers can more easily learn about it.
To associate your repository with the trie topic, visit your repo's landing page and select "manage topics."