Wells Fargo interview experience Real time questions & tips from candidates to crack your interview
IT Analyst- C2
Wells Fargo
3 rounds | 7 Coding
problems
Selected Interview preparation journey
Journey
I come from a family of teachers and lecturers. I also did not have Computer Science as a subject during my 11th and 12th which made the first year of my BTech in CS hard. But I did not give up. I had to learn everything from scratch, right from how you convert a normal integer to its binary representation to how you sort an array of integers. I explored multiple fields, worked on my coding skills, applied to a lot of companies, gave some interviews, and was finally shortlisted for Wells Fargo. My journey was a complete roller coaster ride but the only way I could pass through it all was with hard work, dedication, and perseverance.
Application story
Wells Fargo visited my college in November 2021 offering an internship to pre-final year students. Initially, students were shortlisted based on their CGPA and a few other parameters, after which around 250 students were allowed to appear for the first round. The 250 students selected were informed to appear for a Computer Based Online Recruitment Test (AMCAT) consisting of coding, an English section, and an aptitude section. Then there were two interviews held, one technical and one HR after which a total of 10 students were selected from my college.
Why selected/rejected for the role?
I was selected for this role because I could answer most of the questions of the interviewer and maintained a calm attitude throughout the interview. I had also done well in the aptitude section of the written test.
Preparation
Duration: 9 months
Topics: Array, Sorting, Dynamic Programming, Trees, Backtracking, Strings
Tip 1 : Practice Every Single day, be consistent
Tip 2 : Invest in developing your development skills too i.e. have at least 3 good projects
Tip 3 : Complete 450 questions sheet by Love Babbar (YouTube)
Application process
Where: Campus
Eligibility: Above 8, Min 60% in 12th standard
Tip 1 : Don't use pictures and have your resume in bullet points
Tip 2 : Put all the relevant experience in reverse chronological order
Interview rounds
01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date10 Nov 2021
Coding problem2
The test consisted of 3 sections — English, Business Aptitude, and Coding.
There is no negative marking, and all questions are compulsory to solve.
Each section had a time limit within which we had to complete it. We were not allowed to navigate back to a question after answering it. There is no negative marking, and all questions are compulsory to solve. The Coding section had 2 questions that could be solved in any language. The questions varied from medium to hard levels.
1. LRU Cache Implementation
Moderate
25m average time
65% success
0/80
Asked in companies
Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations:
1. get(key) - Return the value of the key if the key exists in the cache, otherwise return -1.
2. put(key, value), Insert the value in the cache if the key is not already present or update the value of the given key if the key is already present. When the cache reaches its capacity, it should invalidate the least recently used item before inserting the new item.
You will be given ‘Q’ queries. Each query will belong to one of these two types:
Type 0: for get(key) operation.
Type 1: for put(key, value) operation.
Note :
1. The cache is initialized with a capacity (the maximum number of unique keys it can hold at a time).
2. Access to an item or key is defined as a get or a put operation on the key. The least recently used key is the one with the oldest access time.
Problem approach
In order to answer this question, we must maintain track of the cache item that has been utilized the least lately. I used a C++ list and map to design the cache.
The steps that I followed were as follows:-
1)When we access an item in the cache it moves to the front of the list as it is the most recently used item.
2)When we want to remove an item we remove it from the last of the list as it is the least recently used item in the cache.
3)When we insert an item we insert it into the front of the list as it is the most recently used item.
The idea is to store the keys in the map and its corresponding values into the list.
2. Longest Substring Without Repeating Characters
Moderate
30m average time
65% success
0/80
Asked in companies
Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.
Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.
Problem approach
I used JAVA Hashset to solve the problem
1) Use sliding window with hashset, use left and right pointers to move the window.
2) If the set doesn't contains a character then first add into the set and calculate the maxLength hand-in-hand.
3) if the character is already present in the set that means you have to move your sliding window by 1, before that you have to remove all the characters that are in front of the character that is present already in the window before.
4) Now you have to remove that character also and move the left pointer and also add the new character into the set
This would solve the problem,
02
Round
Medium
Video Call
Duration45 minutes
Interview date12 Nov 2021
Coding problem4
This round was held on zoom. The interviewer first asked me to introduce myself and asked a few questions about my interest. Then he proceeded to the coding part. The interviewer tested my in-depth knowledge of the OOPS concept and had me code all the concepts that I explained.
He also tested my knowledge of C++, recursion, STL, and complexities by giving me a few scenarios to code. He also asked me how I could improve the complexity of my code.
Other questions included the difference between Java and C++, Method overloading and overriding, and a few follow-up questions based on the answers I was giving. The questions were tricky and required a clear understanding of the basic concepts. He also asked a few questions on my resume and ended the interview.
1. DBMS Question
The difference in Truncate and delete command in DBMS.
Problem approach
Tip 1 : Have a clear understanding of DBMS Commands
Tip 2 : Practice SQL
2. OOPS Question
Explain OOPS by implementing all the OOPS concepts in a language of your choice
Problem approach
I had taken a very simple code of calculating the prime number to demonstrate-
1) Inheritance by taking 2 classes
2) Polymorphism by showing the + operator for strings and integer
3) Encapsulation I explained in theory
3. OOPS Question
Difference between Method overloading and overriding
Problem approach
Tip 1 : Have a thorough understanding of OOPS
Tip 2 : Practice Interview questions from GFG
4. DSA Question
Define recursion. Explain its working through implementation.
Example :- Write a recursive program for Fibonacci series
Problem approach
I had taken the example of calculating the Fibonacci series. I first solved the problem by a non-recursive approach, then solved it by recursion thus explaining to the interviewer what exactly recursion is and how it makes our program more efficient
03
Round
Medium
HR Round
Duration45 minutes
Interview date12 Nov 2021
Coding problem1
In this round, the interviewer focused on my resume. He asked me in-depth questions about everything I had mentioned on my resume.
This round too, like the previous round, was held on zoom. The interviewer first asked me to introduce myself. The first round of questions was based on my introduction. He asked me questions like why I liked C++ etc.
He then asked me in detail about the various conferences I attended, the scholarships I received, the programs I was a part of. He asked about my role in these and what I had learnt from each one of them.
After discussing my extracurricular, he moved on to my projects. He focused on this section the most as a majority of the technical questions in this round were about the tech stack that I had used to implement my projects. Finally, he asked me a few general HR questions about my motivation to work in tech and why I wanted to join the company.
In the end, I was given the chance to ask any question I had.
1. Basic HR Questions
My first project was on cryptography. He asked me to explain the underlying concept in detail, how I implemented the code, and a few questions related to the cryptography concepts like CIA triad, why cryptography etc.
My second project was a banking system. He asked me to execute and show him the project if possible.
He also asked me about the tech stack used and asked me to explain the code for the various features I had implemented in my project
He asked me my motivation to work in tech and why I wanted to join the company.
Problem approach
Tip 1 : Know all the projects on your resume thoroughly
Tip 2 : If any tech stack mentioned in the resume, make sure you have a good understanding of it.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - Intern
4 rounds | 12 problems
Interviewed by Wells Fargo
Selected 
2971 views
0 comments
0 upvotes
SDE - 1
2 rounds | 7 problems
Interviewed by Wells Fargo
Selected 1845 views
0 comments
0 upvotes
SDE - Intern
4 rounds | 6 problems
Interviewed by Wells Fargo
Selected 912 views
0 comments
0 upvotes
Program Associate
3 rounds | 3 problems
Interviewed by Wells Fargo
Selected 926 views
0 comments
0 upvotes