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

6 votes243 views1 answer
Round off java 2 decimal places
Java
0 vote242 views1 answer
How to create sequential number variable in java
Java
15 votes250 views2 answers
Char.at java
Java
32 votes248 views2 answers
Check jdk version windows 10 cmd
Java
0 vote257 views1 answer
Show input dialog java
Java
0 vote259 views1 answer
Java webelement how to double click
Java
1 vote271 views2 answers
Java setinterval equivalent
Java
0 vote260 views1 answer
Hash tree in java
Java
0 vote268 views1 answer
Pvector maximum dimension
Java
0 vote256 views1 answer
Algorithms - decision
Java