We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 29: Bitwise AND
  5. Discussions

Day 29: Bitwise AND

Sort 374 Discussions, By:

  • akshyat_kumar67
     + 0 comments

    My Solution in C++

    int bitwiseAnd(int N, int K) {
    int maximum=0;
    for(int i=1;i<N;i++){
        for(int j=i+1;j<=N;j++){
            int andResult=i&j;
            if(andResult<K && andResult>=maximum)
                maximum=andResult;
        }
    }
    return maximum;
}

  • maricbogdan10
     + 0 comments

    Java 8

        public static int bitwiseAnd(int N, int K) {
        int max = 0;
        for (int i = 1; i <= N; i++) {
            for (int j = i + 1; j <= N; j++) {
                int tmp = i&j;
                if (tmp < K && tmp > max) {
                    max = tmp;
                }
            }
        }
        return max;
    }

  • rohit139maurya
     + 0 comments

    java

     public static int bitwiseAnd(int N, int K) {
// Write your code here
List<Integer> l=new ArrayList<>();
int s[]=new int[N];
for (int i = 0; i < s.length; i++) {
    s[i]=i+1;
}
for (int i = 0; i < s.length-1; i++) {
for (int j = i+1; j< s.length; j++) {
if ((s[i]&s[j])<K) {
    l.add((s[i]&s[j]));
}
 }
  }
return Collections.max(l);
     }

    }

  • khotpavankumar27
     + 1 comment

    Java | Easy Solution 

        int max = 0;
    int result = 0;
    for(int i=1; i<N; i++)
        for(int j=i+1; j<=N; j++){
            max = Math.max(max,i&j);   
            if(max<K){
                result = max;
            }
        }
        return result;

  • janclinton_brig1
     + 0 comments

    This is my Solution for the problem!

    in Java!

    public static int bitwiseAnd(int N, int K) {
    // Write your code here
        int[] S = new int[N];
        List<Integer> lst = new ArrayList<>();
        for (int i = 0; i < S.length; i++) {
            S[i]= i+1;
        }
        int A=0; 
        int B=0;
        for (int i = 0; i < S.length-1; i++) {
            A = S[i];
            for (int j = i+1; j < S.length; j++) {
                B = S[j];
                if(A<B){
                   lst.add(A&B); 
                }
            }
        }
        int pos = lst.get(0);
        for (int i : lst) {
            if(K>i && pos <i) pos = i;
        }
        return pos;
    }
Load more conversations