They asked a math question and asked me to write it in Java in 10 minutes. They insisted on writing code so they can see how I can code. I said it needs analysing before I start. After I started they said how do you solve this particular part of the question. I explained and after listening to their comments I realized that they didn't know about correct vocabularies to use for that math question!
- Previous experience (Tell me about your previous experience, why SAP) - Typical STAR Method questions (Describe a situation) - Situational questions (what would you do) - Bootcamp (Business Case to present with a team)
- Tell me about a time you had to resolve a conflict - Tell me about a time you faced an unsatisfied customer
All candidates at Bootcamp are divided in teams. Teams are multinational. All teams are working on the same case study. Case study is a complex problem, that your team need to analyse, propose a best fit solution(s) and you have to present it in front of the jury. Jury is consisted of managers from SAP and HR team. During the process of solving the case, SAP HR takes you out of the group for the short 1-on-1 interviews. You have few this kind interviews during the day. You are interviewed by the SAP managers. They ask you who you understood the case, what's your point of view, what would you do if...
No questions
How would you extend an existing project with command line interactions to have it with a REST interface?
One logical question such as IQ test. One algorithm question.
The second round interview: Implement a binary tree with the given interface, then discuss the implementation via remote desktop and phone. /* * An interface for an sorted binary tree. * * The interface provides methods for inserting values, checking if certain values are contained and iterating over the elements. * Note: Implementing classes should provide an iterator that traverse the inserted object in the sorted order. */ public interface IBinTree<V extends Comparable<V>> extends Iterable<V> { /* * Insert an object into the binary tree. Note: The tree should be sorted, inserting the same object twice is allowed but the insert is expected to be stable. */ void insert(V obj); /* * Batch-insert multiple elements. */ void insert(Vector<V> vec); /* * Check if the object is already in the tree. Return true if it is, false otherwise. */ boolean contains(V obj); }
How I would help the organization
What skills can you bring to the team?
Viewing 2941 - 2950 interview questions