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

0 vote163 views2 answers
How to shuffle string java
Java
0 vote185 views1 answer
Add view to relativelayout programmatically
Java
0 vote180 views1 answer
Spring mvc aop transaction management
Java
0 vote162 views1 answer
Processing - Save n number of frames
Java
3 votes161 views1 answer
Javafx center node in gridpane
Java
0 vote200 views1 answer
Failed to resolve org.junit.platform:junit-platform-launcher:1.7.0
Java
29 votes151 views3 answers
Array of char to string in java
Java
1 vote155 views3 answers
Statusbar text color android
Java
1 vote168 views1 answer
Unsupported Modules Detected
Java
0 vote207 views1 answer
Compare array with himself java
Java