Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Linear Seach
//created by Yeronazavr import java.util.*; import java.lang.*; class Rextester { public static void main(String args[]) {int count=0; int arr[]={10, 20, 80, 30, 60, 50, 110, 100, 110, 170}; for(int i=0;i<10;i++){ if(arr[i]==110 ){ count=count+arr[i]; System.out.println(i); } } if(count==0){System.out.println("Element x is not present in arr[]");} } }
run
|
edit
|
history
|
help
0
Question FizzBuzz
// Java Coding Challenge - 08: Reversing a Number using StringBuilder
// Java Coding Challenge - 09: Find out duplicate numbers using Array
Most Common Word
Happy Numbers in Java
Ip address
Compiler
Eckhart generator with real id
// Java Coding Challenge - 07: Print out Fibonacci number 0 - 1000
3b