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 vote184 views2 answers
Startactivity not working in android adapter
Java
0 vote177 views1 answer
Press enter in robot java
Java
0 vote194 views1 answer
Kotlin android intent pass data
Java
0 vote206 views1 answer
Short array in java
Java
10 votes150 views1 answer
How to get 2 decimal places in java
Java
0 vote175 views1 answer
Java.applet defines how many interfaces
Java
1 vote176 views1 answer
Run specific test case junit
Java
0 vote180 views2 answers
Localtime java
Java
-1 vote164 views1 answer
How are tectonic plates formed
Java
4 votes181 views3 answers
Repository query spring boot
Java