Tip 1 : Be consistent
Tip 2 : Have a growth mindset
Tip 1 : Have a single page resume
Tip 2 : Don't add unnecessary things
It was coding round consisting of 2 questions



Tip 1 : Practice from online coding platforms



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
Apply 2 pointers approach
It was comparatively an easier round with just questions around JS.
Tip 1 : Go through the JS concepts
Tip 2 : Also focus on theory concepts
It was a system design round. Only one question was asked in this round
Design previous org architecture
Tip 1 : Practice some basic System Design Questions
Tip 2 : Go through previous interview experiences

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which data structure is used in the implementation of recursion?