A collection of powerful data structures

코딩테스트 대비 문제집(Baekjoon Online Judge)

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.

leetcode.com , algoexpert.io solutions in python and swift

Go efficient multilingual NLP and text segmentation; support English, Chinese, Japanese and others.

This repo contains solutions to problem of data structures in c++

敏感词查找,验证,过滤和替换 🤓 FindAll, Validate, Filter and Replace words.

Go datastructures.

Python module (C extension and plain python) implementing Aho-Corasick algorithm

C++ implementation of a fast and memory efficient HAT-trie

Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.

Project is in active development and has been moved to the EthereumJS VM monorepo.

Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.

Leetcode Solutions in Rust, Advent of Code Solutions in Rust and more

🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)

.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.

Data Structures implemented in Java

LeetCode solutions

Universal database layer for the client, server & mobile devices. It's like Lego for databases.