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

      Pramati Technologies

      Est-ce votre entreprise ?

      .NET Developer : entretien chez Pramati Technologies

      Question d’entretien chez Pramati Technologies

      Entretien pour .NET Developer

      find missing value from n continuos numbers. they say it as algorithm question

      Réponses aux questions d'entretien

      Utilisateur anonyme

      10 avr. 2018

      Worst case complexity for above solution is O(n). Bettet solution is to binary search approach which has worst complexity as O(log n). If middle is not as expected, then missing number is in left side of middle number. Apply the same on sub-array on left side

      Utilisateur anonyme

      20 mars 2018

      sum of n continuous numbers from algebra.( n*n+1)/2. loop through each value and subtract from sum. at last you will have missing value

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