Build software better, together

Here are 207 public repositories matching this topic...

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.

  • Updated Oct 31, 2019
  • C

This is our effort to collect the best implementations to tough algorithms. All codes are written in c++.

  • Updated Aug 7, 2024
  • C++

A library that allows you to easily create various styles of segmented views. Supports iOS, macOS and tvOS.

  • Updated Oct 27, 2022
  • Swift

An intrusive C++17 implementation of a Red-Black-Tree, a Weight Balanced Tree, a Dynamic Segment Tree and much more!

  • Updated Jun 5, 2023
  • C++

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 ...

  • Updated Feb 26, 2026
  • Java

This repo conatins the code of the problems practised by me on Codeforces,Codedchef,Leetcode,Geeks For Geeks

  • Updated Jul 19, 2022
  • C++
kodvent

Kotlin Multiplatform utility library with battle-tested, zero-dependency implementations of algorithms and data structures for competitive programming and Advent of Code 🎄🧑‍💻

  • Updated Mar 31, 2026
  • Kotlin

Improve this page

Add a description, image, and links to the segment-tree topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the segment-tree topic, visit your repo's landing page and select "manage topics."

Learn more