Aller au contenuAller au pied de page
      employer cover photo
      employer logo
      employer logo

      Microsoft

      Employeur impliqué

      Software Development Engineer : entretien chez Microsoft

      Question d’entretien chez Microsoft

      Entretien pour Software Development Engineer

      Implement the fibonacci sequence

      Réponses aux questions d'entretien

      Utilisateur anonyme

      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.

      Utilisateur anonyme

      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

      Recherches associées: Avis sur Microsoft | Offres d’emploi chez Microsoft | Salaires chez Microsoft | Avantages sociaux chez Microsoft
      Entretiens chez Microsoft