American Express Software Developer Interview Questions, Process, and Tips

Q1. How to implement security in microservices
Ans. 
Implement security in microservices by using authentication, authorization, encryption, and monitoring.
• Use authentication mechanisms like OAuth, JWT, or API keys to verify the identity of clients accessing the microservices.

• Implement authorization controls to define what actions users can perform within the microservices.

• Encrypt data in transit and at rest using protocols like HTTPS and TLS, and tools like Vault or AWS...read more
Answered by AI
Add your answer

There were three coding questions.

Q1. Could you provide a thorough explanation of the project?
Add your answer
Q2. OOps Concepts and question from the technical subjects
Add your answer
Q3. Why Spring Boot
Add your answer
Q4. JWT Authentication
Add your answer
Q5. Docker and Kubernetes
Add your answer

Q1. Functional interface
Add your answer
Q2. Find if array of numbers, which are prime, using streams
Ans. 
Use streams to find prime numbers in an array
• Use Java streams to filter out non-prime numbers from the array

• Check if a number is prime by dividing it by all numbers less than its square root

• Create a method to check if a number is prime
Answered by AI
Add your answer

Basic coding questions were asked , majorly focused on graph and trees

Q1. Explain your projects
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. Word Break
You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.
Note :
You can use any string of A mult...read more
Ans. Brute Force
In this solution, we will try to generate all prefixes and If we want a prefix present in the string then we will recur for the remaining string. 
Steps:
1. Store all strings of A on the hash map.
2. Declare and call function wordBreakHelper which will take a single argument string.
wordBreakHelper(s):
1. Base case if the length of the string is 0 then return true.
2. Run a loop from i = 1 to the length of the string:
   • If ...read more
Answered by CodingNinjas
View 3 more answers
Q2. All Paths From Source Lead To Destination
There is a directed graph consisting of ‘N’ nodes numbered from 0 to ‘N’-1. You are given a list ‘EDGES’ of size ‘M’, consisting of all the edges of this directed...read more
Ans. Depth First Search
All the paths starting from node ‘SRC’ eventually end at node ‘DEST’ if -:
1. Node ‘DEST’ is reachable from ‘SRC’.
2. There is no outgoing edge from node ‘DEST’.
3. No cycle is reachable from ‘SRC’.
We can check these conditions using the Depth First Search algorithm as follows -:
 
Algorithm
• Create a list of lists ‘ADJ’ of size ‘N’.
• Create an adjacency list of the given directed graph. This can be done by runnin...read more
Answered by CodingNinjas
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Q1. Maximum sum of non-adjacent elements
You are given an array/list of ‘N’ integers. You are supposed to return the maximum sum of the subsequence with the constraint that no two elements are adjacent in the ...read more
Ans. Recursive Approach (top down)
We are going to explore all the possibilities of subsequences in which there will be no two elements that are adjacent to one another in the given array/list. So if we take the current element, let’s say ‘CURR’ then we are not allowed to take the element adjacent to ‘CURR’. So for that, we will call a recursive function one step forward to the ‘CURR’. 
 
The Steps are as follows:
&nb...read more
Answered by CodingNinjas
View 2 more answers
Q2. Find all anagrams
You have been given a string STR and a non-empty string PTR. Your task is to find all the starting indices of PTR’s anagram in STR.
An anagram of a string is another string which contai...read more
Ans. Brute Force Approach
We have a brute force solution to this problem. We find all substrings of STR of length M (length of PTR) and store indices of those substrings in ‘ANAGRAM_INDICIES’ which are the anagrams of given string PTR.
 
Here is the complete algorithm - 
 
1. We store the count of characters of ‘PTR’ in array ‘PTR_MAP’. Index of a character ‘CH’ is given by 'CH’ - ‘A’.
2. Now, we traverse ‘STR’ and find ...read more
Answered by CodingNinjas
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

First half of the interview was based on DBMS, OS and some puzzles. Second half was dedicated to projects related questions.

Q1. DBMS Questions
1. SQL query to find second highest salary?
2. Join questions
3. Write a query to find the Nth highest salary from the table without using TOP/limit keyword.
Ans. 
Tip 1 : Do Top 30 SQl questions from edureka -----
Answered by CodingNinjas
Add your answer
Q2. Puzzle
1. Camel and Banana Puzzle
2. Tell me about the projects you worked on
3. Asked me some questions related to my projects
Ans. 
Tip 1 : Do Top 20 Puzzles Commonly Asked During SDE Interviews
Tip 2 : Be confident about everything you mention on your resume
Answered by CodingNinjas
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

Q1. Basic HR questions
1. Tell me your biggest strength and weakness
2. Why do you want to join our company?
3. What will you do if someone in your team is not contributing to the project at all?
Ans. 
Tip 1 : Be prepared with HR questions and don't be negative in your answers
Answered by CodingNinjas
Add your answer