#DSA: LeetCode Challenges
-
Updated
Sep 3, 2024 - Java
#DSA: LeetCode Challenges
#JavaDSA: Daily Coding Challenges
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.
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.
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.
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 ...
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
Семестровая работа ИТИС КФУ - Дерево Отрезков на Java
Solutions for LeetCode problems in java
Helps to build your solution faster during leetcode contest, without same old template writing.
Java implementation of basic and advanced data structures.
A collection of powerful data structures
Implement segment tree and its application like Lazy Propagation, Persistent Segment Tree, Min and Max query
Implementation of data structures and algorithms used in competitive programming.
A generic implementation for Segment Trees
GeeksForGeeks Solved Solutions
My solutions for Codeforces Round #672 (Div. 2)
手写 Java 版数据结构,包含数组、栈、队列、链表、二叉搜索树、集合、映射、优先队列、堆、线段树、字典树、并查集、AVL、红黑树、哈希表。
Various data structures for solving algorithmic problems.
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."