A collection of powerful data structures
-
Updated
Aug 12, 2022 - Java
A collection of powerful data structures
The Capsule Hash Trie Collections Library
PATRICIA, Double Array, LOUDS Trie implementations for Java
Data Structures implemented in Java
The jieba-analysis tool for java.(基于结巴分词词库实现的更加灵活优雅易用,高性能的 java 分词实现。支持词性标注。)
A collection of common algorithms and data structures implemented in Java.
A fast and space efficient Radix tree in Java
Java autocomplete library.
基于Netty4开发的简单、轻量级、高性能的的Http restful api server
Algorithmic Problems Solutions -- hash table code featured in geeksforgeeks
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.
Efficient Immutable/Persistent Collections for Java
some search common utils, such as segment,canal client and so on
Data Structures 👩💻 Domain on HackerRank - Problems & Solutions 📑📘
Set of Patterns to solve many algorithmic questions of similar type on LeetCode
A Java implementation of the Trie data structure
I've implemented a comprehensive set of generic data structures in Java, including arrays, linked lists, stacks, queues, trees, and more, ensuring versatility and efficiency in data handling.
DSA in Java covers a wide range of algorithms, including sorting algorithms, searching algorithms, graph algorithms, and dynamic programming algorithms. The implementation and optimization of these algorithms require a solid understanding of data structures, such as arrays, linked lists, trees, and graphs, and their associated operations.
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."