Passa al contenutoPassa al piè di pagina
  • Lavori
  • Aziende
  • Stipendi
  • Per le aziende

      Migliora la tua carriera

      Scopri le tue potenzialità di guadagno, trova lavori da sogno e condividi approfondimenti su lavoro e vita privata in forma anonima.

      employer cover photo
      employer logo
      employer logo

      Qualcomm

      Azienda coinvolta

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su Qualcomm | Offerte di lavoro di Qualcomm | Stipendi di Qualcomm | Benefit di Qualcomm
      Colloqui di QualcommColloqui per Machine Learning Software Engineer - Embedded-AI-Framework presso QualcommColloquio di Qualcomm


      Glassdoor

      • Chi siamo
      • Contattaci

      Aziende

      • Account Business gratuito
      • Spazio per le aziende
      • Blog per le aziende

      Informazioni

      • Aiuto
      • Linee guida
      • Condizioni d'uso
      • Privacy e scelte pubblicitarie
      • Non vendere né condividere le mie informazioni
      • Strumento per l'accettazione dei cookie

      Lavora con noi

      • Inserzionisti
      • Carriere
      Scarica l'app

      • Cerca:
      • Aziende
      • Lavori
      • Località

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor," "Worklife Pro," "Bowls" e il relativo logo sono marchi registrati di Glassdoor LLC.

      Aziende seguite

      Non lasciarti sfuggire opportunità e informazioni privilegiate seguendo le aziende dove vorresti lavorare.

      Ricerche di lavoro

      Ricevi suggerimenti e aggiornamenti personalizzati avviando le tue ricerche.

      Le migliori aziende per "stipendio e benefit" vicino a te

      avatar
      DONE by NONE
      3.8★Stipendio e benefit
      avatar
      Digital Natives
      4.4★Stipendio e benefit

      Colloquio per Machine Learning Software Engineer - Embedded-AI-Framework

      21 mag 2024
      Candidato anonimo a colloquio
      Seoul
      Nessuna offerta
      Esperienza positiva
      Colloquio difficile

      Candidatura

      Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Qualcomm (Seoul) nel mese di apr 2024

      Colloquio

      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.

      Domande di colloquio [1]

      Domanda 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.
      Rispondi alla domanda
      4