# scores100 challenge

on
Hi,

I am working on below challenge

http://codingbat.com/prob/p179487

Pseudo Code:
1. loop through given array
2. find elemt a i position and i+1 position.
3. check their equality.
4. if equal return true
5. if not equal reurn false

I wrote my code as below
``````public boolean scores100(int[] scores) {

boolean result=true;
int len=scores.length;
for(int i=0;i<len-1;i++){
if(scores[i]!=100&&scores[i+1]!=100){
// i=i+1;
result=false;

return result;
}
}
return result;

}
``````

Expected      Run
scores100([1, 100, 100]) → true      true      OK
scores100([1, 100, 99, 100]) → false      true      X
scores100([100, 1, 100, 100]) → true      true      OK
scores100([100, 1, 100, 1]) → false      true      X
scores100([1, 2, 3, 4, 5]) → false      false      OK
scores100([1, 2, 100, 4, 5]) → false      false      OK
other tests
OK

I am not passing all tests

Comment
Watch Question

Do more with

EXPERT OFFICE® is a registered trademark of EXPERTS EXCHANGE®
Most Valuable Expert 2016
Commented:
Your pseudo code looks OK to me, your code doesn't match. Assume that there are no 2 scores of 100 next to each other, set your flag to true once you've found one.

Commented:
``````public boolean scores100(int[] scores) {

boolean result=false;
int len=scores.length;
for(int i=0;i<len-1;i++){
if(scores[i]==100&&scores[i+1]==100){
// i=i+1;
result=true;

return result;
}
}
return result;

}
//Your pseudo code looks OK to me, your code doesn't match. Assume that there
//are no 2 scores of 100 next to each other, set your flag to true once you've found one.
``````

above passes all tests.
any improvements?
IT Business Systems Analyst / Software Developer
Top Expert 2015
Commented:
Your logic is good, the only thing that I would do differently, is that I think it reads even more simple if you remove the local variables, ie...
``````public boolean scores100(int[] scores) {
for (int i = 0;i < scores.length - 1; i++) {
if (scores[i] == 100 && scores[i+1] == 100) {
return true;
}
}
return false;
}
``````

Do more with