Building off of Problem 3025, suppose that Link's rupee wallet will now provide a compact string with one letter designating each rupee he's picked up. Once again, the rupee denominations are (with abbreviating characters):
- Green (g) = 1
- Blue (b) = 5
- Yellow (y) = 10
- Red (r) = 20
- Purple (p) = 50
- Orange (o) = 100
- Silver (s) = 200
- Big green (G) = 50
- Big blue (B) = 100
- Big red (R) = 200
- Big gold (*) = 300
Note that the string will be case-sensitive. Write a function to return the total value of rupees that Link has accumulated provided the compact rupee string.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers77
Suggested Problems
-
2011 Solvers
-
Project Euler: Problem 5, Smallest multiple
1655 Solvers
-
272 Solvers
-
512 Solvers
-
Matrix with different incremental runs
585 Solvers
More from this Author139
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!