Wells Fargo | SDE1
Summary
I interviewed for an SDE-1 position at Wells Fargo through campus placements and received an offer, which I ultimately declined for another opportunity.
Full Experience
I participated in the campus placement drive for Wells Fargo. The interview process consisted of two rounds: one technical round lasting 90 minutes and a subsequent HR round for 15 minutes.
During the technical round, I began with a brief introduction of myself. The interviewer then proceeded with a series of questions covering data structures, algorithms, and system design concepts. This included a stack-based problem, theoretical questions on graph traversal, and discussions around MST and Dijkstra's. The round concluded with a system design question to design a Chess game, followed by a specific algorithm challenge related to checkmate detection, for which I presented an OOPS-based solution.
Interview Questions (6)
Valid Parentheses
I was asked a stack-based question focusing on validating parentheses in a given string.
DFS/BFS Applications and Use Cases
The interviewer asked about the applications of Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms, and when it is appropriate to use one over the other.
Minimum Spanning Tree (MST) and Algorithms
I was questioned about what a Minimum Spanning Tree (MST) is and the various algorithms used to find an MST in a graph, such as Prim's and Kruskal's.
Dijkstra's Algorithm Discussion
The discussion revolved around Dijkstra's Algorithm, specifically its principles and applications for finding the shortest paths in a graph.
Design Chess Game
I was tasked with designing a Chess game, likely focusing on object-oriented design principles, data structures for the board and pieces, and overall game logic.
Algorithm for Checkmate in Chess
I needed to suggest an algorithm to detect a checkmate condition within a Chess game, building upon the previous design discussion.