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 votes175 views2 answers
Java random
Java
0 vote203 views1 answer
Java map get if contains else 0
Java
3 votes204 views2 answers
Geting max value in priority queue java
Java
2 votes254 views1 answer
Spring mvc get all request parameters
Java Spring
0 vote248 views1 answer
What Is Spring Boot and What Are Its Main Features?
Java Spring
0 vote194 views1 answer
Bigint is built in object
Java
0 vote200 views1 answer
Shared preferences saved value unsaved in android
Java
0 vote219 views1 answer
Sealed class java codegrepper
Java
0 vote197 views1 answer
Fly dfguyghj: Javascript
Java
0 vote203 views1 answer
Java array sortieren
Java