OpenGenus/cosmos

Add Code for No of ways to reach the end of maze(BackTracking)

Open

#49 opened on Oct 1, 2017

View on GitHubContributor guide
 (5 comments) (0 reactions) (0 assignees)C++ (3,724 forks)batch import
Hacktoberfestadd codenew algorithm

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

Solution to famous Rat in Maze Backtracking Problem

Contributor guide

Research direction
Implement the backtracking algorithm to count the number of ways to reach the end of the maze. Refer to existing solutions in the repository for format and style.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++GitBacktracking
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70