Recently interviewed with Nike, and it turned out to be a great mix of DSA, Java fundamentals, and deep-dive discussions on language concepts. Sharing some of the interesting problems I faced:

-->Target Sum in One Pass
Given an array and a number k, determine if any two numbers add up to k — but the catch was to solve it in one pass using a HashMap.
Example: [10,15,3,7], k=17 → true (10+7)

-->HashMap + hashCode/equals Behavior
A fun scenario where a Student class had hashCode() always returning 1. We explored how all keys land in the same bucket, how equals() resolves collisions, and how HashMap handles such skewed distributions.

-->Java Pass-by-Value Confusion
We discussed how:

Passing obj.x (primitive) doesn’t change the original value

Passing the object modifies its internal state
Final output in the snippet: 1 — classic Java trick!

-->Product of Array Except Self (Without Division)
Another interesting problem: build an output array where each element is the product of all other elements except itself, without using division.
Used prefix and suffix multiplications to compute it efficiently.

Not proceeded with next rounds as I got promotion in my current company.

#engineering #nike #problemsolving #coder