SDE - 1

This was a very easy question. We just need to traverse the whole link list. Set initial count to 0. Then go on printing the nodes when the count is even and visit the next node.

The brute force approach is simple. Loop through each element x and find if there is another value that equals to target - x.

To improve our run time complexity, we need a more efficient way to check if the complement exists in the array. If the complement exists, we need to look up its index. What is the best way to maintain a mapping of each element in the array to its index? A hash table.

We reduce the look-up time from O(n) to O(1) by trading space for speed. A hash table is built exactly for this purpose, it supports fast lookup in near-constant time. I say "near" because if a collision occurred, a look-up could degenerate to O(n) time. But look up in hash table should be amortized O(1) time as long as the hash function was chosen carefully.

A simple implementation uses two iterations. In the first iteration, we add each element's value and its index to the table. Then, in the second iteration, we check if each element's complement (target - nums[i]) exists in the table. Beware that the complement must not be nums[i] itself.

I introduced myself with confidence and tried to showcase my skills in the introduction because the flow of the whole interview depends very much upon the introduction. I explained to him the question and my approach. The question was basically to find whether a given string contains 3 palindrome sub-strings or not.
My approach for solving this question was: consider the first letter as the first sub-string and the second letter as the second sub-string and the remaining letters as the third sub-string and check these 3 sub-strings are palindromes or not. If yes, return true, or else keep on increasing the number of letters in the second sub-string and first sub-string.
Be ready to give answers to questions like any other better approach, time complexity of your solution, or can we use any other data structure which can improve the time complexity of our solution.

Four pillars of Object-oriented programming are Abstraction, Encapsulation, Inheritance, and Polymorphism. 

Serialization in Java is a mechanism of writing the state of an object into a byte-stream. The reverse operation of serialization is called deserialization where byte-stream is converted into an object.

I had read up these topics from GFG before.

I answered that the covid-19 pandemic has affected all the industries but not the IT industry where physical presence is not required . Work from home was easily implemented in this industry and the productivity of the company and employees was not affected that much. Companies, where physical presence is required, were most affected during the covid-19 nationwide lockdown.

You have to do your research about the company so that interviewer will think that you are genuinely interested to join the company. I answered the question and told him about the charities which done by the TATA group and Ratan Tata (former chairman of Tata Sons).

1 :  To answer this question, my research about TCS helped me. I told her TCS is a great company and I will learn a lot from my seniors and colleagues. And I also told her that you can take a study gap in TCS to complete your higher education.
2 : I said no. She then explained to me the contract.

3 :  I said yes ma’am with confidence and a smile on my face.