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

SDE

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

Interview preparation journey

expand-icon
Journey
My B.Tech journey at IGDTUW was a thrilling experience that began with an orientation day full of excitement. As I progressed through my classes, I discovered the fascinating world of coding.
Application story
This company visited my campus for placements. We needed to apply for this opportunity on their career portal.
Why selected/rejected for the role?
I was rejected because I could not answer the second question in the third round. I believe that question was the reason I did not pass that round.
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Practice regularly on coding platforms and websites. Consistent coding practice is crucial for improving your problem-solving skills and familiarity with various algorithms and data structures. Set aside dedicated time each day to solve coding challenges on platforms like Code Studio. This consistent practice will enhance your coding proficiency and build confidence.

Application process
Where: Campus
Eligibility: Above 7 CGPA (Salary Package - 20 LPA)
Resume Tip
Resume tip

Tip 1: Include some projects on your resume.
Tip 2: Do not include false information on your resume.

Interview rounds

01
Round
Easy
Video Call
Duration45 minutes
Interview date26 Aug 2024
Coding problem2

The interview happens during the morning hours from 10 am to 10:45 am. This is our first round and it went well.

1. Chocolate Problem

Moderate
15m average time
85% success
0/80
Asked in companies
AdobePaytm (One97 Communications Limited)JP Morgan

Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/list represents the number of chocolates in the packet. There are ‘M’ number of students and the task is to distribute the chocolate to their students.

Try solving now

2. Distinct Subsequences

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

You have been given string 'S' of length 'N' that may contain duplicate alphabets. Your task is to return the count of distinct subsequences of it.

Try solving now
02
Round
Easy
Video Call
Duration45 minutes
Interview date27 Aug 2024
Coding problem2

This was my second round and it also went well.

1. Delete Kth node From End

Moderate
15m average time
95% success
0/80
Asked in companies
OracleMyntraGartner

Our task is to remove the 'K'th node from the end of the given Linked List and return the head of the modified linked list.

Try solving now

2. Arithmetic Expression Evaluation

Moderate
30m average time
70% success
0/80
Asked in companies
AdobeFacebookMicrosoft

You are given a string ‘expression’ consisting of characters ‘+’, ‘-’, ‘*’, ‘/’, ‘(‘, ‘)’ and ‘0’ to ‘9’, that represents an Arithmetic Expression in Infix Notation. Your task is to evaluate this Arithmetic Expression.

Try solving now
03
Round
Hard
Video Call
Duration60 minutes
Interview date28 Aug 2024
Coding problem2

I was not able to clear this round because I was not able to answer 2nd question of this round.

1. Longest Substring Without Repeating Characters

Moderate
20m average time
80% success
0/80
Asked in companies
Morgan StanleyHCL TechnologiesGartner

Given a string 'S' of length 'L', return the length of the longest substring without repeating characters.

Example:

Suppose given input is "abacb", then the length of the longest substring without repeating characters will be 3 ("acb").
Try solving now

2. Product of the Last K Numbers

Easy
15m average time
85% success
0/40
Asked in companies
MicrosoftSamsungApple

Given a sequence of queries of insertion and getProduct, you need to create an array using queries of type-0 and answer queries of type-1.

In each query, the input is of two types :

0 X: insert element ‘X’ at the end array.

1 K: find the product of the last 'K' elements in the array

Note:

For the query of type 1, you can assume that the array has at least k values. And at any time, the product of any contiguous sequence of numbers will fit into a single 32-bit integer without overflowing.
Problem approach

Step 1: Asked for all clarifications for the initial question.

Step 2: Explained the approach and coded the solution using a queue.

Step 3: The interviewer asked a follow-up question.

Step 4: Changed the solution to use an array instead of a queue, explained the changes, and coded the solution. The interviewer was satisfied.

Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - Intern
4 rounds | 12 problems
Interviewed by Wells Fargo
2442 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 7 problems
Interviewed by Wells Fargo
1447 views
0 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 6 problems
Interviewed by Wells Fargo
652 views
0 comments
0 upvotes
company logo
Program Associate
3 rounds | 3 problems
Interviewed by Wells Fargo
636 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE
2 rounds | 5 problems
Interviewed by Infosys
1201 views
0 comments
0 upvotes
company logo
SDE
2 rounds | 6 problems
Interviewed by Tata Consultancy Services (TCS)
1688 views
0 comments
0 upvotes
company logo
SDE
2 rounds | 5 problems
Interviewed by Infosys
852 views
0 comments
0 upvotes