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

  • ranieri_michel
     + 0 comments

    C# Solution:

      public static int bitwiseAnd(int N, int K)
  {
    int max = 0;
    int compare = 0;
    for(int i = 1; i<N; i++)
      for(int j = i+1; j<=N; j++)
      {
        compare = i&j;
        max = max < compare && compare < K ? compare : max;
      }
    return max;
  }