tmhscs@gmail.com monroe > codies
prev  |  next  |  chance

figure out and code the algorithm used based on the examples given below codies([1, 2, 3, 4, 5, 6, 7]) → [2000, 5000, 8000, 8000, 11000, 14000, 14000] codies([8, 9, 10, 11, 12, 13]) → [16000, 19000, 22000, 22000, 25000, 28000] codies([50, 54, 57, 49, 23, 10]) → [100000, 109000, 116000, 98000, 47000, 22000] Go...Save, Compile, Run (ctrl-enter)Show Hint public int[] codies(int[] arr){ } 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)

Post-solution available

Copyright Nick Parlante 2017 - privacy