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

14 votes273 views4 answers
Number to char java
Java
1 vote258 views1 answer
Rdd. map with condition
Java
0 vote269 views1 answer
Do switch statement always run default java
Java
1 vote262 views1 answer
How to write on top of equal sign in latex
Java
1 vote271 views1 answer
Java copy list
Java
-5 votes275 views1 answer
Android studio get time
Java
163 votes397 views6 answers
Arrays
Java
0 vote287 views1 answer
Document inserted succesfully but not present in the collection java
Java
0 vote270 views1 answer
Plug and chug
Java
0 vote283 views1 answer
How to divide coloumns in a text file into seperate arrays in java
Java