-
Updated
May 19, 2020 - Java
#
trie-data-structure
Here are 90 public repositories matching this topic...
Algorithm to find the longest matching prefix for a binary string using a binary trie
-
Updated
Dec 10, 2023 - Rust
Simple Trie Structure implementation in C++
-
Updated
Dec 30, 2023 - C++
Recursively implemented a Trie Data Structure to support various word manipulations including Autocomplete. A trie is a 26-ary tree where the root node represents an empty string “” and if the kth (k going from 0 to 25) subtree is not a null subtree, it represents a string that is the concatenation of the characters represented by the parent and…
-
Updated
Apr 29, 2021 - C++
Auto Completion using JS(Trie DS)
-
Updated
Jul 25, 2020 - JavaScript
Resolve a set of problems using appropriate design and most efficient algorithms
-
Updated
Dec 24, 2020 - Python
A Double-array trie structure
-
Updated
Dec 7, 2023 - TypeScript
This repository is a comprehensive Java resource covering essential data structures and algorithms. It provides practical insights for developers to enhance proficiency, including solutions to product-based company interview questions, facilitating effective interview preparation.
hashing
graph
string
backtracking
overview
binary-tree
sorting-algorithms
arrays
heap
dynamic-programming
trees
searching-algorithms
greedy-algorithms
segment-tree
linked-
trie-data-structure
time-and-space-complexity
-
Updated
Mar 13, 2024 - Java
Exploring how data is stored on Ethereum.
-
Updated
Dec 21, 2022 - JavaScript
🔍 A React app with blazing fast sub millisecond autocomplete suggestions using a weighted trie.
react
autocomplete
reactjs
trie
autocomplete-search
react-autocomplete
react-autosuggest
tries
trie-node
autocomplete-functionality
trie-tree
autocomplete-suggestions
trie-data-structure
-
Updated
Apr 25, 2023 - JavaScript
I created my own search bar with auto complete suggestion using trie data structure
-
Updated
Aug 5, 2023 - Python
基于Trie树和并行式优化的英文文本词频统计
-
Updated
May 1, 2024 - C++
Implementação da estrutura de dados árvore digital trie 🌳🌳.
-
Updated
Jun 21, 2018 - Java
A trie, also called digital tree or prefix tree, is a type of search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters. In order to access a key (to recover its value, change it, or remove it), the …
-
Updated
Dec 12, 2021 - C++
Leetcode solution
cplusplus
leetcode
cpp
graph
graph-algorithms
trie
python3
stl-containers
problem-solving
stl-vector
cpp-library
segment-tree
disjoint-sets
advanced-data-structures
disjoint-unions
stl-algorithms
kmp
trie-data-structure
-
Updated
Sep 25, 2021 - C++
Search Engine implemented using Splay Trees and Trie Data Structures in C Programming Language
-
Updated
Aug 11, 2023 - C
Solver for the word asssociation game ruzzle using Trie Data Structure and BFS algorithm in python
-
Updated
Feb 29, 2024 - Python
Algorithm and Data Structure Project (PoliMi, year 2022) - Wordle
-
Updated
Mar 2, 2024 - C
Contact management system
-
Updated
Jun 1, 2024 - Java
Here we have discussed various string algorithms, including the popular pattern matching algorithms like KMP, Z, Rabin Karp, etc as a part of Design and Analysis of Algorithms course under the guidance of Dr. Kapil Ahuja
string
matching
pattern-matching
kmp-algorithm
automaton
rabin-karp-algorithm
z-algorithm
trie-data-structure
bitap-algorithm
manacher-s-algorithm
-
Updated
Jun 3, 2020
Improve this page
Add a description, image, and links to the trie-data-structure topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the trie-data-structure topic, visit your repo's landing page and select "manage topics."