Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/sorcererchiragsingh/java-dsa
Uploading My Leetcode Answer's Over Here
https://github.com/sorcererchiragsingh/java-dsa
Last synced: about 1 month ago
JSON representation
Uploading My Leetcode Answer's Over Here
- Host: GitHub
- URL: https://github.com/sorcererchiragsingh/java-dsa
- Owner: SorcererChiragsingh
- Created: 2024-04-24T13:30:32.000Z (9 months ago)
- Default Branch: main
- Last Pushed: 2024-11-26T14:27:36.000Z (2 months ago)
- Last Synced: 2024-11-26T15:29:44.700Z (2 months ago)
- Language: Java
- Size: 158 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
DSA Solution's in Java
Solving DSA Question's From Leet code
LeetCode
Visualize Data structures
From these sites:-
1. Pathfinding Visualizer.
Pathfinding Visualizer
2. VisuAlgo.
VisuAlgo
3. Algorithm Visualizer.
Algorithm Visualizer
Excel Sheet's Which I am Currently Following👨💻
1. My Solution Tracker Excel Sheet.
Link For My Excel Sheet
2. Top Leetcode questions of All Time - Most Important.
Link For Top Leetcode questions of All Time Excel Sheet
3. Love Babbar Final 450 DSA Question.
Link For Love Babbar Final 450 DSA Question's Excel Sheet
4. Blind 75 "EXCEL SHEET"
Link For Blind 75 Excel Sheet
5. Apna College DSA "Excel Sheet".
Link For Apna College DSA Excel Sheet
Complete DSA Roadmap🔥
- Basic Data Structures
- Arrays
- Strings
- Linked Lists
- Stacks
- Queues
- Advanced Data Structures
- Trees
- Binary Trees
- Binary Search Trees
- AVL Trees
- B-Trees
- Graphs
- Graph Representation
- Adjacency Matrix
- Adjacency List
- Depth-First Search
- Breadth-First Search
- Shortest Path Algorithms
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- Minimum Spanning Tree
- Prim's Algorithm
- Kruskal's Algorithm
- Graph Representation
- Heaps
- Min Heap
- Max Heap
- Heap Sort
- Hash Tables
- Disjoint Set Union
- Trie
- Segment Tree
- Fenwick Tree
- Trees
- Algorithmic Paradigms
- Brute Force
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming
- Backtracking
- Sliding Window Technique
- Two Pointer Technique
- Divide and Conquer Optimization
- Merge Sort Tree
- Persistent Segment Tree
- Searching Algorithms
- Linear Search
- Binary Search
- Depth-First Search
- Breadth-First Search
- Sorting Algorithms
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Graph Algorithms
- Depth-First Search
- Breadth-First Search
- Topological Sort
- Strongly Connected Components
- Articulation Points and Bridges
- Dynamic Programming
- Introduction to DP
- Fibonacci Series using DP
- Longest Common Subsequence
- Longest Increasing Subsequence
- Knapsack Problem
- Matrix Chain Multiplication
- Dynamic Programming on Trees
- Mathematical and Bit Manipulation Algorithms
- Prime Numbers and Sieve of Eratosthenes
- Greatest Common Divisor
- Least Common Multiple
- Modular Arithmetic
- Bit Manipulation Tricks
- Advanced Topics
- Trie based Algorithms
- Auto completion
- Spell Checker
- Suffix Trees and Arrays
- Computational Geometry
- Number Theory
- Euler's Totient Function
- Mobius Function
- String Algorithms
- KMP Algorithm
- Rabin-Karp Algorithm
- Trie based Algorithms