Skip to main content
T1 Large companies and unicorns NetEase New grad

NetEase AI Infra campus hiring

Real NetEase AI Infra campus hiring interview questions covering inference optimization, operator optimization, and related topics

Inference optimization Operator optimization

Project experience

  1. Describe in detail the main modules and core technical contributions of the AI-related projects on your resume

Inference optimization

  1. When designing a high-throughput, low-latency model inference service, what architecture-level and engineering-level issues matter most

C++ basics

  1. Explain the traits and differences of stack, heap, and static/global storage in program memory
  2. Main differences between new/delete and malloc/free, and why C++ prefers the former
  3. Deep copy versus shallow copy, and when you must use deep copy
  4. Design intent, use cases, and differences among std::unique_ptr, std::shared_ptr, and std::weak_ptr
  5. How the vtable implements runtime polymorphism; semantic and usage differences between virtual and pure virtual functions
  6. Memory alignment and compiler struct alignment rules; compute sizeof for a given struct
  7. C++11 rvalue references and move semantics, and how they enable efficient data transfer

CUDA programming

  1. Basic idea of the SIMT programming model and the hierarchy of thread, block, and grid
  2. Where thread-local variables live in a CUDA kernel, and how that relates to register allocation
  3. How shared memory cuts repeated global-memory access (tiled matrix multiply as an example)
  4. Warp shuffle: the idea and its advantages for in-warp exchange and reduction
  5. How vectorized load/store instructions (e.g. float4, int4) enable coalesced access and what performance you gain
  6. Causes of shared-memory bank conflict, with examples
  7. Avoiding bank conflict via padding or memory-layout changes

Fundamentals

  1. How CPU caches work, including temporal locality, spatial locality, and common replacement policies

Coding

  1. In a stream of many integers, find the top-K most frequent elements in real time (hash table + min-heap), and analyze time complexity