10 Fujitsu Software Engineer (New Grad) Interview Questions (2026)

Outline

STAR: pick a real story — class project, internship, or open-source collaboration with someone in a different time zone. Show adaptation, async-communication habits, and cross-cultural awareness. Fujitsu's global structure means you will work across regions — this matters.

Outline

Tie to a specific area — Fujitsu Uvance (sustainability platform), HPC (Fugaku ecosystem), retail/finance solutions, or managed services. Show you understand Fujitsu's role across Japan, Europe, and North America. Avoid generic 'big global company' answers.

Outline

STAR: pick a real story with genuine ambiguity. Show how you framed the decision (cost of being wrong, reversibility, who needed to be informed), gathered what you could, and committed. End with the outcome and what you would do differently.

Outline

Sliding window + hash map of char counts. Expand right; when distinct count exceeds k, shrink left until count is at most k. Track max window size. O(n) time, O(k) space. Walk through with k=2 and a small example.

Outline

Three solutions to discuss: (1) naive recursive — O(2^n), exponential — explain why it's bad. (2) memoized recursion — O(n) time, O(n) space. (3) iterative with two variables — O(n) time, O(1) space. Pick the iterative one for the code. Mention matrix exponentiation for O(log n) as an aside.

Outline

For sorted input: if length is odd, return arr[n/2]. If even, return (arr[n/2 - 1] + arr[n/2]) / 2. O(1) time, O(1) space. Trivial — but be precise about indexing and tie-breaking. Follow-up: median of two sorted arrays — much harder, O(log min(m, n)) binary search.

Outline

Bottom-up DFS: recursive helper returns either the height of the subtree or -1 (unbalanced). At each node, recurse left and right; if either is -1 or they differ by more than 1, return -1. Else return max + 1. O(n) time, O(h) space. Naive top-down is O(n^2).

Outline

Atomicity: all or nothing. Consistency: transitions valid → valid state. Isolation: concurrent transactions don't interfere. Durability: committed changes survive crashes. Discuss isolation levels (read uncommitted, read committed, repeatable read, serializable) and their anomalies (dirty read, non-repeatable read, phantom read).

Outline

Indexes accelerate lookups at the cost of write overhead and storage. Clustered index: physically orders the table by index key — one per table (often the primary key). Non-clustered index: separate structure pointing to row locations — multiple allowed. Discuss B-tree vs. hash indexes and when each is used.

Outline

Process: isolated address space, costly to create, safer (one crash doesn't take down siblings). Thread: shares address space, cheap to create, needs synchronization. Choose processes for isolation (different security domains, fault containment). Choose threads for shared-state work and low-overhead concurrency.