Wells Fargo

The Wells Fargo interview caught me a little off guard because I went in expecting mostly DSA, but the discussion ended up covering quite a few different areas. The process started with an online assessment containing coding along with aptitude and logical-reasoning questions. The coding wasn't extremely difficult, but the time pressure made it important to avoid getting stuck on one problem. After clearing the assessment, I was invited to the technical interviews. One of the first questions I was asked was about **stacks and recursion**. The interviewer basically wanted me to explain how recursion works when the underlying data structure is involved, rather than just giving a textbook definition. From there, we moved to a DSA problem involving a **string**. I had to find the shortest valid string satisfying certain constraints, and the interviewer kept asking why I was choosing one data structure over another. Similar Wells Fargo India reports mention stack-based questions, recursion and string problems. Then came the resume discussion. I was asked to explain one of my projects in detail—especially the database choices, the backend flow and what I would change if the application had significantly more users. We also discussed **OOP concepts such as inheritance and polymorphism**, followed by some OS questions. One question I remember clearly was basically **Two Sum on an unsorted array**. I explained the hashmap solution, and the interviewer followed up by asking about its average complexity and what could happen in the worst case. This question has also appeared in reported Wells Fargo SDE intern interviews. The interviews felt decent while I was in them, but I eventually received the rejection. Looking back, I think I prepared too narrowly for DSA and should have spent more time revising core CS and being able to defend every technical detail on my resume.