American Express Software Developer Interview Questions, Process, and Tips

Q1. Spring java and how do you leverage in your project
Ans. 
I leverage Spring Java for dependency injection, MVC framework, and transaction management in my projects.
• Utilize Spring's dependency injection to manage object dependencies and improve code maintainability

• Leverage Spring MVC framework for building web applications with clean separation of concerns

• Use Spring's transaction management to ensure data integrity and consistency in database operations
Answered by AI
Add your answer

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

Q1. A program to print 1 to n prime numbers
Ans. 
Program to print 1 to n prime numbers
• Iterate from 2 to n and check if each number is prime

• Use a function to check if a number is prime

• Print the prime numbers found
Answered by AI
Add your answer
Q2. Questions regarding rest api
Add your answer

Q1. All behavioural questions
Add your answer
Q2. Agile Principles
Add your answer

Normal DS Algo on HackerEarth

Q1. Past projects and experience discussion!
Add your answer
Q2. 2 DS Algo questions
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Word Break Problem Statement
You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.
The strings from A c...read more
Ans. 
Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.
• Iterate through all possible combinations of strings from the list to form the target string.

• Use recursion to try different combinations of strings.

• Check if the current combination forms the target string.

• Return true if a valid combination is found, otherwise return false.
Answered by AI
Add your answer
Q2. 
All Paths From Source Lead To Destination Problem Statement
In a directed graph with 'N' nodes numbered from 0 to N-1, determine whether every possible path starting from a given source node (SRC) eventua...read more
Ans. 
Determine if all paths from a source node lead to a destination node in a directed graph.
• Check if there is at least one path from source to destination.

• If a node has no outgoing edges, it should be the destination.

• Ensure the number of paths from source to destination is finite.

• Traverse the graph to validate all paths lead to the destination.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

Q1. 
Maximum Non-Adjacent Subsequence Sum
Given an array of integers, determine the maximum sum of a subsequence without choosing adjacent elements in the original array.
Input:
The first line consists of an...read more
Ans. 
Find the maximum sum of a subsequence without choosing adjacent elements in an array.
• Use dynamic programming to keep track of the maximum sum at each index, considering whether to include or exclude the current element.

• At each index, the maximum sum can be either the sum of the current element and the element two positions back, or the sum at the previous index.

• Iterate through the array and update the maximum sum accor...read more
Answered by AI
Add your answer
Q2. 
Find All Anagrams Problem Statement
Given a string STR and a non-empty string PTR, identify all the starting indices of anagrams of PTR within STR.
Explanation:
An anagram of a string is another string ...read more
Ans. 
Given a string STR and a non-empty string PTR, find all starting indices of anagrams of PTR within STR.
• Create a frequency map of characters in PTR.

• Use sliding window technique to check anagrams in STR.

• Return the starting indices of anagrams found.
Answered by AI
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.

Round duration - 20 Minutes
Round difficulty - Easy

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Maximum Sum With Specific Difference Problem Statement
Given an array of integers and a number 'K', your task is to find the maximum possible sum of disjoint pairs of numbers where the absolute difference...read more
Ans. 
Find maximum sum of disjoint pairs with absolute difference less than K in an array.
• Iterate through the array and sort it.

• Find all possible disjoint pairs with absolute difference less than K.

• Calculate the sum of these pairs to get the maximum sum.
Answered by AI
Add your answer
Q2. 
Ninja And The Tree Problem Statement
Ninja, while learning Binary Search Trees (BST), accidentally swapped two nodes in her self-constructed BST. Your task is to help Ninja by correcting the BST so that a...read more
Ans. 
The task is to correct a Binary Search Tree by swapping two nodes in the tree.
• Parse the input level order tree and construct the BST

• Identify the two nodes that are swapped incorrectly

• Swap the values of the incorrectly swapped nodes to correct the BST

• Return the corrected BST in level order form
Answered by AI
Add your answer