💬 Data structures that keep showing up in fresher interviews

I have sat on the other side of the table for fresher interviews at my company in Hitech City for about two years now, maybe sixty or seventy candidates, and the pattern is boring in a good way. Almost every round we run comes back to arrays, strings and hash maps. Two pointers, a sliding window, finding duplicates, counting things. The candidates who do well are not the ones who finished a 400 problem course. They are the ones who notice that a nested loop can become one pass with a hash map, and say so out loud before writing a single line. Trees come second. Traversals, a basic BST question, level order with a queue, and recursion that does not fall apart when I ask about the base case. Linked lists show up less than people expect, mostly reverse a list or find a cycle. Stacks turn up as the brackets question and not much else. Hard graphs, segment trees and tricky DP almost never appear at our level, yet I keep meeting freshers who spent a month on them and cannot explain a sliding window. If I were preparing again, I would put about 60 percent of my time on arrays, strings and hash maps, 25 on trees and recursion, and the rest on everything else. That split is only from my desk though, and a product company with harder rounds might tell you something different.

I would add one practice tip. Solve a problem, then write the same one again the next day without looking. In my first interview I knew hash maps, but I froze on a sliding window problem I had only read, not solved. Time yourself at 30 minutes a problem and explain out loud, because interviewers care about how you think. Did you cover linked lists and trees in your prep too?

I would push back a little on skipping DP completely. Two of my friends got medium DP questions at product companies in Hyderabad this year, nothing crazy, just coin change and the house robber one.