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 votes322 views5 answers
Declare variable java
Java
17 votes336 views2 answers
Java constructor
Java
0 vote319 views1 answer
Fhow to find location of java jdk
Java
0 vote317 views1 answer
Dynamic fib
Java
2 votes261 views1 answer
Java observable class
Java
-2 votes325 views2 answers
Https://www.roblox.com/home
Java
0 vote350 views1 answer
New date api in java 8
Java
0 vote327 views1 answer
How to add spaces before string in java
Java
0 vote316 views1 answer
Intent for youtube android stackoveroverflow
Java
0 vote318 views1 answer
How to handle exceptions thrown by application with another servlet?
Java