There are 1 repository under segment-tree topic.
A collection of powerful data structures
Competitive Programming templates that I used during the past few years.
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.
This is our effort to collect the best implementations to tough algorithms. All codes are written in c++.
A library that allows you to easily create various styles of segmented views. Supports iOS, macOS and tvOS.
An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!
I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, LCS, Segment Tree, Sparce Table, All Pair Shortest Path, Binary Search, Matching and many more ...
A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
A red-black self-balancing interval tree
Data structures & algorithms implementations in TypeScript
This repo conatins the code of the problems practised by me on Codeforces,Codedchef,Leetcode,Geeks For Geeks
My Leetcode Solutions
Competitive Programming Journey
Advance algorithm implementations
Data Structures and Algorithms
Implementations of Fundamental Algorithms & Data Structures in C++.
This repository contains algorithms. <3
C++ implementations of real time dynamic planar convex hull construction algorithms.
๐๐ฎ๐๐ฎ ๐ฆ๐๐ฟ๐๐ฐ๐๐๐ฟ๐ฒ๐ & ๐๐น๐ด๐ผ๐ฟ๐ถ๐๐ต๐บ๐ ๐ถ๐ป ๐/๐++ | ๐๐ฎ๐๐ โ ๐๐ฑ๐๐ฎ๐ป๐ฐ๐ฒ๐ฑ ๐๐ฒ๐๐ฒ๐น
Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.
A fast algorithm library for JavaScript/TypeScript.
This repository contains solutions of various classical problems on SPOJ.
Actively maintained on https://gitlab.com/mdds/mdds instead. This one is just a mirror.