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

2 votes289 views2 answers
Check if java is installed windows
Java
0 vote277 views1 answer
Java heap retention in BodyContentImpl
Java
4 votes294 views3 answers
Repository query spring boot
Java
1 vote296 views1 answer
Converting excel to csv in java
Java
0 vote300 views1 answer
Java indexof nth occurrence
Java
0 vote285 views1 answer
How to add spaces before string in java
Java
0 vote304 views1 answer
Example of "this" : to invoke current class method
Java
10 votes306 views2 answers
Card view implement
Java
0 vote291 views1 answer
Youtube converter to mp3
Java
1 vote297 views2 answers
Java regex ip
Java