segment-tree

A collection of powerful data structures

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

Helps to build your solution faster during leetcode contest, without same old template writing.

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.

#DSA: LeetCode Challenges

This repository contains all the data structures and their application in Java.

CodeChef, CodeForces, Hakerrank solved problem solutions.

Solutions for LeetCode problems in java

Implement segment tree and its application like Lazy Propagation, Persistent Segment Tree, Min and Max query

#JavaDSA: Daily Coding Challenges

This is a JAVA APP named Segment Tree 🌳 Visualizer. This app shows the building visualization of Segment Tree thorugh animation for some added functions like Sum, Max, Min and Xor. I have also added query feature which accepts l and r integer values (indices between which query has to be processed (0 based index)) to show how query works

A collaborative repository containing implementations of classic data structures and algorithms. This project features solutions to DSA problems solved by myself and my friend, with implementations in both Java and C++. The repository covers various fundamental topics including arrays, linked lists, stacks, queues, trees, graphs, recursion, sorting

🚀 A collection of my LeetCode solutions, organized by topic and difficulty. Regularly updated with clean, optimized solutions and explanations to track my Data Structures & Algorithms journey.

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.

A generic implementation for Segment Trees

This library contains some of the Advanced Data Structures such as van Emde Boas trees, Suffix Trees, Fibonacci Heaps and other data structures

This repository is dedicated to mastering Java ☕ through solving coding challenges 🔍. It emphasizes Data Structures 📊 and Algorithms (DSA) to enhance problem-solving skills 🧩