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

3 votes289 views3 answers
How to print each element of an arraylist on a new line in java
Java
-3 votes337 views4 answers
Enhanced for loops
Java
0 vote256 views1 answer
Convert subarray to list java
Java
1 vote267 views1 answer
New thrad java
Java
1 vote212 views1 answer
Read a file in java and store as integer array using buffered reader
Java
-1 vote265 views1 answer
Gson parse json
Java
0 vote249 views1 answer
Matrix multiplication javascrpt
Java
0 vote290 views1 answer
Spring boot bean configuration
Java Spring
0 vote286 views1 answer
Object to double java
Java
0 vote267 views2 answers
Connect 2 package in android
Java