American Express Software Developer Interview Questions, Process, and Tips

90 mins in Codility platforms

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. 
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. Sorting
Approach: We sort the given array in increasing order. For every element, we try to pair it with its previous element first. Since the array is sorted, the value of ‘ARR[i]’ would be more than ‘ARR[i - 1]’. We need to pair with a difference less than ‘K’, which means if 'ARR[i - 2]' can be paired, then ‘ARR[i - 1]’ can also be paired in a sorted array. Here, we prefer the previous element so that if ‘ARR[i]’ - ‘...read more
Answered Anonymously
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. Brute Force Approach
Algorithm:
 
1. We will initialize an array of integers to store the inorder traversal of the given BST.
2. As two nodes are swapped currently, so the inorder traversal will not be sorted.
3. Sort the array.
4. Now, this is a sorted array so this will represent the inorder traversal of the BST.
5. Insert the array elements back to the tree inorder manner.
Space Complexity: O(n)Explanation:
O(N), where ‘N’ is the num...read more
Answered Anonymously
Add your answer