Wells Fargo interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Wells Fargo
4 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
I was in my 3rd semester when I started coding. We had a session with seniors who briefed us about the internship season and how to prepare for them, which motivated me to start preparing for the same. I started with the Hackerrank Problem Solving section using C++. After practising around 75 problems on Hackerrank, moved to Leetcode where I used to solve the Daily Problems and give contests every Sunday that helped me to boost my problem-solving skills. The preparation continued in the 4th semester, solving DSA problems daily. Side by side, I also started learning development to build projects. We had an interview starting in August 2021 and it was January 2021, when I started learning development. Learned front-end development and build 2-3 projects using HTML, CSS and Javascript around the theme, 'DSA in real life'. In these projects, I used Data Structures like Heap, and Maps to solve real-life-based problems like minimising transactions and other such cases. We had a summer vacation from May-July, where I used to study almost every day, revise the studied topics and solve new coding problems daily!
Application story
Wells Fargo came to our college for the very first time, and we got a mail from the placement cell to apply for the same.
Why selected/rejected for the role?
I cleared all 4 rounds, solved all the problems in the online round, and gave my interviews explaining everything confidently and clearly. Communication plays a huge role in the selection, and I think I was able to express my ideas to the interviewers in a decent manner!
Preparation
Duration: 5 months
Topics: Data Structure, Algorithms, OOPS, Operating System, Frontend
Tip 1: Be consistent. Show up daily, and try to solve at least one coding problem every day!
Tip 2: Don't ignore theoretical subjects like OOPs, DBMS, Networking and Operating Systems
Tip 3: Give Contests regularly!
Application process
Where: Campus
Eligibility: 8 CGPA
Tip 1: Keep it clean and concise
Tip 2: Don't add unnecessary things which you're not confident about!
Interview rounds
01
Round
Easy
Online Coding Interview
Duration100 minutes
Interview date5 Aug 2021
Coding problem2
Timing: Morning. 120 students were shortlisted for this round out of 360.
It was online on the Amcat platform.
There were three parts to the online exam, namely Verbal, Business Analytics, and Coding.
1. Binary strings with no consecutive 1s.
Moderate
25m average time
65% success
0/80
Asked in companies
You have been given an integer 'N'. Your task is to generate and return all binary strings of length 'N' such that there are no consecutive 1's in the string.
A binary string is that string which contains only ‘0’ and ‘1’.
For Example:
Let ‘N'=3, hence the length of the binary string would be 3.
We can have the following binary strings with no consecutive 1s:
000 001 010 100 101
2. Next Permutation
Moderate
15m average time
85% success
0/80
Asked in companies
You have been given a permutation of ‘N’ integers. A sequence of ‘N’ integers is called a permutation if it contains all integers from 1 to ‘N’ exactly once. Your task is to rearrange the numbers and generate the lexicographically next greater permutation.
To determine which of the two permutations is lexicographically smaller, we compare their first elements of both permutations. If they are equal — compare the second, and so on. If we have two permutations X and Y, then X is lexicographically smaller if X[i] < Y[i], where ‘i’ is the first index in which the permutations X and Y differ.
For example, [2, 1, 3, 4] is lexicographically smaller than [2, 1, 4, 3].
Problem approach
Step 1: Start iterating through the given array from the end and identify the first index (called the "pivot") where the non-increasing suffix property is violated (i.e., where arr[i] < arr[i + 1]).
Step 2: If a pivot index cannot be found, it means that the given sequence in the array is already the largest possible, so swap the entire array. If a pivot index is found, continue iterating through the array from the end to find the first value that is greater than the pivot value.
Step 3: Swap the pivot and the successor, and then reverse the suffix portion of the array from the pivot index + 1 to the end (N) to minimize it.
02
Round
Medium
Video Call
Duration40 minutes
Interview date6 Aug 2021
Coding problem1
Timing: Morning. 29 students were shortlisted for the 2nd round.
So, in this round, I had one to one conversation with one of the executives of Wells Fargo. The interviewer was really friendly and made sure I was comfortable. He started by asking about me. I gave him the introduction and was then presented with a DSA Problem, which I had to solve on any compiler of my choice. First I had to explain the approach, and then code that. The problem was the Median of Two Sorted Arrays. I started explaining to him the Burte-Force approach using extra memory. He then told me to optimize it further, then I gave him an O(n^2) approach without using extra space. He again told me to optimize it, when I gave him the O(log(m+n)) approach for which he told me to code. After the problem, he asked basic questions on OOPs and OS like What is Inheritance? Give real-life examples. What is virtualization? The interview ended after that. And then I got a call for 2nd interview.
1. Median of two sorted arrays
Hard
25m average time
65% success
0/120
Asked in companies
Given two sorted arrays 'a' and 'b' of size 'n' and 'm' respectively.
Find the median of the two sorted arrays.
Median is defined as the middle value of a sorted list of numbers. In case the length of list is even, median is the average of the two middle elements.
The expected time complexity is O(min(logn, logm)), where 'n' and 'm' are the sizes of arrays 'a' and 'b', respectively, and the expected space complexity is O(1).
Example:
Input: 'a' = [2, 4, 6] and 'b' = [1, 3, 5]
Output: 3.5
Explanation: The array after merging 'a' and 'b' will be { 1, 2, 3, 4, 5, 6 }. Here two medians are 3 and 4. So the median will be the average of 3 and 4, which is 3.5.
Problem approach
Step 1: To find the median of two merged arrays, we split the arrays into two parts based on the mid value.
Step 2: We then compare the rightmost element in the left part of A with the leftmost element in the right part of B, and vice versa, to confirm the partition.
Step 3: If the partition is incorrect, we adjust the pointers and repeat the process until we find the correct partition.
Step 4: The median value depends on the total size of the merged array, and we take the average of the max of the left parts and min of the right parts for even-sized arrays or return the max value of the left parts for odd-sized arrays.
03
Round
Easy
Video Call
Duration30 minutes
Interview date6 Aug 2021
Coding problem1
For this round, only 11-12 people were shortlisted. I had a one-to-one call with one of the executives of Wells Fargo. The interviewer was really friendly. She introduced herself and asked about me. After that, she opened my Resume pdf on her computer and started asking me about all the things I have written. First, she asked about one of my previous internships. Questions like what did you learn? What were the difficulties? Then she started asking me about the projects. Questions like Why did you use the particular tech stack? What did you learn and the difficulties you faces? What more features can you add to it? So it was a proper Resume screening round where everything about your Resume will be asked so be thorough with what you have written! She then asked some 3-4 OOPs-related questions
1. OOPs Questions
What is Abstraction?
Difference between Abstraction and Encapsulation?
What are pure virtual functions?
Problem approach
Tip 1: Communicate properly, communication plays a huge role!
Tip 2: At the end of the interview, ask relevant questions to the interviewer
04
Round
Easy
HR Round
Duration5 minutes
Interview date6 Aug 2021
Coding problem1
Receive a call from HR. Questions like why should we hire you? Why Wells Fargo? Location Preference
1. Basic HR Questions
Why Wells Fargo? Introduce yourself. Any Location Preference?
Problem approach
Tip 1: Properly research the company.
Tip 2: Prepare for HR questions like why should we hire you etc.
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 - Intern
3 rounds | 4 problems
Interviewed by Wells Fargo
Selected 1158 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 7 problems
Interviewed by Wells Fargo
Selected 1484 views
0 comments
0 upvotes
SDE - Intern
4 rounds | 6 problems
Interviewed by Wells Fargo
Selected 912 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by Arcesium
Selected 3738 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by Arcesium
Selected 2683 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by BNY Mellon
Selected 2348 views
0 comments
0 upvotes