New update is available. Click here to update.
SDE - 1
SAP Labs
3 rounds | 6 Coding problems
0 views
Interview preparation journey
Preparation
Duration: 6 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming, Java
Tip

Tip 1 : Be conceptually strong
Tip 2 : Practice good amount of questions
Tip 3 : Do good projects

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume and be confident.

Interview rounds
01
Round
Easy
Online Coding Interview
Duration45 minutes
Interview date1 Mar 2020
Problems2
Segregate Odd-Even

#### There ...

view more
Problem approach

1) Initialize two index variables left and right:
left = 0, right = size -1
2) Keep incrementing left index until we see an even number.
3) Keep decrementing right index until we see an odd number.
4) If left < right then swap arr[left] and arr[right]

Find power of a number

#### Ninja is sitting in an examination hall. He is encountered with a problem statement, "Find ‘X’ to the power ‘N’ (i.e. ‘X’ ^ ‘N’). Where ‘X’ and ‘N’ are two integers."

view more
02
Round
Easy
Face to Face
Duration50 minutes
Interview date1 Mar 2020
Problems3

#### Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

##### For example:
``The given linked list is 1 -> 2 ->...``
view more
Problem approach

Initialize three pointers prev as NULL, curr as head and next as NULL.
Iterate through the linked list. In loop, do following.
// Before changing next of current,
// store next node
next = curr->next
// Now change next of current
// This is where actual reversing happens
curr->next = prev
// Move prev and curr one step forward&nb...

view more
Reverse List In K Groups

#### You are given a linked list of 'N' nodes and an integer 'K'. You have to reverse the given linked list in groups of size K i.e if the lis...

view more
Problem approach

Reverse the first sub-list of size k. While reversing keep track of the next node and previous node. Let the pointer to the next node be next and pointer to the previous node be prev.
head->next = reverse(next, k) ( Recursively call for rest of the list and link the two sub-lists )
Return prev ( prev becomes the new head of the list

Theory Questions

1. What is the difference between C and C++? Which one is better and why?
2. What are Encapsulation and abstraction?
3. What is runtime polymorphism? Explain with code. He wanted me to write the whole code and then explain it. After this, he directly jumped to DSA questions.

03
Round
Easy
HR Round
Duration25 minutes
Interview date2 Mar 2020
Problems1
Basic HR Questions

1. Introduction
2. Why SAP? What do you know about SAP? Any SAP product name?
3. Where is SAP belongs?
4. Where do you see yourself in the next 2 years?
5. He asked about my Location preference.

Problem approach

Tip 1 : Have knowledge about the company you are applying to
Tip 2 : Be confident

Start a Discussion
Similar interview experiences
Software Developer
3 rounds | 8 problems
Interviewed by SAP Labs
118 views
SDE - 1
3 rounds | 11 problems
Interviewed by SAP Labs
183 views
SDE - 1
3 rounds | 5 problems
Interviewed by SAP Labs
0 views
SDE - Intern
4 rounds | 4 problems
Interviewed by SAP Labs
1435 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
57334 views