Amazon SDE-1 India interview review/feedback.

Below is how my interview went, what do you guys think, Will I be selected? Leetcode post link (for ease of viewing): https://leetcode.com/discuss/interview-question/2333690/amazon-sde-1-bangalore-july-2022-pending TR-1(Early June) A simple DLL based problem, explained it very well, interviewer was satisified. Size of biggest island, solved optimally, expalined and interviewer was satisfied. this round went pretty well IMO. after some days got interview link for second round. TR-2 (June Last week) 15 min went into LP and intro which I think went well. find if element exist in row and column wise sorted matrix, explained non optimal solutions. I was not aware of O(N+M) solution so, we kept on digging it for 35 min, interviewer gave me multiple hints that I am going in the right direction but i kept on thinking that the line of idea I am going over might not work. After many more hints from the interviewer finally solved it but lost 25 min on this one. finally interviewer told me "bro, you had the solution 25min earlier but you kept on thinking it's not correct, with modificatin you could have solved it" House Robber(25 min), expalined naive got a lot of questions in it answered them, and optimized solution. failed for some scenerio but got it working with minor tweak. then He extended to printing the robbed house, I wrote 3-4 lines but then he was running late so we had final "do you have any question for me" and then said goodbye. TR -3 (Bar Raiser) (Few Days Ago) 5 min Intro 25 min, LP involving 4 questions, Initialy it was discussed to be just two but as I was not able to provide answers properly as per my experinece so interviewer extended the number of questions. 10 min, Given two array X and Y of size N. tell what this below code is doing. int result = 0; for(i-> 0 to N-1) for(j-> 0 to N-1) for(k-> 0 to N-1){ if(X[i] != X[j] && X[j] != X[k] && X[i] != X[k]){ result = max(result, Y[i]+Y[j]+Y[k]); } } I told "okay, this code is giving us the maximum sum of three elements from Y such that there's corresponding values does not duplicate in X" Interviewer said ok, and then asked to provide optimized way to get the same result answer. First I shared the sort in Y approach and then min_heap + unordered_map approach.Interviewer was satisfied. Wrote clean code for optimized approach. 25 min, Check if tree is symmetric, Explained the approach. Then asked to check symmetric at even level and same at odd level, I said we can just modify the previous approach for level based check. Wrote Clean code for it. It was working till level 2(0 based indexing) then for like 5 min he explained back to me what he mean by "Same at even level". I got a better understanding and told that we can use BFS for that. since we were 1:05 min into the call we decided not to code it. 3-4 min of Do you have any question for me. What do you guys think, will I get Selected? TC- 10 LPA