Tip 1 : Make you Data Structure and algorithms , Problem solving strong ( use to do some dsa problems on code studio and leetcode daily.
Tip 2 : Practiced Quality questions and mostly asked questions list available on codestudio( used company tags and topic tags) as quality matters more than quantity of questions .
Tip 3 : Give mock interviews, this really helped me as it gives you clearity and builds confidence.
Tip 4 : Read respective company’s interview experiences available on codestudio and other websites before going to actual interview, as this gives you idea about level of interviews and you can prepare beforehand.
Tip 5 : after solving dsa problem .Try to look in discussion section too as you can get more optimised or more efficient approach used by others to solve the problem.
Tip 6 : Prepare important concepts from Operating system,DBMS,System design too as that might also be asked.
Tip 7 : Do atleast 2 quality projects.
Not a Tip But : Lot of quality content available online, whenever felt like stuck with some concepts take help from senior or colleagues ( I use to watch coding ninja shorts by parikh jain whenever felt demotivated or stuck with concepts)
Tip 1 : Have a concise resume , don't fill your resume with unnecessary details like your address, relationship status etc.
Tip 2 : Resume should not be more than 2 pages( try to make it very concise in 1 page)
Focused on DSA and Problem solving and Core Java


str = "ababc"
The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome.
There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.
The Basic approach is to check each substring whether the substring is a palindrome or not. To do this first, run three nested loops, the outer two loops pick all substrings one by one by fixing the corner characters, the inner loop checks whether the picked substring is palindrome or not. The optimal approach would be to use Dynamic programming in which we can maintain a 2D matrix that is filled in bottom-up manner. The value of 2D matrix will be true, if the substring is a palindrome, otherwise false.Find the longest palindrome using this filled 2d matrix.
Core Java questions were asked:
1. Explain String pool in Java.
2.What does the string intern() method do in Java?
3. Why String are immutable?
4.Difference between Mutex and Semaphores.
5. Serialization in java, Interface vs abstract classes and use cases.
6. Deadlocks and its prevention.
7. Difference between interface and functional interface.
8. OOps concept
9. Multithreading, Types of Thread.
10. What are the two ways of implementing thread in Java?(asked me to write code)
Think out loud. Ask interviews if you have any questions and doubts.
Managerial Round
It was a managerial round, Interviewer told me about her experience and asked me about my brief introduction. The interviewer asked me what I knew about SAP and its products. Asked me one simple aptitude train problemAsked about my current role and projects i worked on. Discussed HLD problems from projects i worked on and side projects.Asked me about my future goals and prefered locations and whether if i had any further questions.It was really nice discussion about SAP and its products.
Read about SAP Labs before the interview.
HR round
Introduction ?
Where do you see yourself in 2-3 years?
What do you know about SAP Labs?
Why do you want to join SAP Labs?
What is your expected CTC?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?