Ir al contenidoIr al pie de página
  • Empleos
  • Empresas
  • Sueldos
  • Para empleadores

      Impulsa tu carrera profesional

      Averigua cuánto podrías ganar, encuentra el empleo perfecto y comparte información sobre tu vida laboral y personal de forma anónima.

      employer cover photo
      employer logo
      employer logo

      HedgeServ

      Empleador activo

      Información
      Evaluaciones
      Pago y prestaciones
      Empleos
      Entrevistas
      Entrevistas
      Búsquedas relacionadas: Evaluaciones de HedgeServ | Empleos en HedgeServ | Sueldos en HedgeServ | Prestaciones en HedgeServ
      Entrevistas en HedgeServEntrevistas para el cargo de Python Developer en HedgeServEntrevista en HedgeServ


      Glassdoor

      • Acerca de
      • Premios
      • Blog
      • Contacto

      Empleadores

      • Cuenta de empleador gratuita
      • Centro de empleador

      Información

      • Ayuda
      • Pautas
      • Condiciones de uso
      • Privacidad y opciones de anuncios
      • No vender ni compartir mi información
      • Herramienta de autorización de cookies

      Trabaja con nosotros

      • Anunciantes
      • Oportunidades laborales
      Descargar aplicación

      • Buscar por:
      • Empresas
      • Empleos
      • Ubicaciones

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor", "Worklife Pro", "Bowls" y sus logotipos son marcas comerciales registradas de Glassdoor LLC.

      Empresas seguidas

      Sigue a tus empresas favoritas para estar al tanto de las últimas oportunidades y disponer de información desde adentro.

      Búsquedas de empleo

      Recibe recomendaciones y actualizaciones personalizadas al iniciar tu búsqueda.

      Entrevista para Python Developer

      26 dic 2016
      Candidato de entrevista anónimo
      New York, NY
      Sin ofertas
      Experiencia negativa
      Entrevista difícil

      Solicitud

      Me postulé a través de un reclutador. El proceso tomó 3 semanas. Acudí a una entrevista en HedgeServ (New York, NY) en nov 2016

      Entrevista

      This was in their general ledger group for which they needed P&L experience. I had a phone interview, a small follow-up assignment, and three on-site interviews. The phone interview required me to be on a computer to do a coding exercise. Going on-site three times was excessive. They were a bit disorganized in that a scheduled interviewer could not meet me, and other interviewers were often late. It also struck me as odd that there was never a receptionist present at their front desk, making it unreasonably difficult even to enter their office. I did fine in the technical rounds and in the discussion with the tech manager. In the final interview, I felt that the product owner on the business side was unexpectedly difficult, and so they rejected me. Their stack includes Python 2.6 which is an ancient language that no professional should have to work with. Their expected work hours are at least 8:30 to 6.

      Preguntas de entrevista [5]

      Pregunta 1

      Implement the power(int b > 0, int n >= 0) function. What is its time complexity? Extend the function to also accept int n < 0. Assuming the time complexity of the implemented function was O(n), also implement an O(log n) variant. Note that use of recursion is acceptable for the O(log n) implementation, but not for the O(n) implementation. Only an iterative implementation is acceptable for the O(n) variant.
      Responder pregunta

      Pregunta 2

      What is the formula for determining the number of permutations? Write a function to return the permutations of a given string, e.g. "abc", that are equal to the length of the given string. If this function is implemented using itertools, also implement one without using itertools. Note that use of recursion is acceptable.
      Responder pregunta

      Pregunta 3

      (TDD pair programming) Incrementally implement a bowling score calculator.
      Responder pregunta

      Pregunta 4

      What is an inner join? How do you determine the optimal number of worker threads? What is a deadlock? What is an algorithm to prevent deadlocks? What is a formula for determining the sum of integers from 1 to n? Optionally provide a mathematical proof for the correctness of the formula.
      Responder pregunta

      Pregunta 5

      Do you have experience calculating P&L greeks? What did you calculate?
      1 respuesta