Minimum cost to reach the destination

[PrakharRathore123]

Issue Id you have worked upon -

376

Briefly explain your program logic -

1)Function to calculate minimum from 3 numbers 2)If given x and y coordinates are negative then return max number as the given number is negative. 3)If given x and y coordinates are zero 4)For given x and y coordinates calculate the minimum cost

Screenshots(Attach 2 screenshots of your own input and output) -

Attach here

Checklist:

Eg - If your code follow the below guidelines. Kindly change [] to [x]

All the conditions should be fulfilled for considering your code for merging -

• [x] I have mentioned the question as comment in my solution file.
  

• [x] My code follows the guidelines of this project.
  

• [x] I have performed a self-review of my own code.
  

• [x] I have commented my code.
  

• [x] My code gives the correct output.
  

• [x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
  

• [x] I affirm that I strictly follow contributing guidelines and code of conduct.

[PrakharRathore123]

@SarthakKeshari Kindly acknowledge this pull request.