Tip 1 : Spring boot and java as they build backend in this
Tip 2 : DSA is must for any BE development job
Tip 1 : Specify github link for project reference
Tip 2 : Coding platform link
Was already told that rounds will be DSA based
Interviewer was friendly


The given linked list is 1 -> 2 -> 3 -> 2-> 1-> NULL.
It is a palindrome linked list because the given linked list has the same order of elements when traversed forwards and backward.
Can you solve the problem in O(N) time complexity and O(1) space complexity iteratively?
My plan was to store the elements of list in string and then perform palindrom search using two pointer approach. But I was told to do problem in O(1) extra space.
Solution kicked me to use reversing linkedlist. I reversed list from the middle and did the check
How many max peices a cake can be cut into after 3 attempts?
Tip 1: try to visualize the problem
Tip 2: Making all cuts from above will give answer 6 whereas as I is puzzle give more time to study
Tip 3:I made last cut from middle horizontally giving result 8
HR discussion
Basic discussions on previous project and expectations
Tell me about your projects.
Why do you want to join us?
Tip 1 : Be confident and don't lie

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?