Sibling search java program

  public int[] getSiblings(int[] arr, int x) {
    int pos = 0;
    for (int i = 0; i < arr.length; i++) {
      if(arr[i]==x) pos = i+1;
    }
    int start = Integer.highestOneBit(pos); // get max power of 2
    int end = start*2-1 >= arr.length ? arr.length: start*2-1;
    return IntStream.range(start-1, end).map(i -> arr[i]).filter(v -> v!=x).toArray();
  }

Source: stackoverflow.com

Similar codes

1 vote354 views1 answer
Error: cannot find [email protected](
Java
10 votes300 views2 answers
Replace a value in arraylist java
Java
0 vote381 views1 answer
Java how to create an array with existing objects
Java
0 vote360 views1 answer
Program Pr115_3; var k, n : integer; suma : real; begin readln(n); suma := 0; for k := 1 to n do suma := suma + 1 / sqr(2*k+1); writeln(suma); readln; end.
Java
0 vote345 views1 answer
Unhandled exception: java.lang.InterruptedException
Java
3 votes343 views1 answer
Set color of text for jlabel
Java
5 votes361 views2 answers
Write file from a specific location in java
Java
0 vote342 views1 answer
How to remove null values in java
Java
4 votes342 views3 answers
Java string from byte array
Java
2 votes400 views3 answers
Json data online test
Java