Wells Fargo interview experience Real time questions & tips from candidates to crack your interview

Program Associate

Wells Fargo
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 10 months
Topics: Data Structures, Algorithms, OOPs, Operating Systems, DBMS, Computer Networks.
Tip
Tip

Tip 1 : For DSA questions in interviews, start explaining from the brute force approach and then move to the optimal one. Convey your thought process to the interviewers, so that they can help you out if you get stuck. Communication skills matter a lot, and I think that is what makes the difference!
Tip 2 : Do some research about the company you are interviewing for and prepare the answers to the questions like Why should we hire you? (frame your answer in such a way that shows that your career goals align with the goals of the company), Why XYZ company?, Competitors of XYZ, etc. beforehand. Read about some latest news related to the company so that you can ask questions based upon that when the interviewer allows you to ask any question. This shows that you are genuinely interested to work for the company.
Tip 3 : Spend proper time making your resume and get it reviewed by seniors. Do not write anything that you are not confident of. Even if you write something that you don’t know, just be prepared that how you will defend it. The interviewers are much much experienced than you and they’ll catch you easily if you lie. So don’t take risks here.

Application process
Where: Campus
Eligibility: Above 6.50 CGPA
Resume Tip
Resume tip

Tip 1 : Try to include at least 1 development project in your resume.
Tip 2 : Do not write anything that you are not confident of. Even if you write something that you don’t know, just be prepared that how you will defend it.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date6 Nov 2021
Coding problem1

There were 3 sections: Verbal Section, Business Aptitude, and Coding.

1. MCQ Questions

English Proficiency, Business Aptitude, Data Interpretation


Number Of MCQs - 25

02
Round
Medium
Video Call
Duration50 minutes
Interview date1 Dec 2021
Coding problem2

It was a technical interview round where I was asked questions from my resume and questions based on DSA, OS, and DBMS.
The first interviewer asked me the following questions:

1. Detect the loop in the linked list and find the starting point of the loop. 
2. The question was like this: Given an array of strings, find the first unique string in the array. For example, the given array is {“apple”, “mango”, “pear”, “apple”, “orange”, “pear”}. Here, both “mango” and “orange” are occurring once, but the answer is “mango” since it occurs before “orange” in the array.

Then the second interviewer started asking the following questions:

1. He gave me the inorder and preorder traversals of a binary tree and asked me to find its postorder traversal. He was only interested in the final answer.
2. What is a stack? What are some practical applications of stack? What operations can we perform on stack?
3. Name the sorting algorithms based on Divide and Conquer.
4. What is Selection Sort? What is its time complexity?
5. What are the differences between Array and Linked List? When will you use each of them?
6. What is a Minimum Spanning Tree? What are the algorithms to find MST?
7. Since my projects were based on Web Development, he asked different HTTP methods and what is the difference between authentication and authorization?
8. Write a SQL query to display the top 5 people with the maximum salary from an Employee table.
9. How is memory allocated in C and C++?
10. What is deadlock?
11. What are the differences between Process and Thread?
12. What are the differences between RAM and ROM?
13. A puzzle
At last, the interviewer asked if I had any questions for him.

1. Detect the first node of the loop

Moderate
10m average time
90% success
0/80
Asked in companies
VisaAdobeFacebook

You are given a singly linked list that may or may not contain a cycle. You are supposed to return the node where the cycle begins, if a cycle exists, else return 'NULL'.


A cycle occurs when a node's next pointer returns to a previous node in the list.


Example:
In the given linked list, there is a cycle starting at position 0, hence we return 0.

Sample Example 1

Try solving now

2. Puzzle Question

3 Friends Bike and Walk

03
Round
Easy
HR Round
Duration10 minutes
Interview date1 Dec 2021
Coding problem1

1. Basic HR Questions

Where do you live?

Are you willing to relocate?

Where did you do your internship?

Why you chose IIT BHU, instead of IIT K?

 

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
company logo
Program Associate
4 rounds | 5 problems
Interviewed by Wells Fargo
0 views
0 comments
0 upvotes
company logo
Program Associate
3 rounds | 3 problems
Interviewed by Wells Fargo
792 views
0 comments
0 upvotes
company logo
Program Associate
3 rounds | 3 problems
Interviewed by Wells Fargo
889 views
0 comments
0 upvotes
company logo
Program Associate
3 rounds | 3 problems
Interviewed by Wells Fargo
904 views
0 comments
0 upvotes