Ir para o conteúdoIr para a pasta
      employer cover photo
      employer logo
      employer logo

      Google

      Empresa engajada

      Entrevista do cargo de Software Engineer da empresa Google

      Pergunta de entrevista da empresa Google

      Entrevista para Software Engineer

      Write an algorithm to test if n is power of 2

      Respostas da entrevista

      Sigiloso

      25 de set. de 2010

      I believe what the other poster meant was the following: !(n & (n-1)) !(n & 0x00000001) is equivalent to !(n&1) and is independent of integer size. However, this only checks if a number is even.

      6

      Sigiloso

      23 de jan. de 2011

      if the range is within a 32bit signed integer, you can check as following way if (n == (n & -n)) return true; else return false;

      1

      Sigiloso

      24 de set. de 2010

      ! (n & 0x00000001) assuming 32 bit integer

      Buscas relacionadas: Avaliações da empresa Google | Vagas da empresa Google | Salários da empresa Google | Benefícios da empresa Google
      Entrevistas da empresa Google