Ir al contenidoIr al pie de página
      employer cover photo
      employer logo
      employer logo

      Microsoft

      Empleador activo

      Entrevista para el cargo de Software Development Engineer en Microsoft

      Pregunta de entrevista de Microsoft

      Entrevista para Software Development Engineer

      Implement the fibonacci sequence

      Respuestas de entrevistas

      Anónimo

      7 nov 2011

      First gave the recursive solution everyone knows ie fib(n) = fib(n-1)+fib(n-2). Then I gave the iterative solution when he asked me if the recursive was efficient. You can look that up.

      Anónimo

      14 nov 2011

      There is a blog with detailed solution on how to calculate Fibonacci sequences: http://codercareer.blogspot.com/2011/10/no-15-fibonacci-sequences.html

      Búsquedas relacionadas: Evaluaciones de Microsoft | Empleos en Microsoft | Sueldos en Microsoft | Prestaciones en Microsoft
      Entrevistas en Microsoft