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 vote105 views1 answer
How to print all package in java
Java
2 votes126 views2 answers
How to convert date to dd-mon-yyyy format in java
Java
-1 vote119 views1 answer
What is java steam
Java
0 vote96 views1 answer
Jackson deserialization fail-on-unknown-properties true
Java
0 vote159 views1 answer
UserRedirectRequiredException: A redirect is required to get the users approval spring boot 5 security
Java Spring
0 vote166 views1 answer
Sum of a list using for loop in dart
Java
2 votes107 views1 answer
Armstrong number in java
Java
1 vote111 views1 answer
Datatypes in arduino
Java
0 vote133 views1 answer
@interceptor not working java
Java
2 votes111 views10 answers
Javascript
Java