jebbert@volusia.k12.fl.us > bcd1reverse
prev  |  next  |  chance

Write a method that accepts an array of integers and returns the array in reverse order. You may NOT use any ArrayLists! bcd1reverse([5, 7, 12, 8]) → [8, 12, 7, 5] bcd1reverse([1, 3, 11, 20, 89]) → [89, 20, 11, 3, 1] bcd1reverse([51]) → [51] Go...Save, Compile, Run (ctrl-enter) public int[] bcd1reverse(int[] nums) { } 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: 250

Copyright Nick Parlante 2017 - privacy