What I Learned from Four Months of Alibaba Java Interviews: Real Questions & Insider Tips

Department A

First interview

Discussed past projects, then deep‑dive on AOP implementation, dynamic proxies (JDK vs CGLIB). Followed by rapid‑fire topics:

Java Memory Model (JMM) and thread safety

Class‑loading mechanism and violations of the parent‑delegation model

Thread‑pool core parameters and typical multithreading usage

Thread communication mechanisms (wait/notify, LockSupport, etc.)

HashMap internals and ConcurrentHashMap implementation

Database sharding design (vertical and horizontal)

Business ID generation strategies

SQL tuning and general database best practices

Application start‑up performance optimization

Second interview (online coding test)

Task: read a log file, count occurrences of each keyword, and output the counts sorted in descending order.

// Example implementation in Java
Map<String, Integer> freq = new HashMap<>();
String line;
while ((line = reader.readLine()) != null) {
    for (String word : line.split("\\s+")) {
        freq.merge(word, 1, Integer::sum);
    }
}
freq.entrySet().stream()
    .sorted(Map.Entry.<String, Integer>comparingByValue().reversed())
    .forEach(e -> System.out.println(e.getKey() + ":" + e.getValue()));

Emphasized clarifying requirements with the interviewer during the timed test.

Third interview

Soft‑skill focus, plus technical questions on HTTP protocol, TCP three‑way handshake, Base64 encoding, and the Java Memory Model happens‑before relationship.

Department B

First interview

Discussed Java synchronization primitives (synchronize vs ReentrantLock), their trade‑offs, and distributed lock concepts.

Reference on ReentrantLock implementation: https://mp.weixin.qq.com/s?__biz=MzIyMzgyODkxMQ==∣=2247483720&idx=1&sn=ba7d4724e208bce489b68d6f00bbcae5

Second interview

Thread communication methods (wait/notify, Condition, etc.)

Rate‑limiting algorithms: token‑bucket / leaky‑bucket for single‑machine and distributed scenarios

Guava Cache internals (local cache, eviction policies, refresh)

Online issue diagnosis: CPU high load, OOM analysis, thread dump interpretation

Third interview

Netty fundamentals and its threading model (boss group, worker group, event loop)

Implement an LRU cache (e.g., using LinkedHashMap with accessOrder=true)

Additional coding test

Print odd and even numbers alternately using locks and wait/notify:

class OddEvenPrinter {
    private final Object lock = new Object();
    private boolean oddTurn = true;
    public void printOdd() throws InterruptedException {
        synchronized (lock) {
            while (!oddTurn) lock.wait();
            System.out.print("odd ");
            oddTurn = false;
            lock.notifyAll();
        }
    }
    public void printEven() throws InterruptedException {
        synchronized (lock) {
            while (oddTurn) lock.wait();
            System.out.print("even ");
            oddTurn = true;
            lock.notifyAll();
        }
    }
}

Department C

First interview

Service framework selection: Spring Cloud vs Dubbo vs Thrift, trade‑offs and use cases

Consistent hashing principle (hash ring of 2^32‑1 slots)

Zookeeper as a distributed coordinator (ephemeral nodes, leader election, configuration management)

Idempotency handling for duplicate message consumption

Client load‑balancing strategies: round‑robin, random, consistent hash, LRU

Atomicity of long assignment (not atomic on 32‑bit JVMs)

volatile keyword semantics and happens‑before guarantees

Second interview

Benefits and drawbacks of micro‑service architecture

Design of distributed caches and hot‑spot mitigation strategies

Third interview (on‑site)

Scenario‑based architecture discussion and a full‑stack request‑handling walkthrough, including end‑to‑end flow from a web button click to server processing.

Resources

Interview questions compiled in a public GitHub repository:

https://github.com/crossoverJie/Java-Interview