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.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 29: Bitwise AND
  5. Discussions

Day 29: Bitwise AND

Problem
Submissions
Leaderboard
Discussions
Editorial
Tutorial

    You are viewing a single comment's thread. Return to all comments →

  • ranieri_michel
    2 months ago+ 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;
      }
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy