Skip to content

Add Bellman-Ford Algorithm, Related LeetCode Problems, and CRC Implementation in Java #161

@PThanushree

Description

@PThanushree

Issue Description:

I would like to contribute implementations of the Bellman-Ford algorithm in Java, along with related LeetCode problems and Cyclic Redundancy Check (CRC) code.

Proposed additions:

Bellman-Ford Algorithm (Java)
Single-source shortest path for graphs with negative weights.
Detects negative weight cycles.

Related LeetCode Problems:

LeetCode 743 – Network Delay Time
LeetCode 787 – Cheapest Flights Within K Stops

Implementation of standard CRC algorithm in java.

Benefits:

Provides reusable and well-documented Java implementations.
Helps learners understand Bellman-Ford and CRC algorithms.
Covers both standard algorithms and constrained/real-world applications.
@Nikhil-2002 Kindly assign this to me under Hactoberfest'25 by including all related tags.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions