Databricks Software Engineer Interview Questions

Review this list of Databricks software engineer interview questions and answers verified by hiring managers and candidates.
  • Databricks logoAsked at Databricks 

    "A document processing pipeline means step-by-step handling of documents. First we upload the file, then system checks and cleans it. After that OCR or NLP is used to take out text. The text is classified and important details are picked, then saved in database for use. This type of pipeline is useful because it saves time and reduces manual work. Instead of people reading and typing data, the system can automatically process large numbers of documents quickly. It also improves accuracy, keeps d"

    Abu H. - "A document processing pipeline means step-by-step handling of documents. First we upload the file, then system checks and cleans it. After that OCR or NLP is used to take out text. The text is classified and important details are picked, then saved in database for use. This type of pipeline is useful because it saves time and reduces manual work. Instead of people reading and typing data, the system can automatically process large numbers of documents quickly. It also improves accuracy, keeps d"See full answer

    Software Engineer
    System Design
    +2 more
  • Databricks logoAsked at Databricks 

    "Constraints: 4-direction moves; no mode switching (pick exactly one of {1=bicycle, 2=bike, 3=car, 4=bus} for the full trip). Per-mode search: If a mode’s per-step time/cost are uniform, run BFS on allowed cells. Then totaltime = steps × timeperstep, tie-break by steps × costper_step. If time/cost vary by cell (given matrices), run Dijkstra per mode minimizing (totaltime, totalcost) lexicographically. Maintain the best ⟨time, cost⟩ per cell; relax when the new pair is strictly better. S"

    Rahul J. - "Constraints: 4-direction moves; no mode switching (pick exactly one of {1=bicycle, 2=bike, 3=car, 4=bus} for the full trip). Per-mode search: If a mode’s per-step time/cost are uniform, run BFS on allowed cells. Then totaltime = steps × timeperstep, tie-break by steps × costper_step. If time/cost vary by cell (given matrices), run Dijkstra per mode minimizing (totaltime, totalcost) lexicographically. Maintain the best ⟨time, cost⟩ per cell; relax when the new pair is strictly better. S"See full answer

    Software Engineer
    Coding
    +1 more
  • Databricks logoAsked at Databricks 
    Software Engineer
    System Design
    +1 more
  • Databricks logoAsked at Databricks 

    "One Accomplishment I'm most proud of is that I graduated from Schaumburg High School In May of 2021 and I was able to get up the stage and collect my diploma. This was a HUGE Impact in regards of passing all of my classes and earning all of my credits in order to be apart of the NOW Arena graduation."

    Amparo L. - "One Accomplishment I'm most proud of is that I graduated from Schaumburg High School In May of 2021 and I was able to get up the stage and collect my diploma. This was a HUGE Impact in regards of passing all of my classes and earning all of my credits in order to be apart of the NOW Arena graduation."See full answer

    Software Engineer
    Behavioral
    +1 more
  • 🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

Showing 1-4 of 4