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 vote175 views4 answers
For() in java
Java
1 vote165 views1 answer
Switch case java with char
Java
0 vote106 views1 answer
Android list index
Java
0 vote167 views1 answer
AccountDriver.java
Java
1 vote169 views2 answers
Android studio keep device awake
Java
0 vote144 views1 answer
Java insert char in string at index
Java
1 vote148 views3 answers
Get app version android
Java
1 vote146 views1 answer
Map.keyset in java
Java
3 votes179 views2 answers
Uninstall java ac
Java
0 vote157 views10 answers
Kjk;ok
Java