wells fargo logo
Wells Fargo· SDE I

Wells Fargo | SDE1

Result
Offer
Location
chennai/bangalore/hyderabad
Posted
14 Dec 2021
326 reads

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.

How it went

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.

Questions asked (6)

  1. 01

    Valid Parentheses

    Data Structures & Algorithms · Easy

    I was asked a stack-based question focusing on validating parentheses in a given string.

  2. 02

    DFS/BFS Applications and Use Cases

    Data Structures & Algorithms · Medium

    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.

  3. 03

    Minimum Spanning Tree (MST) and Algorithms

    Data Structures & Algorithms · Medium

    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.

  4. 04

    Dijkstra's Algorithm Discussion

    Data Structures & Algorithms · Medium

    The discussion revolved around Dijkstra's Algorithm, specifically its principles and applications for finding the shortest paths in a graph.

  5. 05

    Design Chess Game

    System Design · Hard

    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.

  6. 06

    Algorithm for Checkmate in Chess

    Data Structures & Algorithms · Hard

    I needed to suggest an algorithm to detect a checkmate condition within a Chess game, building upon the previous design discussion.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Wells Fargo recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!