Skip to content
#

segment-tree

Star

Here are 25 public repositories matching this topic...

Language: Java
Filter by language
All 181 C++ 104 Java 25 Python 15 C 5 Go 5 Rust 4 TypeScript 3 JavaScript 2 Jupyter Notebook 2 Swift 2
Sort: Recently updated
Sort options
Most stars Fewest stars Most forks Fewest forks Recently updated Least recently updated

saurabh-maurya0 / Practise-DSA

Star 0

This repository is a comprehensive Java resource covering essential data structures and algorithms. It provides practical insights for developers to enhance proficiency, including solutions to product-based company interview questions, facilitating effective interview preparation.

hashing linked-list graph string backtracking overview binary-tree sorting-algorithms arrays heap dynamic-programming trees searching-algorithms greedy-algorithms segment-tree trie-data-structure time-add-space-complexity
  • Updated Mar 17, 2024
  • Java

saurabh-maurya1 / Practise-DSA-main

Star 0

This repository is a comprehensive Java resource covering essential data structures and algorithms. It provides practical insights for developers to enhance proficiency, including solutions to product-based company interview questions, facilitating effective interview preparation.

hashing graph string backtracking overview binary-tree sorting-algorithms arrays heap dynamic-programming trees searching-algorithms greedy-algorithms segment-tree linked- trie-data-structure time-and-space-complexity
  • Updated Mar 13, 2024
  • Java

khokan-gorain / Top-DSA-Interview-Questions

Star 3

Data Structures and Algorithms (DSA) are fundamental concepts in computer science that play a crucial role in problem-solving and software development. They provide the building blocks and efficient methods for organizing, storing, and manipulating data, as well as for solving computational problems.

hashing sorting linked-list stack queue graph strings recursion backtracking binary-search-tree binary-tree dynamic-programming arrray greedy-algorithms segment-tree heaps arraylist 2d-arrays tries divide-and-conquer
  • Updated Mar 7, 2024
  • Java

joney000 / Java-Competitive-Programming

Star 111

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

java hashing algorithms graph-algorithms concurrency competitive-programming data-structures binary-search-tree consistent-hashing time-complexity bfs binary-search segment-tree binary-indexted-tree two-pointers all-pairs-shortest-path matching-algorithm maximal-bipartite-matching lowest-common-ancestor
  • Updated Feb 20, 2024
  • Java

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