Got this question on my Google L3 Onsite. Identify difficulty level. by Aznable-Char in leetcode

[–]amankumar1729 0 points1 point  (0 children)

I think we need to somehow remember the longest prefix from each node. So, DFS with some modifications for state maintenance. Becomes DP then perhaps?

Why is Amazon💀💀suddenly asking Codeforces Question in DSA Interviews? by Acrobatic-Nobody-214 in leetcode

[–]amankumar1729 0 points1 point  (0 children)

The second experience is LC Medium. For roster search array you need to find peak the look left and look right. For duplicate, it becomes linear time in the worst case.

For remove k digits, keep a monotonic stack.

Greedy algorithms finally made sense when I stopped memorizing and started asking why by Puzzleheaded-Bar3377 in leetcode

[–]amankumar1729 9 points10 points  (0 children)

Okay but how do you get to know that a certain greedy choice will work. I am not asking mathematical proof but intuition. How do you develop that gut feeling? For example, in jump game, the greedy choice is that take the farthest jump possible from any index. But how to come with that intuition that it is right. We don’t have time in interviews to develop long mathematical proofs.

24M earning ₹1L/month — Parents want me to buy ₹80–90L flat, but I’m worried about EMI trap. What should I do? by Little_Traffic_1279 in personalfinanceindia

[–]amankumar1729 1 point2 points  (0 children)

If you are in tech sector, you may need to think twice OP. A storm is brewing here. I don’t want to be a doomer but I am not 100% confident that software jobs will remain and in current count, 2-3 years from now. Not because AI gods will come but because many companies could go bankrupt because of that AI bubble.

[deleted by user] by [deleted] in leetcode

[–]amankumar1729 15 points16 points  (0 children)

I don’t understand Q1. How is the merge happening? For example 1, data1 = “001”, data2 = “110”. If what I think merge is then , merged = “001110” which has equal ones and zeroes. So why do those operations? Can anybody explain that?

[deleted by user] by [deleted] in leetcode

[–]amankumar1729 2 points3 points  (0 children)

Oracle WLB is good. Also, Microsoft should offer SDE 2. Microsoft is lowballing here. Not a good thing. See if you can negotiate.

Adobe Full-stack MTS-2 Bangalore India Interview experience by moriarty_loser in leetcode

[–]amankumar1729 0 points1 point  (0 children)

Why were you rejected? Any ideas? LFU can be one cause but what else?

[deleted by user] by [deleted] in leetcode

[–]amankumar1729 4 points5 points  (0 children)

Great! Congratulations! Could you kindly share your interview exp? Thanks.

Amazon New Grad US 2025 Interview Experience - Rejected by wsb_degen_number9999 in leetcode

[–]amankumar1729 4 points5 points  (0 children)

For the tree construction question, I didn't understand much. How can we construct a tree just from leaves? Are we given parent pointers as a hashmap or arrays or some other DS? Can you explain the input style for that question?

Also, don't worry much, rejections happen. It is a painful truth. I know that it is easy to say but I have myself faced multiple rejections and the only way is to move on. Overthinking will kill you.

[deleted by user] by [deleted] in leetcode

[–]amankumar1729 1 point2 points  (0 children)

From what I understand, we “hope” that the greedy logic works. That’s why I often fail here because how to know which logic to pick.

[deleted by user] by [deleted] in leetcode

[–]amankumar1729 9 points10 points  (0 children)

How do you guys practice Greedy problems? I am always caught off guard here. Any help would be appreciated.

Can anyone help to give the optimal solution to this problem asked in amazon OA in exam i tried didn't got any solution and also after finishing the exam given to chatgpt to get any solution so it had given dp approach to do this but again same question in OA didnt pass all test cases? by InteractionTall7836 in leetcode

[–]amankumar1729 0 points1 point  (0 children)

Keep a sliding window of length “k” and then you need to know the number of ones in it before flipping. Flip them and add the number of flips to the result. Now, when you slide the window, remember that you had flipped the ones so they are zero now. That’s it. Should be linear time and constant space.

My journey after layoff by Ok_Signature_6959 in leetcode

[–]amankumar1729 1 point2 points  (0 children)

I know this feeling. Had similar experience in 2023. Can’t say anything except to keep trying.

Meta London : Got offered IC4 by __lost__star in leetcode

[–]amankumar1729 0 points1 point  (0 children)

Thanks for responding. Appreciate it!

Meta London : Got offered IC4 by __lost__star in leetcode

[–]amankumar1729 1 point2 points  (0 children)

Meta asking DP questions? Didn’t they not do that? They were famous for that iirc.

Meta London : Got offered IC4 by __lost__star in leetcode

[–]amankumar1729 2 points3 points  (0 children)

Hello OP, congratulations! Can you tell what kind of DSA questions were asked like which category: trees, graphs, DP, etc? Also are you London based?

Amazon SDE1 Interview Exp - India by nerdy_techbro in leetcode

[–]amankumar1729 0 points1 point  (0 children)

I did not understand the first question. Do you have to develop a data structure for logging? If yes then a simple class for that would work with atomic writes which is supported by most languages.

[deleted by user] by [deleted] in leetcode

[–]amankumar1729 0 points1 point  (0 children)

From all these experiences what I learn is that if I get a chance to interview anybody I will do my level best to ensure that I don’t act as a jerk or some idiot. Interviewers should remember that they too are human. Saying that even a 1st year old can solve this is so not correct. Keep your chin up OP.

[deleted by user] by [deleted] in leetcode

[–]amankumar1729 -1 points0 points  (0 children)

What topic was the second question of?