id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

srp4379@lausd.net quiz2 > onesTensReversed
prev  |  next  |  chance

public boolean onesTensReversed(int[] nums). Given an array of integers in the range 0 to 99, return true if any two adjacent numbers (two numbers next to each other) have the digits in the ONES and TENS column SWAPPED. For the numbers 0-9, the digit in the TENS column is zero. Remember that N / 10 gives the digit in the TENS column and N % 10 gives the digit in the ONES column.


onesTensReversed([23, 32]) → true
onesTensReversed([12, 36, 21]) → false
onesTensReversed([1, 10]) → true

...Save, Compile, Run (ctrl-enter)

public boolean onesTensReversed(int[] nums) { }

Editor font size %:
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

Misc Code Practice

Difficulty: 105

Copyright Nick Parlante 2017 - privacy