tlsmith2@wsfcs.k12.nc.us > almostTheSame
prev  |  next  |  chance

Given an array of numbers sorted in increasing order, return true if the array contains 3 adjacent numbers that differ from each other by at most 2, such as with {3, 4, 5} or {3, 5, 5}. almostTheSame([3, 4, 5]) → true almostTheSame([3, 4, 6]) → false almostTheSame([1, 3, 5, 5]) → true Go...Save, Compile, Run (ctrl-enter) public boolean almostTheSame(int[] scores) { } 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: 10 Post-solution available

Copyright Nick Parlante 2017 - privacy