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 vote118 views1 answer
Java heap retention in BodyContentImpl
Java
0 vote121 views1 answer
Spinner android add underline like edittext
Java
1 vote128 views4 answers
Print the list in java
Java
0 vote122 views1 answer
How does plus works in Java
Java
2 votes109 views1 answer
Java 8 list stream delete by name
Java
1 vote124 views1 answer
How to restart activity in android
Java
20 votes117 views4 answers
Java get current directory
Java
0 vote144 views1 answer
Enum type spring boot entity
Java Spring
0 vote148 views1 answer
@interceptor not working java
Java
0 vote121 views1 answer
Multi dimensional array declaration in java
Java