pais@kinetigram.com > A113_reverse3
prev  |  next  |  chance

APCS Array 1, Problem 13. Given an array of ints length 3, return a new array with the elements in reverse order, so {1, 2, 3} becomes {3, 2, 1}. A113_reverse3([1, 2, 3]) → [3, 2, 1] A113_reverse3([5, 11, 9]) → [9, 11, 5] A113_reverse3([7, 0, 0]) → [0, 0, 7] Go...Save, Compile, Run (ctrl-enter) public int[] A113_reverse3(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: 100

Copyright Nick Parlante 2017 - privacy