From a small town in Punjab to AI engineer in San Francisco, Learn how our mentor made his way to AI engineer in California! Introducing India's One of a Kind Mentorship Program Starting on 28th September, 2024
Utkarsh Tekriwal’s American Express Interview Experience
- Interviewee :- Utkarsh Tekriwal
- UnsaidTalks Interviewer :- Neha
- Branch :- Electronics and Computers
- Year Of Passout :- 2019
- CGPA Cutoff :- 6.5
- Profile Offered :- Express Data Analyst(EDA)
Contact Details
Login to view contact Details of the interviewee
Interview Questions
Ques. Introduce yourself to the readers
I am a kind of person that believes in trying out different domains rather than sticking onto one. Its all about how many different shades can you add to your personality and knowledge rather than restricting yourself to what is just required or the bare minimum.
Ques. What was the difficulty level of the interview? (1- very easy, 10-very difficult)
7/10
Ques. Tell us about the written/online test. (Aptitude, Coding, Test Platform, etc)
The online test was taken through the test platform Mettl. It had 2 sections.
The first section comprised of 50 questions (Logical Reasoning + Quantitative Aptitude + Verbal Ability + Technical Questions ) with a time limit of 60 minutes. The LR, QA, VA questions ranged from easy to moderate where as the Technical questions were on a tricky end and most of it was from data structres like heaps and trees and few output questions.
The 2nd section was a coding round with 2 coding questions that were to be solved in 30 minutes.They had general test cases and after that the code was also tested against weighted test cases. Very specific about the complexity of the solution.
1. Tell the number of groups that can be formed from 2 to n+1 such that all the multiples of a number in the range of 2 to n+1 are the members of a single group. If a number is a multiple of another number that number is also present in the same group.(Like 6 is a multiple of 2 and 3 both so 2,3,6 will be present in the same group).
2. A modification of the classic coin changing problem of Dynamic Programming.
Login to check More Interview Question