maxProduct

Given a positive integer with at least 2 digits, find the largest product that can be made by multiplying two side-by-side digits. For example, maxProduct(3791) is 63 because 7*9 is larger than 3*7 or 9*1. maxProduct(3791) → 63 maxProduct(2105) → 2 maxProduct(34958) → 45 Go...Save, Compile, Run (ctrl-enter) int maxProduct(int num) { } Go Editor font size %:75100125150 Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Difficulty: 200

Copyright Nick Parlante 2017 - privacy