Min Cost Climbing Stairs

[satyam878]

Issue Id you have worked upon -

408

Briefly explain your program logic -

just iterated over the loop and checked whether which one of the cost is minimum either i-1 or i-2 and adding it to sum accordingly then returning the answer accordingly

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

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.

[satyam878]

Kindly accept the pull request @SarthakKeshari