Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
The test was conducted on Amcat. There were 5 sections in the test (English, quant, logical, computer science, 2 coding questions)



1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
In this approach, firstly, we will hash the indices of all elements in a hashMap. In case of repeated elements, the last occurence index would be stored in hashMap.
Here also we fix a number (num[i]), by traversing the loop. But the loop traversal here for fixing numbers would leave last two indices. These last two indices would be covered by the nested loop.
If number fixed is +ve, break there because we can't make it zero by searching after it.
Make a nested loop to fix a number after the first fixed number. (num[j])
To make sum 0, we would require the -ve sum of both fixed numbers. Let us say this required.
Now, we will find the this required number in hashMap. If it exists in hashmap and its last occurrence index > 2nd fixed index, we found our triplet. Push it in answer vector.
Update j to last occurence of 2nd fixed number to avoid duplicate triplets.
Update i to last occurence of 1st fixed number to avoid duplicate triplets.
Return answer vector.


Each time when we see a '1', I increment the counter and then erase all connected '1's using a queue.
This round was taken by an engineer with 10 years of experience. He covered almost all aspects starting from coding questions to computer fundamentals.

If the given string is:
abcadeecfb
Then after deleting all duplicate occurrences, the string looks like this:
abcdef
1) Sort the elements.
2) Now in a loop, remove duplicates by comparing the
current character with previous character.
3) Remove extra characters at the end of the resultant string.
Egg Dropping Puzzle
Tip 1: Practice Previously Asked Questions.
Tip 2: Share your Thought process while solving


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?
1: Reverse the first half while finding the middle
2: Compare the reversed first half with the second half.
what is Deadlock?
what is Virtual Memory?
what are Threads?
what are Promises?
Tip 1: understand most important concepts
Tip 2: Explain problems with examples.
Tip 3: Practice Previosuly asked Questions.
This was a simple round just asked some basic HR questions.
A basic Intro
what do you know about the about, the company?
why want to work with us?
10th,12th, grad CGPA or percentage/
do you have your own laptop?
Tip 1: Just be confident
Tip 2: Show your willingness to learn even if you are not able to answer any of their questions. They are ready to hire and train employees as per their requirements.
Tip 3: Practice Previously asked Questions.

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