A collection of powerful data structures
-
Updated
Aug 12, 2022 - Java
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
This repo contains solutions to problem of data structures in c++
Python module (C extension and plain python) implementing Aho-Corasick algorithm
C++ implementation of a fast and memory efficient HAT-trie
Static memory-efficient Trie-like structures for Python based on marisa-trie C++ library.
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.
Project is in active development and has been moved to the EthereumJS VM monorepo.
Leetcode Solutions in Rust, Advent of Code Solutions in Rust and more
Go datastructures.
.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.
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."