Wells Fargo Technology Analyst Interview Questions and Answers

Q1. Equals and hashcode implementation
Add your answer
Q2. Config server configuration steps
Ans. 
Config server configuration steps
• Install and set up the config server software

• Configure the server with the necessary properties and settings

• Define the repository for storing configuration files

• Create and manage configuration files

• Ensure proper security measures are in place

• Test and validate the configuration

• Monitor and maintain the config server
Answered by AI
Add your answer
Q3. Patch mapping in spring rest
Ans. 
Patch mapping in Spring REST is used to partially update resources.
• Patch mapping allows clients to send only the fields that need to be updated instead of sending the entire resource.

• It is useful when updating large resources or when clients have limited bandwidth.

• Spring provides the @PatchMapping annotation to handle patch requests.

• The @PatchMapping annotation can be used with a specific URL or with a wildcard URL pat...read more
Answered by AI
Add your answer

Discussing the merits and drawbacks of different workplace initiatives

Q1. Discuss Database Design
Ans. 
Database design involves creating a structure that efficiently stores and organizes data for easy retrieval and manipulation.
• Identify the data requirements and relationships between different entities

• Normalize the database to reduce redundancy and improve data integrity

• Choose appropriate data types and constraints for each field

• Create indexes to optimize query performance

• Consider scalability and future growth when desi
Answered by AI
Add your answer
Q2. Logical thinking on how to evacuate a retail store and how you would prioritise.
Add your answer

Q1. Why do you want to join JPMC
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

The round was conducted early in the morning.There were 3 sections:
1.Aptitude based on Maths and Logic
2.Questions based of core subjects and basic Data Structures
3.Coding Round -2 questions

Q1. Minimum Number Of Vertices To Reach All Nodes
Given a directed acyclic graph having ‘N’ nodes. A matrix ‘edges’ of size M x 2 is given which represents the ‘M’ edges such that there is an edge directed fro...read more
Ans. 
I applied DFS to solve this problem.
Answered by CodingNinjas
View 3 more answers
Q2. Box Stacking
You are given a set of ‘n’ types of rectangular 3-D boxes. The height, width, and length of each type of box are given by arrays, ‘height’, ‘width’, and ‘length’ respectively, each consisting ...read more
Ans. Brute Force
• This is a recursive approach.
• Make an integer matrix ‘boxes’ of dimension (3*n, 3), we will store all three rotations of each type of boxes in it.
• Generate all 3 rotations for all ‘n’ types of boxes,  for simplicity we will consider ‘width’ always smaller than or equal to ‘length’. Store them in matrix ‘boxes’ such that boxes[i][0], boxes[i][1], boxes[i][2] give height, width, length of ‘i’th box respecti...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 90 Minutes
Round difficulty - Medium

A face to face interview was scheduled with the interviewer.I was asked to solve a few coding questions and then asked questions based on OS and OOPS and some questions related to the working of my projects.

Q1. Sort 0 1
You have been given an integer array/list(ARR) of size N that contains only integers, 0 and 1. Write a function to sort this array/list. Think of a solution which scans the array/list only once an...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered by CodingNinjas
Add your answer
Q2. Flatten A Linked List
You are given a linked list containing N nodes, where every node in the linked list contains two pointers, first one is ‘NEXT’ which points to the next node in the list and the second...read more
Ans. Brute Force
The idea is to use an extra array to first store all the elements of the linked list and then sort the array and finally put those elements back into the linked list and return.
 
• Declare an array ‘Answer’ to store the elements of the linked list.
• Run a while loop till the next of the linked list reaches NULL.
  • Add the current pointer data to Answer.
  • Inside this loop, traverse the CHILD nodes of the current n...read more
Answered by CodingNinjas
View 2 more answers
Q3. OS Questions
Basic Questions on Scheduling Algorithms
Difference between Processes and Thread
Disk Scheduling Algorithms-I was asked to explain the difference between the algorithms
LRU Page replacement and th...read more
Ans. 
Tip 1 : Go through the topics and understand the concept and the difference between the different algorithms you read.
Tip 2 : Be confident while explaining to the interviewer and try explaining the important points.
Answered by CodingNinjas
Add your answer
Q4. DS Questions
I was asked to explain the basic oops concepts. I did that using real-life examples.
Difference between abstraction and interface.
Virtual Functions
Method Overloading and overriding
Ans. 
Tip 1 : The concepts should be clear and explaining using examples around you shows that you have clarity.
Answered by CodingNinjas
Add your answer

Round duration - 40 Minutes
Round difficulty - Easy

I was asked basic HR questions and some questions based on my resume.
 

Q1. Basic HR Questions
Introduce yourself
Where do you see yourself in 2-3 yrs
What are your hobbies
How do you feel you have done something productive
If you were forced to work with someone you don't like, what w...read more
Add your answer

Q1. During the hackathon, I was asked about what I felt about the team dynamics and what strategies I would take to ensure everyone arrives at consensus to work together.
Add your answer

Q1. I was asked to explain a college project and was asked follow on questions on the same
Add your answer
Q2. Questions on linked lists, algorithm to identify 2nd, 3rd connections on a site like LinkedIn. I was asked some other data structure questions that I don't recollect as this interview took place years ago
Add your answer