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

SDE - 1

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

Interview preparation journey

expand-icon
Journey
It was really wonderful session throughout the interview journey and in which I answered properly and hence i got the offer via off campus .It was really very nice session over the interview as well as the test .
Application story
I got this opportunity via off campus and I answered very well in my interview and i was very truthful about my project explaination and don't try to copy paste your project if u haven't done it by your own.
Why selected/rejected for the role?
I got selected for the Program associate role because I gave my answer very well and the interviewer was very satisfied with all of my answers. Also if was not knowing the answer i told directly i don't know .
Preparation
Duration: 7 months
Topics: Data structure and algorithm, Operating System, DBMS, OOPS, Computer Network, Web Development, Project mentioned in resume
Tip
Tip

Tip 1 : Be very clear with your project explaination.
Tip 2 : Try to cover all the CS core subjects explaination clearly.
Tip 3 : Be confident with your personality .

Application process
Where: Naukri
Eligibility: 6.5 CGPA
Resume Tip
Resume tip

Tip 1 : Make it clean with appropriate kowledge.
Tip 2 : Provide accurate information and avoid telling lie in which You are not sure.

Interview rounds

01
Round
Medium
Video Call
Duration75 minutes
Interview date28 Apr 2022
Coding problem1

It was morning time and from 10:00 am . It happened via the google meet online process and it was very smooth onboarding . Interviewer was very friendly kind of nature .I answered very well and interviewer was also very satisfied with my answers.

1. Count Substrings With K Ones

Moderate
23m average time
0/80
Asked in companies
OlaMedia.netAmazon

You are given a binary array 'arr' of length 'N' and an integer 'k'. Return the number of subarrays having the count of 1's equal to ‘k’.


Example :
Let the array 'arr' be: [1, 0, 1].
Let ‘k’ be: 1

Then the subarrays having the number of ones equal to ‘k’ will be: [1], [1,0], [0,1], [1].
Problem approach

#include 
using namespace std;
int countSubStr(char str[])
{
int res = 0; // Initialize result

// Pick a starting point
for (int i = 0; str[i] != '\0'; i++) {
if (str[i] == '1') {
// Search for all possible ending point
for (int j = i + 1; str[j] != '\0'; j++)
if (str[j] == '1')
res++;
}
}
return res;
}

// Driver program to test above function
int main()
{
char str[] = "00100101";
cout << countSubStr(str);
return 0;
}

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date28 Apr 2022
Coding problem1

It was again the afternoon session, and the interviewer was very supportive and gave me a hint too to think the approach, and finally I came up the solution which he was expecting.

1. Longest Increasing Subsequence

Moderate
30m average time
65% success
0/80
Asked in companies
IBMVisaOYO

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
Problem approach

int longestSubsequence(int n, int a[])
{
vector v;

for(int i=0; i auto idx = lower_bound(v.begin(), v.end(), a[i]);
if(idx == v.end())
v.push_back(a[i]);
else
v[idx - v.begin()] = a[i];
}

return v.size();
}

Try solving now
03
Round
Easy
Video Call
Duration30 minutes
Interview date11 May 2022
Coding problem1

It was late evening, and happened in a very smooth way. And I was so happy since I was having the hope to get selected because it really went so well.

1. OS Questions

What are the different states of a process?

What is Reentrancy?

What is thrashing in OS?

What do you mean by asymmetric clustering?

What do you mean by Sockets in OS?

Problem approach

Tip 1 : Explain all the question of CS fundamentals with good real life examples .

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
company logo
SDE - 1
2 rounds | 7 problems
Interviewed by Wells Fargo
1845 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 9 problems
Interviewed by Wells Fargo
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Wells Fargo
943 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Wells Fargo
1191 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
6365 views
3 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
2197 views
0 comments
0 upvotes