Tip 1 : Prepare for Aptitude problems, Standard DSA questions, Some output based problem based on java, C,C++
Tip 2 : Revise all concepts daily
Tip 3 : Work on soft skills that will help you represent your knowledge
Tip 1 : Mention At least two Project (preferably Full Stack Application)
Tip 2 : Only mention the skills on your resume for which you feel confident about it
It was Technical Interview. I have to log on to superset platform for this interview. The timing was morning 09:00 AM IST.
Interviewer first asked me to Introduce myself. After that, he gave two DSA Questions. That I was able to solve both question then, he asked to optimize the code, I used Java to solve the questions. Then he asked about projects. I explained my projects. And in the end he asked whether you knew any programming language besides java. I said yes, I learned C language. he gave one coding problem to solve using C language. I solved that too. I have had good Interview experience with him. he was very polite and helpful.



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?
Step 1 : First, I gave him a recursive solution. The idea was to reach the last node of the linked list using recursion then start reversing the linked list. Time Complexity: O(N), for Visiting over every node one time
Auxiliary Space: O(N), for Function call stack space.
Step 2 : Interviewer asked me to optimise the space complexity.
Step 3 : Then I gave a iterative solution that uses three pointers, curr, prev, and forward to keep track of nodes to update reverse links. Time complexity: O(N). I have not used any extra space, so Space complexity: O(1)



Do not allocate extra space for another array. You need to do this by modifying the given input array in place with O(1) extra memory.
'n' = 5, 'arr' = [1 2 2 2 3].
The new array will be [1 2 3].
So our answer is 3.
Step 1 : I gave a solution using hashSet. I copied the array element each one by one in hashset. After this operation I copied all hashset element to new array and returned the array. Time complexity : O(N) and Space complexity : O(N). interviewer was happy with this solution did not ask to optimize it.
It was HR round, conducted in afternoon around 01:00 PM IST firstly HR asked my introduction, after that she verified my aadhar Card and 12th Marksheet. She also asked some typical HR round questions. She was very happy with my answers.
PS: I got selection mail from our College TPO after 3 weeks.
Introduce yourself
Why should we hire you?
Are you able to relocate within India?
Tip 1 : Improve your soft skills.
Tip 2 : Keep your documents handy for showing to HR.
Tip 3 : Prepare a good Introduction to give impression to HR.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: