GREAT NEWS for all Job Seekers from RELEVEL by Unacademy!!! Click on this Link to register for Relevel Test - relvl.co/7e9 Coupon Code : RUB10 for discount on registration and if you get a job you will get full refund. So go for it and good luck
Job seekers should not get demotivated seeing this video. It's like covering 4 hours of content in 17 minutes. It's difficult to solve the problems so quickly, unless you already know the problem/solution.
This is incredibly. I know & have just heard these as topics never able to implement. Im already in B.E right now with Sem-7 in E&TC branch during this COVID-19 pandemic 😱😰
Few Points to Know 1) This is not real interview questions so dont think that only standard questions with some format is asked prepare yourself accordingly. 2) This is just an act of real interview, nobody can arrive this fast at answering all questions that too with perfect optimisation, these interviews progress with good discussion and also hints given when u unable to proceed. 3) Even if you know answer dont just jump into the solution at least show them u r thinking. 4) Dont take flow of interview in a very robotic tone like in the video. 5) Also the hiring contest which she qualified is for women only so better prepare for more tougher competition. Nevertheless she shared some good points to learn.
This is a best interview.. I never seen before this You have a really great confident and coding is is exponential amazing 😇😊.. great congratulations for you Anshika .. I'm very happy for you 😊
Really interviews are really tough basically the initial rounds... 🙏 After seeing this video it really motivate me to work hard and explore where I am lagging behind thanku RU BUZZING team..u all people are doing great Job🙏🙏
Great to watch.................. Very much impressed at Anshika's interview for which I want to congratulate her for her selection in Amazon as an SDE..........
being an interviewer at FAANG, just wanted to share my 2 cents on the approach shown here. Even though I agree with the overall approach shown, it would irritate me if someone talks in such a robotic tone. If you can come up with solutions to the problem and explain the same, you may end up getting the job, but interviews are a lot about our personalities as well. Being natural just shows you're confident and makes you likable (very important for team building/cultural fit). Remember most of FAANGs have dedicated interviews for cultural fit and I know of many Hiring managers who would flag candidates who appear to be giving 'memorized' answers monotonically.
Ma'am ur extremely talented and ur knowledge about DS n OS is too good. Currently I am in final year of my MCA but I think I am not 10% of you, why I don't know it may be its my fault or my environment or my mentors but atleast I got so many things from and some topics which I should be covering in next few days but the only thing I felt bad is I am not capable to do job at Amazon bcoz they're so much expecting from us and we are not able to stand.
Gud Santhosh that you identified what the problem is they say it is half the problem solved and now you have the option to work on the other half of working n learning d skills..
Because of these type of interviews only, I have subscribed this channel.. Thanks...And I am looking forward for more these types of interviews.. I mean to say for CS/MCA background interviews..
One thing I learnt from this.. if in future, if the interviewer asks me a problem and if there are two ways to solve it and he asks me with which you are comfortable, I'll say the difficult one!😂
Di content like these really help us a lot and gives us a taste of what we are going to face. please keep them comingg! thanku so much RU buzzing & anshika di.
She is doing this interview again. For the first time, I'm sure she would have been nervous, fumbling, making mistakes. It's just easier for her now because she is just sharing her experience and not actually experiencing it.
In the ques where u have to find the kth smallest element in bst and u optimised it u said to store the count of left subtree so I wonder how can this decrease the complexity bcoz in finding the height of left subtree the complexity is also O(n) in the worst case 🤔🤔
That was great interview Anshika. I was like what a girl she is answering all the question and I see how u urself dedicated with programming. Eventhough I m not from computer background but I am inspired by your answers. Congrats🔥👏👏
Great skills Anshika. Just few points for others who are preparing. 1. Round 2 1st ques can be done without disturbing the structure of tree in same time and space. 2. Round 3 1st problem we can simple do without priority queue in nlogk. Basically we select 2 list using binary search and then merge them.
1. nope. without modifying tree you can get O(N) time solution. with modification you will get O(logN) 2. merging doesn't work like that. we should the merge technique in merge sort .
@@charan775 1. Agree. My Mistake. Morris traversal takes O(N) time but space used is constant. 2. Merge algo takes O(n) time. Selecting which 2 lists to merge takes O(logK). Hence, O(NlogK) leetcode.com/problems/merge-k-sorted-lists/solution/ Scroll down to 5th ( most optimized solution)
In the first question itself the time complexity given was O(n) but she went ahead to use a for Loop and within tht a while loop which changes the complexity to O(n²)
Ms. Anshika, which course on Design and Analysis of Algorithms have you done ? Also how many months does it take to complete it ? How to remember all theory concepts like ACID properties, flip flops, deadlocks, etc. ?
Fabulous... Interview video ever seen.. Di. It's just not only clearified me how the interviews are... But also #inspired me a lot.. Tq di.... Keep on making such a excellent videos.
Absolutely Brilliant! Still wondering.. How O(n* logk)? From O(n* k).. Underneath... Using priority queue also makes alot of comparisons.. Effectively.. the computational speed decreses (Not sure.. non cs)
A single insertion or removal from a priority queue takes Log(k) time - as size of the priority queue is equal to the no of lists we want to sort. For the entire processing we will end up inserting each element in to the queue once and removing it once. Hence total complexity is n*log(k).
How could you code with bfs within a min ?? (As per i observed the windows time) .. Not sure though but ya if thats the reality, i admire your coding skills..
Can you please say me what language is it? is it c++ or Java? becasue I didnt understand the arguments inside priority queue ,and some of the syntax, and why m[0] was taken as -1??
Mam by watching this video iam blessed by knowing how to answer those questions very confidently and you proved gender doesn't matter at present days thank you mam love from nandigama
One thing that got me little confused here is, i know Amazon concentrates more on their leadership principles(equal to our technical skills) which they always keep at their heart and core and as far as i saw outside and in other forums every candidate they hire will be tested in those leadership principles. But here i was not able to see any leadership principles related questions. Was it not asked or was it omitted from this video?
Thank you Anshu... Hope you have seen 2 interviews on Microsoft on RU buZZing... ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-CDcvykP5Ulw.html (Mohit Agrawal - 3 Rech Rounds) ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-wDxWilNpYaE.html (Rohan Kamath)
Can anyone tell me is it only for the BTECH students or i am doing Integrated msc in maths and computing can i apply for it or not please let me know once
