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 vote123 views1 answer
What's a "canonical path"?
Java
0 vote131 views1 answer
Java 1.8.0 (64 bit) free download
Java
0 vote135 views1 answer
Run java class file
Java
0 vote118 views1 answer
Linearview 2 items next to each other
Java
0 vote160 views1 answer
Java detect new line in string
Java
8 votes173 views3 answers
Get first letter of string in array java
Java
14 votes130 views2 answers
What method is use for getting the index position of a character of a string in java
Java
0 vote116 views2 answers
How apache shiro remember me works
Java
0 vote135 views1 answer
@Bean public ModelMapper modelMapper() { ModelMapper modelMapper = new ModelMapper(); modelMapper.getConfiguration() .setMatchingStrategy(MatchingStrategies.STRICT); }
Java
1 vote163 views1 answer
Java multiplication table nested loop
Java