ninjaAndHisFriends.cpp created #131
Conversation
| @@ -0,0 +1,125 @@ | |||
| // Problem(3-D DP) : We are given an ‘N *M’ matrix.Every cell of the matrix has some chocolates on it, mat[i][j] gives us the | |||
| // number of chocolates.We have two friends ‘Alice’ and ‘Bob’.initially, Alice is standing on the cell(0, 0) and Bob is standing | |||
| // on the cell(0, M - 1).Both of them can move only to the cells below them in these three directions : to the bottom cell(↓), | |||
There was a problem hiding this comment.
Can we put the problem statement in one line? (instead of) multiple lines?
| | ||
| int maximumChocolates(int r, int c, vector<vector<int>> &grid) | ||
| { | ||
| vector<vector<vector<int>>> dp(r, vector<vector<int>>(c, vector<int>(c))); |
There was a problem hiding this comment.
Suggestion: Add inline comment for the code snippet.
codewithdev left a comment
codewithdev left a comment There was a problem hiding this comment.
Thanks, @thisabhijeet for your contribution 🎉 . I left a few comments for you to address before this PR gets merged.
| thanks a lot for reviewing this PR! changes have been made! |
| // from that cell with them. It can happen that they visit the same cell, in that case, the chocolates need to be considered only | ||
| // once. They cannot go out of the boundary of the given matrix, we need to return the maximum number of chocolates that Bob and | ||
| // Alice can together collect. | ||
| // Problem(3-D DP) : https://www.codingninjas.com/codestudio/problems/ninja-and-his-friends_3125885 |
There was a problem hiding this comment.
// Problem(3-D DP) :
// We are given an ‘N *M’ matrix.Every cell of the matrix has some chocolates on it, mat[i][j] gives us the number of chocolates.We have two friends ‘Alice’ and ‘Bob’.initially, Alice is standing on the cell(0, 0) and Bob is standing on the cell(0, M - 1).Both of them can move only to the cells below them in these three directions: to the bottom cell(↓), to the bottom-right cell(↘), or to the bottom-left cell(↙). // When Alica and Bob visit a cell, they take all the chocolates from that cell with them. It can happen that they visit the same cell, in that case, the chocolates need to be considered only once. They cannot go out of the boundary of the given matrix, we need to return the maximum number of chocolates that Bob and Alice can together collect.
2 participants
What's being changed:
ninjaAndHisFriends.cpp created
Checkoff the following: