# Wells Fargo FTE Interview Experience | On-Campus 2022

Wells Fargo visited our campus during the 1st week of August. First, they had a PPT, which was followed by a test. Criteria were 7+.Round 1(Online Test – 100 mins): The test was divided into 3 sectionsVerbal  Business AptitudeCodingVerbal: 12 questions in 15 mins based on detecting grammatical errors fill in the blanks and vocabulary.  Pro Tip: Start by looking at the question and search for the phrase/word which they are asking for in the question. I have given Wells Fargo tests during my Internship drive also, so I have noticed that their passages are connected, so don’t skip questions without reading.Business Aptitude: 15 questions in 25 mins. These were interpretation questions based on business graphs, candlesticks, etc.Pro Tip: Read the question first and then see which graph to refer to and which one to skip. Questions are designed in such a way that it contains a lot of unnecessary information so as to confuse the students.Coding: 2 Questions in 60 minutesA company system is attacked by a virus. The system has N running applications, each having a unique ID 0 to N-1. John has made an antivirus to detect the virus application in the system. John’s antivirus works on an algorithm. The algorithm finds the group value of the applications by dividing the sum of the IDs of all the applications by two. The ID of the application which is nearest to the group value is then marked as scanned and is removed from the list. The process then continues with the remaining applications until only one application is left. That remaining application is detected as a virus. The antivirus will then remove the file with a virus.Write an algorithm for John to find the ID of the file with a virus in the system.Example
Input:
4
1 3 5 7
Output: 5
Input:
4
1 2 3 4
Output: 5My Approach:In a while loop I calculated the sum of the array and deleted that element which was closest to sum/2. And this loop executed till there was only one element left.For example:Iteration 1: 1 2 3 4,
sum=10, sum/2 = 5, delete 4

Iteration 2: 1 2 3,
sum=6, sum/2 = 3, delete 3

Iteration 3: 1 2,
sum=3, sum/2 = 1, delete 1

At last only element 2 is present.
I was able to pass 10/11 Test
cases of this question.Second was a graph questionIn a state, there are N villages numbered 1 to N. The villages are connected to other villages by bidirectional roads. All the villages are connected to other villages either directly or via some other village. Also, there is only one road between any two villages. The rural funds were properly utilized if there exists exactly a single path between any two villages.Write an algorithm to output 1 if the rural funds were properly utilized else output 0.Input:
5
01010
10100
01010
10101
00010