How abdul-majid-khan/data-structures works
This is a personal Java collection of independent data-structure and algorithm practice solutions, not a single application with a shared user-to-result workflow. Each file exposes a solution for a particular problem or algorithm; the README describes the covered topics but no common runtime, shared storage, or orchestration. The graph groups solutions by their main algorithmic area. Source-index references show no imports or named links between these files, so no call or data-flow edges are supported.
Components 34
Graph algorithms
- Undirected shortest path
Returning_shortest_path_in_a_undirectedgraph.java - Bellman-Ford
bellmanford.java - Dijkstra
dijkstra _algorithm.java - Floyd-Warshall
floydwarshall.java - Kosaraju
kosaraju_algorithm.java - Minimum spanning tree
minimum_spanning_tree.java - Prim's algorithm
prims_algorithm.java - Grid shortest path
leetcode1091.java - Critical connections
leetcode1192.java - Enclosed land
leetcode1254.java - City threshold distance
leetcode1334.java - Minimum effort path
leetcode1631.java - Shortest-path counts
leetcode1976.java - Network delay
leetcode743.java - Rising water
leetcode778.java - Bounded-flight cost
leetcode787.java - Tree path queries
leetcode3559.java - Path existence queries
leetcode3534.java - Colored graph root
leetcode4085.java
String algorithms
- KMP matching
kmp.java - Maximum substrings
leetcode1520.java - Sortable integers
leetcode3886.java - Remove outer parentheses
leetcode1021.java - Parentheses split
leetcode1111.java - Parentheses insertions
leetcode1541.java - Generate parentheses
leetcode22.java - Longest valid parentheses
leetcode32.java - Remove invalid parentheses
leetcode301.java - Wildcard parentheses
leetcode678.java - Score parentheses
leetcode856.java - Parentheses additions
leetcode921.java
Array algorithms
- Distinct-count squares
leetcode2916.java - Nondecreasing subarrays
leetcode3420.java - Window operation costs
leetcode3505.java