Deshaw interview questions

Showing 1–7 of 7 results

• Compare Fixed and Variable Train Gaps Without a TimetableHard

  Compare two train services for a commuter who arrives without consulting a timetable. Explain the assumptions and derivation clearly, check edge cases, and show how the result changes when those assumptions no longer hold.

  DeshawSoftware EngineerStatistics & MathTechnical Screen
• Compare Linux Containers and Virtual MachinesMedium

  Tests in-depth understanding of Linux operating system virtualization mechanisms, contrasting hardware-level hypervisors with OS-level container isolation primitives across security, performance, and operational dimensions.

  DeshawSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Explain What Happens When a Linux Shell Runs lsMedium

  Tests end-to-end understanding of Linux OS fundamentals, systems programming concepts, system calls, and how a POSIX shell interacts with the kernel to execute a command.

  DeshawSoftware EngineerSoftware Engineering FundamentalsTechnical Screen
• Explain and Compare SGD and AdamHard

  Explain how stochastic gradient descent updates model parameters and how Adam modifies those updates using moving estimates of first and second gradient moments. Cover data and labels, leakage-safe features, baselines and model choice, offline evaluation, deployment constraints, monitoring, and drift.

  DeshawSoftware EngineerMachine LearningTechnical Screen
• Implement sqrt and parity-based array rearrangementMedium

  In the Coding & Algorithms domain, this prompt evaluates numerical methods and precision handling for implementing a square-root function without library support, together with in-place array manipulation, partitioning and complexity reasoning for parity-based rearrangement, testing competencies in algorithm design, numerical approximation, and space-efficient data transformations. These problems are commonly asked to assess understanding of numerical stability, error bounds and iterative approximation as well as mastery of in-place ordering/partitioning strategies and time/space complexity analysis, requiring both conceptual understanding of mathematical properties and practical implementation ability.

  DeshawMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Maximum L1 Distance Between Equal-Length SubarraysMedium

  Tests recognizing that non-negative L1 terms allow reducing subarray search to full diagonal overlaps across two arrays, requiring O(n * m) time and 64-bit integer handling.

  DeshawSoftware EngineerCoding & AlgorithmsTechnical Screen
• Teach a New Technical Concept to an UndergraduateMedium

  This exercise tests your ability to distill complex technical information, adapt to an audience's knowledge level, and maintain logical flow in a structured explanation.

  DeshawSoftware EngineerBehavioral & LeadershipTechnical Screen