Ir para o conteúdoIr para a pasta
  • Vagas
  • Empresas
  • Salários
  • Para empresas

      Avance em sua carreira

      Descubra qual pode ser seu salário, conquiste a vaga dos seus sonhos e compartilhe insights de qualidade de vida com sigilo.

      employer cover photo
      employer logo
      employer logo

      Bloomberg

      Empresa engajada

      Sobre
      Avaliações
      Remuneração e benefícios
      Vagas
      Entrevistas
      Entrevistas
      Buscas relacionadas: Avaliações da empresa Bloomberg | Vagas da empresa Bloomberg | Salários da empresa Bloomberg | Benefícios da empresa Bloomberg
      Entrevistas da empresa BloombergEntrevistas do cargo de Software Engineer - Trading Systems da empresa BloombergEntrevista da empresa Bloomberg


      Glassdoor

      • Sobre
      • Prêmios
      • Blog
      • Fale conosco

      Empresas

      • Conta gratuita de empresa
      • Área da empresa
      • Blog para empresas

      Informações

      • Ajuda
      • Regras da Comunidade
      • Termos de Uso
      • Privacidade e opções de anúncios
      • Não venda nem compartilhe minhas informações
      • Ferramenta de consentimento de uso de cookies

      Trabalhe conosco

      • Anunciantes
      • Carreiras
      Baixe o aplicativo:

      • Busque por:
      • Empresas
      • Vagas
      • Localizações

      Copyright © 2008-2026. Glassdoor LLC. “Glassdoor”, “Worklife Pro”, “Bowls” e o logotipo do Glassdoor são marcas comerciais pertencentes à Glassdoor LLC.

      Empresas seguidas

      Fique por dentro de todas as oportunidades e dicas internas seguindo as empresas de seus sonhos.

      Buscas de vagas

      Comece a buscar vagas para receber atualizações e recomendações personalizadas.

      Entrevista para Software Engineer - Trading Systems

      17 de mar. de 2018
      Candidato(a) sigiloso(a) à entrevista
      Nenhuma oferta
      Experiência negativa

      Outras avaliações de entrevista de vagas de Software Engineer - Trading Systems da empresa Bloomberg

      Entrevista para Software Engineer (Trading Systems)

      27 de fev. de 2017
      Candidato(a) sigiloso(a) à entrevista
      Nenhuma oferta
      Experiência neutra
      Entrevista com nível médio de dificuldade

      Candidatura

      Fui entrevistado pela Bloomberg em fev. de 2017

      Entrevista fácil

      Candidatura

      Candidatei-me por meio de recrutador(a). O processo levou 1 semana. Fui entrevistado pela Bloomberg em fev. de 2018

      Entrevista

      60 Minute phone interview on hackerrank. Interviewer dove directly into programming questions that were vague and offered little explanation as to what he was looking for. Some of the questions didn't make sense and the interviewer didn't clarify anything. After the interview ended I got ghosted (no follow up at all). I found the whole experience to be very unprofessional.

      Perguntas de entrevista [5]

      Pergunta 1

      Implement a queue and make it thread safe
      1 resposta

      Pergunta 2

      Given a singly linked list, write a function to pop a node in less than O(n) without using extra memory given this interface: void pop(Node * node);
      1 resposta

      Pergunta 3

      What is a zombie process?
      Responder à pergunta

      Pergunta 4

      What does the static keyword mean in C?
      Responder à pergunta

      Pergunta 5

      What types of thread protection exist besides critical section, mutex and semaphore?
      Responder à pergunta
      Candidatei-me por meio de recrutador(a). 
      O processo levou 4 semanas. 

      Entrevista

      Applied through a recruiting firm (who to their credit were quite efficient) First phone round went decently. Questions related to copy constructor and another algorithmic question. I thought my answer on the copy constructor wasn't upto the mark. Was elated when I got a call for a second phone interview Was much better prepared during this interview . Question 1 : Remove duplicate elements in a linked list Ans : Breezed through this as any developer worth his salt would Question 2 : Compare two binary trees and return if they are equal. Ans : Suggested a very acceptable solution where we traverse through the trees inorder and store them in vectors, and compare the vectors to check for equivalence. Was quizzed on that. Summary : Both programs were accurate solutions and the programs worked on Hackerrank without a hitch. However second one was probably not the 100% efficient result they were looking for. Result :REJECTED.

      Perguntas de entrevista [1]

      Pergunta 1

      copy constructor check if 2 binary trees are equal remove duplicate nodes in a linked list
      Responder à pergunta

      Entrevista para Software Engineer - Trading Systems

      3 de nov. de 2016
      Candidato(a) sigiloso(a) à entrevista
      New York, NY
      Nenhuma oferta
      Experiência neutra
      Entrevista com nível médio de dificuldade

      Candidatura

      Candidatei-me online. O processo levou 5 dias. Fui entrevistado pela Bloomberg (New York, NY) em out. de 2016

      Entrevista

      Brief description of my work experience followed by 2 coding questions using hackerrank to share screen. Syntax not a factor - interviewer just wanted to see the algorithm. I coded as fast as I could, stumbled slightly, corrected myself quickly. I even presented a recursive and completely correct solution to one of the problems. It was obvious the interviewer wasn't prepared for an out-of-the-box answer, and as such had difficulty articulating his canned followup question. Despite the pressure of coding while holding a phone in one hand and a laptop in the other, I felt confident with my performance and enjoyed the interview (I don't say this about all interviews). 3-days later I received an email that they were not moving forward with the application. Felt like punching a wall after that.

      Perguntas de entrevista [1]

      Pergunta 1

      Given a matrix of integers and a starting point, find all adjacent neighbors with same value, and repeat process with each identified neighbor.
      Responder à pergunta
      1