Upload Button Icon Add office photos

Filter interviews by

American Express Software Developer Interview Questions, Process, and Tips for Freshers

Updated 10 Jan 2025

Top American Express Software Developer Interview Questions and Answers for Freshers

  • Q1. Maximum Sum With Specific Difference You are given an array of integers and a number ‘K’. You can pair two elements in the array 'ARR' if the absolute difference between ...read more
  • Q2. Ninja And The Tree Ninja is learning tree data structure these days. While learning, she came across learn about the Binary Search tree. She found BST quite interesting. ...read more
  • Q3. Intersection of Linked List Given 2 linked lists which merge at some point. Find the node at which the lists merge.

American Express Software Developer Interview Experiences for Freshers

3 interviews found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

There were three coding questions.

Round 2 - Technical 

(5 Questions)

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

I was interviewed before Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. Maximum Sum With Specific Difference

    You are given an array of integers and a number ‘K’. You can pair two elements in the array 'ARR' if the absolute difference between them is strictly less than ...

  • 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]’ - ‘...

  • Answered by CodingNinjas
  • Q2. Ninja And The Tree

    Ninja is learning tree data structure these days. While learning, she came across learn about the Binary Search tree. She found BST quite interesting. She decided to make her own Binary ...

  • 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...

  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Developer in BangaloreEligibility criteriaAbove 7 CGPAAmerican Express interview preparation:Topics to prepare for the interview - OOPs concept. Various concepts like static, non-static, virtual function, abstract class, interface, etc. Dynamic programming(imp), Data Structures - Linked List, Graph, stack , queue, treeTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : Solve Code chef long challenges
Tip 2 : Solve at least problem A, B,C of codeforces competition(help to solve problems in time limit).
Tip 3 : Having at least 1 good project is a plus point.

Application resume tips for other job seekers

Tip 1 : Not more than 2 pages(1 page is good)
Tip 2 : Must know about each and every point in the resume.
Tip 3 : There should be no grammatical error in the resume.

Final outcome of the interviewRejected

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies for Fresher

asked in Amazon
Q1. Maximum Subarray SumGiven an array of numbers, find the maximum s ... read more
asked in Nagarro
Q2. Crazy NumbersNinja loves playing with numbers. So one day, he wan ... read more
Q3. Find Duplicate in ArrayYou are given an array of integers 'ARR' c ... read more
asked in Blackrock
Q4. Greatest Common DivisorYou are given two numbers, ‘X’ and ‘Y’. Yo ... read more
asked in TCS
Q5. Find PalindromesYou are given an integer ‘N’. Your task is to fin ... read more

Software Developer Interview Questions & Answers

user image CodingNinjas

posted on 16 Sep 2021

I was interviewed before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.

  • Q1.  Detect Loop

      Detect loop in a linked list.

  • Ans. 
    • First I told the interviewer, hashing approach to detect cycle then I moved to optimized solution that was through two pointers concept. The interviewer was satisfied with my approach.
  • Answered by CodingNinjas
  • Q2. Intersection of Linked List

     Given 2 linked lists which merge at some point. Find the node at which the lists merge.

  • Ans. 
    • First I suggested the brute force approach in which we check each element of the first linked list with each element of other linked list and then moved on to the better-optimized solution using linked list traversal based on the difference of lengths of both linked list.
  • Answered by CodingNinjas
Round 2 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

This round was mostly focused on my resume and projects.

  • Q1. Tell me about your projects.
  • Ans. 
    • I started explaining my projects through the objective and motive of the project. Then explained to him about the database schema and technology used in the project. Then I moved to the flow chart and explained to him the flow of each project.

            Tip: Do prepare tech stack which is used by you in the project.

  • Answered by CodingNinjas
Round 3 - Face to Face 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience. 
 

  • Q1. I was asked questions related to how credit card business works which was related to working of company.
  • Ans. 
    • This was basically a company-related question and maybe they wanted to check if I've studied about the company. It was more of a conversational round and I answered the questions pretty confidently. And finally got the offer after this round.
  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. I applied for the job as SDE - 1 in GurgaonAmerican Express interview preparation:Topics to prepare for the interview - Data structures and algorithms, Object-Oriented Programming System concepts, Database Management System, Operating System, Networking.Time required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Do practice a lot of data structures questions as mostly questions in interviews are based on them. Also, do prepare for projects mentioned in your resume and skills which you have mentioned. Coding ninjas has a big hand in making my interview clear as I have taken a course from the coding Ninjas which helped me a lot to make my concepts clear.

Application resume tips for other job seekers

Keep it short and crisp. Go through it properly before the interview. Make sure that you haven't put anything in it that can cause you problems during the interview.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Technical 

(2 Questions)

  • Q1. This was for internship. The first questions were 10 questions based on guessing output of c program
  • Q2. 2 coding questions with easy to medium difficulty based on strings and mathematical knowledge
Round 2 - Interview 

(1 Question)

  • Q1. This was a virtual interview round which had basic HR type questions.
Round 3 - Hackathon 

(1 Question)

  • Q1. This was code for good hackathon
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

DP graphs strings it was good

Round 2 - Technical 

(2 Questions)

  • Q1. Reverse a linkded list
  • Ans. 

    Reverse a linked list by changing the direction of pointers

    • Start with three pointers: current, previous, and next

    • Iterate through the list, updating pointers to reverse the direction

    • Return the new head of the reversed list

  • Answered by AI
  • Q2. Print fibonacci series
  • Ans. 

    The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.

    • Start with two variables initialized to 0 and 1

    • Loop through desired number of iterations, adding the previous two numbers to get the next number

    • Print or store each number in the series

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Internshala and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Coding Test 

DSA and array with graph skills 2:00 hours , leetcode

Round 2 - HR 

(2 Questions)

  • Q1. Tell me about yourself
  • Ans. 

    I am a passionate software developer with experience in building web applications using various technologies.

    • Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular

    • Proficient in backend development with Node.js and databases like MongoDB and MySQL

    • Familiar with version control systems like Git and deployment tools like Heroku

    • Strong problem-solving skills and ability

  • Answered by AI
  • Q2. Why we should considered

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA well
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jan 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

It was just a typical logical reasoning and aptitude MCQ test

Round 3 - Coding Test 

There were 2 coding questions and you can select any language for solving it. The test was online

Round 4 - Technical 

(13 Questions)

  • Q1. He simply asked me which coding language I prefer and why ? (Mine was C++)
  • Q2. Difference between C and C++?
  • Ans. 

    C is a procedural programming language while C++ is an object-oriented programming language.

    • C is a procedural programming language, while C++ supports both procedural and object-oriented programming.

    • C does not have classes and objects, while C++ does.

    • C does not support function overloading, while C++ does.

    • C does not have exception handling, while C++ does.

    • C does not have namespaces, while C++ does.

  • Answered by AI
  • Q3. What is Object oriented programming?
  • Ans. 

    Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.

    • Objects are instances of classes, which define the structure and behavior of the objects.

    • Encapsulation, inheritance, and polymorphism are key principles of object oriented programming.

    • Example: Inheritance allows a class to inherit properties and methods from another class.

    • Example: Encapsulation hides t...

  • Answered by AI
  • Q4. What are the 4 pillars of OOPs?
  • Ans. 

    Encapsulation, Inheritance, Polymorphism, Abstraction

    • Encapsulation: Bundling data and methods that operate on the data into a single unit

    • Inheritance: Ability of a class to inherit properties and behavior from another class

    • Polymorphism: Ability to present the same interface for different data types

    • Abstraction: Hiding the complex implementation details and showing only the necessary features

  • Answered by AI
  • Q5. Write down code implementing all 4 pillars of OOPs.
  • Ans. 

    Code implementing all 4 pillars of OOPs

    • Encapsulation: Encapsulate data within classes and provide public methods to access and modify the data.

    • Inheritance: Create a hierarchy of classes where child classes inherit attributes and methods from parent classes.

    • Polymorphism: Allow objects of different classes to be treated as objects of a common superclass through method overriding and overloading.

    • Abstraction: Hide complex ...

  • Answered by AI
  • Q6. Difference between Stacks and Queues?
  • Ans. 

    Stacks are Last In First Out (LIFO) data structures, while Queues are First In First Out (FIFO) data structures.

    • Stacks: Elements are added and removed from the same end, like a stack of plates. Example: Undo feature in text editors.

    • Queues: Elements are added at the rear and removed from the front, like a line of people waiting. Example: Print queue in a printer.

  • Answered by AI
  • Q7. Write a code to find the 2nd largest element in an array.
  • Ans. 

    Code to find the 2nd largest element in an array

    • Sort the array in descending order and return the element at index 1

    • Iterate through the array and keep track of the two largest elements

    • Handle edge cases like arrays with less than 2 elements

  • Answered by AI
  • Q8. What is merge sort and its Algorithm ?
  • Ans. 

    Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges them.

    • Divide the input array into two halves

    • Recursively sort each half

    • Merge the sorted halves back together

  • Answered by AI
  • Q9. What is DBMS and RDBMS and difference between them?
  • Ans. 

    DBMS stands for Database Management System, while RDBMS stands for Relational Database Management System. RDBMS is a type of DBMS.

    • DBMS is a software system that allows users to define, create, maintain and control access to the database.

    • RDBMS is a type of DBMS that stores data in a structured format using tables with rows and columns.

    • RDBMS enforces a set of rules called ACID properties to ensure data integrity, while D...

  • Answered by AI
  • Q10. What is SQL and who its different from mySQL?
  • Ans. 

    SQL is a standard language for managing databases, while MySQL is a specific open-source relational database management system.

    • SQL stands for Structured Query Language and is used to communicate with databases.

    • SQL is a standard language that can be used with various database management systems.

    • MySQL is a specific open-source relational database management system that uses SQL.

    • MySQL is one of the most popular database m...

  • Answered by AI
  • Q11. Difference between Delete, Truncate and Drop?
  • Ans. 

    Delete removes specific rows from a table, Truncate removes all rows from a table, and Drop removes the table itself.

    • Delete is a DML command that removes specific rows from a table based on a condition.

    • Truncate is a DDL command that removes all rows from a table but keeps the table structure.

    • Drop is a DDL command that removes the entire table along with its structure.

  • Answered by AI
  • Q12. Different kind of Joins in DBMS ?
  • Ans. 

    Different types of joins in DBMS include inner join, outer join, left join, right join, and full join.

    • Inner join: Returns rows when there is a match in both tables.

    • Outer join: Returns all rows from one table and only matching rows from the other table.

    • Left join: Returns all rows from the left table and the matched rows from the right table.

    • Right join: Returns all rows from the right table and the matched rows from the ...

  • Answered by AI
  • Q13. And at last 2 to 3 SQL queries. They were not that hard, Just basic queries.

Interview Preparation Tips

Interview preparation tips for other job seekers - Well be prepared with DSA,OOPs and DBMS concept. If you don't know BST or Graphs or Heaps that well, no problem just be confident. Most of the times they don't ask anything more that linked list.
If you don't know the answer of a coding question (NOTE: not a theoretical question) try for sometime to come up with the solution and while thinking keep saying your approach out loud to the interview and if after taking 1 to 2 mins you still don't know just say, Sorry I can't recall it right now but I will definitely get to it after the interview. Don't use this approach for theoretical questions, Either you have an answer to that or not.
Never Beat around the bush, be specific and to the point.

And at last, I just wanna say that passing an interview needs 40% skill, 20% communication, 20% confidence, 10% mood of the interview and 10% is luck.

Why I am saying mood of the interview and luck????
In my case, I was not selected for the final HR round. First of all, in all 137 students selected for the technical interview, my name was at 111 and randomly they called the first student for the interview and it was me. So that's luck.
OK after I entered my interviewer cabin, I saw a look of aggression on my interviewers face. We didn't smiled once during my 50min interview. He didn't even asked me to introduce myself.

He asked me 15 questions in total and I correctly answers 10 of them to the point and for the rest 5 I explained my approach to them.
Still I got rejected, and one of my friend who was answered like 2 questions out of 10 got selected because his interviewer was different. (NOTE: I am really happy for my friend, He is like my best buddy and my only well wisher that I know about).

So yeah just prepare well and be confident and even if things go south and you gave your best, just think that today was not your day and just move on.

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Jul 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. 1st Question was if we could obtain a string by swapping position from a given string 2nd Question was basic 0/1 knapsack problem 3rd Question was to write a sql query 4th Question was related to Java ex...

Interview Preparation Tips

Round: Technical Interview
Experience: Technical on paper test questions:(dis was only for 12 among d 26 shortlisted ppl after apti...others directly had interviews)
5 wer selected in this test who wer nw sent for interviews
TECHNICAL INTERVIEW: (pls list the questions asked in all the rounds)
26 shortlisted after apti (14 directly for interviews & 12 had one more technical on paper test...mentioned above)
der wer min 2 technical rounds for each of them...max were 5

- You are given course dependencies
A->B,C
B->D
C->A
D->nothing
The above dependencies mean...if you want to take course A...you should take courses B and C first....To take B,Course D must be taken first....D is an independent course and can be taken without any prior requirements.
Now you are told these dependencies.Come up with an appropriate data structure to represent these dependencies.Then write a code that finds out all the courses that the student can take up...in this case the student can first take course D because its independent.Now that course D has been taken he can next take up B as it depends on B alone...But the courses A and C can never be taken because they depend on each other...So here all the courses that can be taken are B and D.
After i wrote the code....he asked for all possible test cases
-Given an array of length N....It can be filled with nos. only from 1 to N....find which nos are repeated in the array
-Given pointers to two nodes in a binary tree....find their least common ancestor...each node has pointer to only the parent node...not the left and right child..
-In a binary tree(Not necessarily a BST)...suppose the weight of any node is defined as the product of the key value of the node and the level of the node(Root at level 1)...find the node with maximum weight in the binary tree
-A sorted array of size n is right circularly rotated k times and this rotated array is given to you as input...Find out the value of k in log n time .
-There are some processes running at time T....and there are processes running at time T+30.
You have to find out
1)Which processes died at time T+30,which were alive at time T
2)Which are the new processes at time T+30,which were not there at time T
3)Which are the processes that were there at time T and are still running at time T+30
What data structure will you use to represent the process lists and write code to find out the answers to the 3 questions above
-Given a binary search tree...and a target sum...starting at the root...which all paths add up to the target sum?...if there are multiple paths....return the path with least no. of nodes.


College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Interview Preparation Tips

Round: Test
Experience: The first round was an online test with maths, logic and english questions. If you have prepared for any of the standardised tests (GMAT, GRE, CAT etc.), the test would be pretty simple. And try to answer as many questions as possible.
Tips: It would be really helpful if you give atleast your first attempt to any of the exams like GMAT, GRE etc. This is only for the online test because the pattern is quite similar to GMAT. For the interviews, be prepared for a set of standard questions asked during interviews that you can easily find online.

General Tips: Be prepared to spend all day at the interviews. You might not even get a lunch break. Sometimes the interview calls are late at night and also extend upto 2-3am. Be alert during the Pre-placement talk because the interviewers ask you questions from that too. I would advice you to ask questions to the interviewer when asked to regarding the company.
Don't write fake stuff in resume. At max you can exaggerate a bit in your CV. The panel does question you on your CV. Everything in it must be justified.
Skills:
College Name: NIT Surathkal

American Express Interview FAQs

How many rounds are there in American Express Software Developer interview for freshers?
American Express interview process for freshers usually has 2 rounds. The most common rounds in the American Express interview process for freshers are Coding Test and Technical.
What are the top questions asked in American Express Software Developer interview for freshers?

Some of the top questions asked at the American Express Software Developer interview for freshers -

  1. find if array of numbers, which are prime, using stre...read more
  2. Spring java and how do you leverage in your proj...read more
  3. How to implement security in microservi...read more

Tell us how to improve this page.

American Express Software Developer Salary
based on 41 salaries
₹8.8 L/yr - ₹32 L/yr
126% more than the average Software Developer Salary in India
View more details

American Express Software Developer Reviews and Ratings

based on 3 reviews

4.2/5

Rating in categories

3.1

Skill development

4.8

Work-Life balance

3.7

Salary & Benefits

4.3

Job Security

4.5

Company culture

3.6

Promotions/Appraisal

3.1

Work Satisfaction

Explore 3 Reviews and Ratings
Business Analyst
890 salaries
unlock blur

₹9.8 L/yr - ₹17 L/yr

Assistant Manager
696 salaries
unlock blur

₹14 L/yr - ₹42 L/yr

Senior Analyst
565 salaries
unlock blur

₹5.3 L/yr - ₹23 L/yr

Analyst
550 salaries
unlock blur

₹12.5 L/yr - ₹28 L/yr

Lead Analyst
546 salaries
unlock blur

₹4 L/yr - ₹13 L/yr

Explore more salaries
Compare American Express with

MasterCard

4.0
Compare

Visa

3.6
Compare

PayPal

3.9
Compare

State Bank of India

3.8
Compare

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Did you find this page helpful?
Yes No
write
Share an Interview