Wells Fargo interview experience Real time questions & tips from candidates to crack your interview
Program Associate
Wells Fargo
4 rounds | 5 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 6 months
Topics: OOPS, DS, DBMS, Web Development, Computer networks
Tip 1 : Clear with you content present in your resume.
Tip 2 : Maintain good knowledge of DSA and all cs fundamentals.
Tip 3 : Soft skill is very important along with technical knowledge (try to practice in front of a mirror and camera).
Application process
Where: Naukri
Tip 1 : Make it simple and clear and avoid short forms.
Tip 2 : Mention only honest details in your resume and avoid spelling errors.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date23 Apr 2022
Coding problem2
It was for 90 minutes.
Consists of 2 coding questions and 30 MCQs questions a verbal section, a quantitative section, and analytical based questions.
1. Minimum Number Of Moves To Get All Keys
Moderate
25m average time
80% success
0/80
Asked in companies
Some players are put inside an ‘N’ x ‘M’ matrix ‘GRID’ one by one where:
- ‘.’ represents an empty cell.
- ‘#’ represents a wall.
- ‘@’ represents the starting point.
- Lowercase letters represent keys.
- Uppercase letters represent locks.
The player to collect all the keys in minimum moves will win the game. The ninja is one of the players and needs your help to win the game. He wants you to find the minimum number of moves to get all the keys. The rules of the game are:
- You have to start from the starting point and move in one of the four cardinal directions.
- You cannot walk outside the grid or walk into a wall. You can pick a key whenever you walk over it.
- You cannot walk over a lock unless you have the corresponding key. For example, the key for the lock ‘A’ is ‘a’.
- There is exactly one key for each lock.
For Example:
You are given ‘GRID’= [[“@.aA”],[“.B#.”],[“...b”]]. Then the answer will be 5.
Problem approach
I solved this question simply by using the for loop .
By taking odd and even concepts.
#program
int find_min(int a[], int n, int k) {
int sm=0,ans=0;
for(int i=0;i=k)
return ((k-1)*2)+n+1;
else
return (2*ans)+n+(k-ans);
}
2. Next Greater Element
Easy
10m average time
90% success
0/40
Asked in companies
You are given an array 'a' of size 'n'.
Print the Next Greater Element(NGE) for every element.
The Next Greater Element for an element 'x' is the first element on the right side of 'x' in the array, which is greater than 'x'.
If no greater elements exist to the right of 'x', consider the next greater element as -1.
For example:
Input: 'a' = [7, 12, 1, 20]
Output: NGE = [12, 20, 20, -1]
Explanation: For the given array,
- The next greater element for 7 is 12.
- The next greater element for 12 is 20.
- The next greater element for 1 is 20.
- There is no greater element for 20 on the right side. So we consider NGE as -1.
02
Round
Medium
Video Call
Duration50 minutes
Interview date28 Apr 2022
Coding problem1
This round was based on data structure and algorithm and oops concepts and also cs fundamental subjects.
Also, the interviewer asked me about the basics of data structure theory and one coding question he gave me to solve.
Asked about the pointer concepts.
1. Convert A Given Binary Tree To Doubly Linked List
Moderate
15m average time
80% success
0/80
Asked in companies
Given a Binary Tree, convert this binary tree to a Doubly Linked List.
A Binary Tree (BT) is a data structure in which each node has at most two children.
A Doubly Linked List contains a previous pointer, along with the next pointer and data.
The order of nodes in Doubly Linked List must be the same as Inorder of the given Binary Tree.
The doubly linked list should be returned by taking the next pointer as right and the previous pointer as left.
You need to return the head of the Doubly Linked List.
For the given binary tree :
You need to return the head to the doubly linked list.
The doubly linked list would be: 1 2 3 4 5 and can be represented as:
Problem approach
I solved this question using the inorder squence means first i traversed the left subtree part and then i updated the head and the previous node and at last I traversed the right sub tree part.
#pragram:
void solve(Node*root,Node*&head,Node*&prev,int &f){
if(!root)return;
solve(root->left,head,prev,f);
if(f==0){
f=1;
head=root;
prev=root;
}
else{
prev->right=root;
prev->right->left=prev;
prev=prev->right;
}
solve(root->right,head,prev,f);
}
Node * bToDLL(Node *root)
{
// your code here
int f=0;
Node*head=NULL;
Node*prev=NULL;
solve(root,head,prev,f);
return head;
}
03
Round
Medium
Video Call
Duration50 minutes
Interview date28 Apr 2022
Coding problem1
This round happened for approximately 50 minutes and in this, the interviewer asked me all the questions from the content which I mentioned in my resume. He asked me about my projects and then he asked me about my final year project also which was still going on and then he asked me about my internship which I mentioned in my resume.
Also, he asked me a few questions about the Operating system and DBMS.
1. OS Questions
What is Paging?
What is segmentation?
Problem approach
Tip 1 : You can start answering from the scratch and to the point answer.
Tip 2 : Be very honest with the answer to your project section mainly.
Tip 3 : Don't copy the project and try to explain your thought process in a very smart and clear way.
04
Round
Easy
HR Round
Duration20 minutes
Interview date11 May 2022
Coding problem1
In this round, he just asked me about my family background and then he asked me some of the behavioral type question and also he asked if I have any other offer in my hand(i told yes as I was having ORACLE COMPANY)
1. Basic HR Questions
How will you manage if conflict happens among your team?
What do your father and mother do?
Do you have any other offer in hand?
Problem approach
Tip 1 : Make sure you don't lie about your family background.
Tip 2 : Don't lie about your score.
Tip 3 : Be truthful and be normal and answer it in a very calm way.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
Program Associate
3 rounds | 4 problems
Interviewed by Wells Fargo
Selected 
1778 views
0 comments
0 upvotes
Program Associate
3 rounds | 3 problems
Interviewed by Wells Fargo
Selected 793 views
0 comments
0 upvotes
Program Associate
3 rounds | 3 problems
Interviewed by Wells Fargo
Selected 889 views
0 comments
0 upvotes
Program Associate
3 rounds | 3 problems
Interviewed by Wells Fargo
Selected 905 views
0 comments
0 upvotes