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

      Qualcomm

      Empleador activo

      Información
      Evaluaciones
      Pago y prestaciones
      Empleos
      Entrevistas
      Entrevistas
      Búsquedas relacionadas: Evaluaciones de Qualcomm | Empleos en Qualcomm | Sueldos en Qualcomm | Prestaciones en Qualcomm
      Entrevistas en QualcommEntrevistas para el cargo de Machine Learning Software Engineer - Embedded-AI-Framework en QualcommEntrevista en Qualcomm


      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 Machine Learning Software Engineer - Embedded-AI-Framework

      21 may 2024
      Candidato de entrevista anónimo
      Seúl
      Sin ofertas
      Experiencia positiva
      Entrevista difícil

      Solicitud

      Me postulé en línea. El proceso tomó 1 semana. Acudí a una entrevista en Qualcomm (Seúl) en abr 2024

      Entrevista

      I found the job post on LinkedIn, I applied on their official website. They sent me a 2-hour code challenge (medium/easy LeetCode-like questions) with a deadline of about 7 days.

      Preguntas de entrevista [1]

      Pregunta 1

      1. Reverse a Linked List (Python) Question: Describe how you would reverse a linked list in Python. Details: The interviewer asked for a function that takes the head of a linked list and reverses it, returning the new head of the reversed list. They were interested in understanding the logic and efficiency of your approach. 2. Remove Cycles from a Graph Question: How would you remove cycles from a graph given an integer n representing node IDs and a list of tuples representing edges? Details: The task was to provide an algorithm that removes cycles from a graph and outputs a list of edges of the new graph with cycles removed. The interviewer was looking for knowledge of graph theory and algorithms to detect and remove cycles. 3. Calculate Calories Burned During a Ride (Python) Question: Write a Python function to calculate the calories burned during a ride based on the rider's weight and ride data. Details: The function needed to calculate the total calories burned given the weight of the rider and a list of tuples representing different segments of the ride, each with a duration and speed. 4. Find the Maximum Sum of Two Numbers in a List (Python) Question: Write a Python function to find the maximum sum of any two numbers in a list. Details: The interviewer wanted to see how you would identify the two largest numbers in a list and sum them up efficiently, demonstrating your problem-solving skills with basic list operations. 5. Merge Two Sorted Lists (Python) Question: How would you merge two sorted lists into one sorted list in Python? Details: The task was to create a function that merges two pre-sorted lists into a single sorted list, showing your understanding of list operations and efficiency in merging algorithms.
      Responder pregunta
      4