Tip 1: Focus on the concept not on the number of questions
Tip 2: Must do Development even a simple html, css, and javascript project can work.
Tip 3: Must do the most asked and most liked questions.
Tip 4: First Solve the question by yourself then jump for other's solutions
Tip 1: Must know everything in the resume(don't put false things)
Tip 2: Not more than 1 page
Timming was around 2 PM
I was alone in the room
Interviewer was very supportive and humble
• The reference to the head of the linked list is not given.
• The node to be deleted is not a tail node.
• The value of each node in the Linked List is unique.
• It is guaranteed that the node to be deleted is present in the linked list.
Copy data of the next node to the current node
It's clear that The task question is wrong. You cannot delete the node.
Basically, instead of ONLY deleting the provided node we are not just doing it but CORRUPT the next node. It's a bad question wording (without clarification about options) and a bad solution. In my opinion, the correct answer for the interview is: "You CANNOT do this by having the node reference only. BUT we can make very similar operation by corrupting the next node. Although it's possible I don't recommend this solution for production applications.
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".
Sort the array
loop with 3 pointers - current(i) , left , right - calculate the sum
sum > 0. move right pointer closer
sum < 0. move left pointer away
sum = 0. add all 3 pointer's value to set
Here set is used to remove duplicate entry of values
Time Complexity 0(nlogn)-sorting + 0(n*n) ~~ O(n^2)
Space complexity - 0(n)
First Interviewer asked me to introduce myself and then he started asking question-related about my project and discuss around 15 min and then he started asking about the DSA question. He asked me 2 DSA questions.
Assume that the Indexing for the linked list always starts from 0.
If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
The following images depict how the deletion has been performed.
Copy nexts value to current node
delete the node
1. The heights of the buildings are positive.
2. Santa starts from the cell (0, 0) and he has to reach the building (N - 1, M - 1).
3. Santa cannot leave the grid at any point of time.
The trick to this question is, we just need to check if there is a path from any previous indexes to current index.
So we will start from the last index and see if there is a path from any of the previous indexes. If yes, then we will check if there is path from previous indexes to this index ( which has a path to last index) and so on.
If we found that for an index , there is a path from 0,
we will return True
Else its false
Timing was around 10AM.
I was alone in the room.
Interviewer was very humble and generous.
Tell me about yourself?
Tip 1) Do not ask the interviewer what he wants to know about you. You may be asking genuinely, but that just
sounds rude.
Tip 2) Do not speak what is already there in the resume. The interviewer wants to know what they have not
seen on the resume. And do not speak about anything personal.
Tip 3) Introduce yourself by including certain adjectives like problem-solving, innovation and tech-savvy,
creative, quick learner, etc. that best describe you in your professional life to boost your chances.
Why do you want to join Acko rather than big Tech MNCs
Tip 1:Always show them you are only focused on learning.
Tip 2:Also make them feel that you will stay longer in their company
What are your hobbies?
My hobbies are dancing, Internet surfing, playing Chess, listening to music, watching the news channel. In my spare time, I like to read news on my phone and traveling to my hometown. Thank you for giving this opportunity to introduce myself.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?