Episode Synopsis "Goldmine"
1. You are given a number n, representing the number of rows. 2. You are given a number m, representing the number of columns. 3. You are given n*m numbers, representing elements of 2d array a, which represents a gold mine. 4. You are standing in front of left wall and are supposed to dig to the right wall. You can start from any row in the left wall. 5. You are allowed to move 1 cell right-up (d1), 1 cell right (d2) or 1 cell right-down(d3). 6. Each cell has a value that is the amount of gold available in the cell. 7. You are required to identify the maximum amount of gold that can be dug out from the mine. Input Format A number n A number m e11 e12.. e21 e22.. .. n * m number of elements Output Format An integer representing Maximum gold available. Constraints 1 <= n <= 10^2 1 <= m <= 10^2 0 <= e1, e2, .. n * m elements <= 1000 Sample Input 6 6 0 1 4 2 8 2 4 3 6 5 0 4 1 2 4 1 4 6 2 0 7 3 2 2 3 1 5 9 2 4 2 7 0 8 5 1 Sample Output 33
Listen "Goldmine"
More episodes of the podcast algodextrous
- Maximum Sum Non Adjacent Elements
- Count A+B+C+ Subsequences
- Count Encodings
- Arrange Buildings
- Count Binary Strings
- Fractional Knapsack
- Unbounded Knapsack
- Introduction to Dynamic Programming and Greedy
- Zero One Knapsack
- Coin Change Permutations
- Coin Change Combination
- Target Sum Subsets - DP
- Goldmine
- Min Cost In Maze Traversal
- Climb Stairs With Minimum Moves
- Climb Stairs with Variable Jumps
- Climb Stairs
- Print permutations
- Print subsequence
- Print encoding
- Target sum subsets
- Flood fill
- Knight tour problem
- N queen problem
- Introduction to the series
- Algodextrous - what it is about?