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 ...
SPOJ solutions (user: mahmud2690)
🏇 An algorithm library using java native interface
Advanced algorithm and data structure library in C++
Simple and high-performance data structures and algorithms library
A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
A red-black self-balancing interval tree
Efficient Prefix-Sum data structures in C++.
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
Add a description, image, and links to the segment-tree topic page so that developers can more easily learn about it.
To associate your repository with the segment-tree topic, visit your repo's landing page and select "manage topics."