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.
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.
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.
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..
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 😱😰
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.
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)
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!😂
Much motivated from this...I wonder how a B.Tech student know DS in such depths....and I was making excuses DS code is hard..She has proved me wrong... literally she has done all codes from DS to COA...it's showing her all hard works....
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🙏🙏
Don't get demotivate by watching this video, some people who has still not started learning data structures are also watching this videos and getting demotivated the main thing in this video is that girl is knowing each and everything we can say she is having knowledge of that... start learning Data Structure do some practice on leetcode and on geeksforgeeks you are done, similar types of problems are available on gfg and on leetcode, practice them and have a great understanding of data structures♥️
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.
Disclaimer should be given , ** Not for unprepared and easily demotivated people ** That was a Bad-ass interview ! Congratulations and Thanks for sharing your experience .
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
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..
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.
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🔥👏👏
Sklearn : I have implemented Naive Bayes classifier for any kind of data She : I have implemented my own Naive Bayes classifier and it is better than the sklearn's one Sklearn : 😳 oops , your model may be good for your data which you have taken for your problem but if you try that for another data that won't work 😂
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 🤔🤔
I am mca final year student from tier 3 college (ipu) my dream is to work in Amazon .I know all the questions discussed in this video except one merge k sorted .it's really motivating me thankyou for the video.
Actually this is one of the easier amazon interviews...i had faced one in october 2019(couldn't make it after the 4th and final bar raiser round)...my interview was also not as difficult as some of the other ones that i had read about on gfg...i would rate mine as ~3.5 and this one as ~3.2....but you will find interviews rated all the way from 2 to 4.5....so a lot of it depends on luck...
Devansh your comment justifies why some people say far easier questions are asked or very difficult questions are asked in an interview. Each interview experience is unique in its own way.
ACID properties for me: 1. It has a pH level less than 7 2. With base produces salt 3. Amount of acid will decide whether salt is of acidic or basic nature 4. Turns blue litmus to red Lol😂😂
I too feel like I am useless after seeing the video what is this DFS and BFS which language is this why there 🌲 problems. How on earth She is answering so fast when the question is asked I wish to be like that on day. I have only started learning python recently I learned string, lists, tuples, dictionaries and understood that python is an OOP and all I did was using objects of some claas. I only know that much 🥺🥺🥺 Are the stuffs in the interview is of higher level that I should learn in future . Please comment guys how of you are comfortable with what asked in the interview and what should I do too improve
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.
4:42 me space complexity O(n2) kese ho skti hai... We are pushing only no of 1s in queue... So, space complexity O(no. Of 1s present in the matrix) ni hogi...?? 🤔🤔
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).
8:50 she is a bit wrong here guys...even if she used a single count variable - space complexity of recursion is still O(LogN) and if the tree is skewed the worst space complexity will be O(N).... This question can be done in O(N) time complexity and O(1) space complexity only by using MORRIS INORDER TRAVERSAL which is based on idea of threaded binary tree .
Thank you Anshu... Hope you have seen 2 interviews on Microsoft on RU buZZing... ruclips.net/video/CDcvykP5Ulw/видео.html (Mohit Agrawal - 3 Rech Rounds) ruclips.net/video/wDxWilNpYaE/видео.html (Rohan Kamath)
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²)
I have completed my class 12 .I have taken c++ as a additional subject.I don't know why but the questions seems familiar to me.BTW I like the interview
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
I'm looking job in amazon, I have completed my b.com can you please suggest me
After watching this video I feel like I’m the most useless thing on the planet 🥺
#mee too
Brother me too
Same here mam...so useless
same here
Mee too bro
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.
We agree with you Amit... we have removed the thinking time and pauses to keep the video interesting...
this video like seriously demotivated me ,
i was buzzing subscriber from 1.5 year not i had unsubscribed
Every question is from interviewbit in reality also most of the company only ask questions from interviewbit.
actually all the questions are very standard questions.
Upto you how you would like to look at the glass. Wish you all the best! @elegant studio
I realised after seeing the level of difficulty of this interview, that why so many are jobless.....
The struggle she had done during her journey is reflecting in her words
Wow. She's going to replace Alexa now at Amazon.
Alag level ka swag hai ampka
True🔥
Even Alexa was made by code
She is next Alexa in Amazon company😂😂
lol
This is the most confident interview which I've ever seen in my life ! Mam has got great knowledge and clarity!
Omg Don't judge a book by its cover is exactly suits for you Dure u are just Rocking what a Performance yarr interviewer shocks you rocks..!
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.
Are only girls eligible for amazon wow?
@@firstnamelastname3532 yes
kya yeh saare question data structure k related hai kyunki inhone project data science k related banaya tha
Thanks I afraid how someone is so clever
@@firstnamelastname3532 lol
That's the best ever enactment of a software engineer position I've ever seen in a long time, Great Job
Thank you Shubham
I would definitely say this is the best Channel on the whole RUclips which provide realistic interviews👏👏
Wow, thank you! Ansh :)
Interviewer: Which tree traversal are you most comfortable in?
Interviewee: DFS
Interviewer: Do it with BFS 😎
Savage. Thug life.😎🚬
Good one Soham
Good one,I have also noticed.
@@monishravulapally9097 If she had said BFS, what if the interviewer had assumed that BFS is her comfort zone?
Let's see this as a joke and enjoy it.
Bad interviewer.
she is more comfortable with BFS.
GIRL- Mission Passed!
Respect+
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.
It would be a pleasure to connect with you Aksh, so you could guide RU buZZers further. Here is our email id : rubuzzing@gmail.com
True it was robotic tone 😆😂
true
They went way ahead with framing the whole interview.
Omg thank you. I was just so annoyed by this as well.
OMG after seeing this video I came to know why I'm in bpo job even though I did BCA. I don't know answer even for 1 question
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..
Even I did BCA and they haven't taught us any of this
@@gavravdhongadi9824 bro no one will teach u you have to learn this
@@gavravdhongadi9824 even Im doing engineering there as well no one teached us data structures
@@pratikjoshi3475 s...bro.
She's answering faster than my google assistant, jokes apart Very nice interview! Keep it up RU Buzz
We remove the pauses and thank you
😂
That’s not a real interview she has a youtube channel in which she uploaded this video.
ruclips.net/channel/UCXiFvBv-DKqGdB8Oaz5fJ1A
Thanks for showing me the real world of interview at Amazon
she is giving answers like a robot. she is so intelligent.
this is a re-enactment. the real interview will be more than 4-5 hrs. nobody can directly give answers within 5 mins
Bol shadi krega is robot se😎😂😂
@@charan775 oh i see. still she answered right? she never said 'dont know' to any question.
@@imnithish those are standard questions.
@@imnithish Man she knew questions earlier
this is look like a well trained teacher teaching to the student lol if interviews will be that hard no one can get placed
this is a re-enactment. the real interview will be more than 4-5 hrs. nobody can directly give answers within 5 mins
It's re enacted
This interview Is too hard
@@mukundwagh1972 interview was so easy bro
@@tanaygupta632 means i need more practice🙏
One of the best interview enactment, lot of learnings..... thankyou rubuzzing team and anshika
Thank you
Wow I m shoked after watching this video because I m a computer science student also
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 😱😰
Meri bhi Bhai gand phat rahi hai...
Kuch ata hi nhi hai
She literally told everything.. i cant speak like that continuosly.
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.
This intervview really show me that where r I actually stand i life .....need a lot's of hardwork for crack interview
....amazing didi u r great
Omg after seeing this I came to know why I m in psu job even through I did mechanical engineering..
Be positive buddy! A lot of people would be happy to be where you are :)
Amazing interview, got a chance to analyse my skills and where I stand in my career thank u team RU and the interviewed
Best of luck!
This is how they interviewed full of DAA and data structures
Lol what a coincidence today I solved merge k sorted linked list.
My confidence is just high now
Keep Going Jagannath :)
@Akash G C++
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)
@@kushagrasharan7896 but we have to merge k-1 times . so k*n*logk ?
@@sourabhthakur9177 Its tough explaining here. Go to the comments of the above link. Proper explanation is provided why it is NlogK
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!😂
At your own risk please :)
Better to say i am comfortable in both
😂😂
Much motivated from this...I wonder how a B.Tech student know DS in such depths....and I was making excuses DS code is hard..She has proved me wrong... literally she has done all codes from DS to COA...it's showing her all hard works....
Then you haven't seen TMWILLIAMLIN
For us competitive programmers dsa is cakewalk
Don't watch this kind of video just give ur best and do hardwork as much as u can do .... 100% sure u people also placed 🙂
Amazing interview Akka.I'm a student pursuing B.Tech(Computer Science) in AP IIIT Nuzvid.Thank you so much.It is very helpful.
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 😊
Glad you liked it!
Now she has her own RUclips channel. And she gives very important information for students.so must join 🎊
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🙏🙏
Thank you Ayush
Its look like the girl is taking interview of 4 candidates
lmao
@@anonymous_69-c8k
Others look like side actors🤣😁
Don't get demotivate by watching this video, some people who has still not started learning data structures are also watching this videos and getting demotivated the main thing in this video is that girl is knowing each and everything we can say she is having knowledge of that... start learning Data Structure do some practice on leetcode and on geeksforgeeks you are done, similar types of problems are available on gfg and on leetcode, practice them and have a great understanding of data structures♥️
She is a search engine.Ask anything to her,she answers every questions correctly😂
I couldn't understand much of the interview. This video motivates me to work hard and explore where I am legging behind
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.
Mannn,really how u got that much of patience run for longtime.but the way of expressing is really ossam
You Really deserve this post for amazon ...good luck for future
not able to understand a single word as i don't know any data structure and algo or was there any other reason
O my god.... . she is answering extrordinary without any tension
This was an really amazing session..thank you ru buzzing team
Thank you Shaik
One of the best interview I have ever seen in the RUclips it's help me a lot
Glad it helps you!
Lol if this types of interview will happen
Tb to hum berozgar ho jaenge 😂😂😓
Disclaimer should be given ,
** Not for unprepared and easily demotivated people **
That was a Bad-ass interview !
Congratulations and Thanks for sharing your experience .
True... You are correct bro...
She knows all the answers 🙏🏻🙏🏻🙏🏻
Seriously it is amazing interview... Congratulations Anshika
Thanks for uploading such content..♥️
Due to this channel I am able crack my TCS smart hiring and Bluebenz Ltd. campus interviews.
Thanks a lot.🙏🏼
Thank you Nachiket! Words like these inspire us to make the next one :)
Bhai interview ese hi dangerous hote hai please reply fast
Loved this video,
Got to know about a lot of things that we are going to face in an actual interview.
Thank you Mukul
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
I love watching people lying about the company when they are asked why do u what to join this company😂
Thank you Ru buzzing team for making this video.
Watching this gives me motivation 😀😀.. Cause I know all the answer
I got really much motivation after watching This video 😊..
All the best
Thanx For the Video ..team Ru Buzzing Now I know What My True Level Is.Will Work Hard for facing this Interview.....
Thnk u Sumit
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..
Welcome aboard!
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.
Literally a good interview session.Thanks ru buzzing team.
Thank you Shalini
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🔥👏👏
Glad you liked it!!
A very informative video..Thanks a lot to Anshika Di and rbuzzing team for enacting the interview
Thnk u Arijit
The interview was impeccable.
I am happy for learning with you
Thank you rU buZZing
Really this is an amazing video...mam can u pls explain where to learn and how to learn these stuff
Sklearn : I have implemented Naive Bayes classifier for any kind of data
She : I have implemented my own Naive Bayes classifier and it is better than the sklearn's one
Sklearn : 😳 oops , your model may be good for your data which you have taken for your problem but if you try that for another data that won't work 😂
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 🤔🤔
You can crack any coding interviews. You have such an amazing knowledge about programming concepts 😊
Damn!! I would never be selected in my life, with such type of questions 😅😅
Thank youu teamm, for thisss content. Veryyyyyy helpful. Thank you. 🙏
Thank you Anusha! Your words help us create our next :)
It's heart warming to know that I know the first round answers.
I am mca final year student from tier 3 college (ipu) my dream is to work in Amazon .I know all the questions discussed in this video except one merge k sorted .it's really motivating me thankyou for the video.
Thank you Pawan
the question asked above are included in mca syllabus
@@arshiyaansar9803 yes .. even in bca syllabus everything is there.
At 12:39 Priority queue is max heap by default not minheap
Liked very much.Thank you Anshika mam and Ru Buzzing team😊
Thnk u Hemanth
Best video enactment and lot more to learn !!👍
Thnk u Shalini
Actually this is one of the easier amazon interviews...i had faced one in october 2019(couldn't make it after the 4th and final bar raiser round)...my interview was also not as difficult as some of the other ones that i had read about on gfg...i would rate mine as ~3.5 and this one as ~3.2....but you will find interviews rated all the way from 2 to 4.5....so a lot of it depends on luck...
Devansh your comment justifies why some people say far easier questions are asked or very difficult questions are asked in an interview. Each interview experience is unique in its own way.
My que is who is taking the interview?
In this video these are actors representing Amazon Team
Amazon
Really amazing 👍
When I watch this interview then feel I can do it
Nice job i must say. A lovely interview mam, you really worked hard for this.
Indeed
Mam,I just wanted to tell you in one word 'Thankyou'.
ACID properties for me:
1. It has a pH level less than 7
2. With base produces salt
3. Amount of acid will decide whether salt is of acidic or basic nature
4. Turns blue litmus to red
Lol😂😂
Good one :) What are you studying Priyanshu
He is studying chemistry 😁😁
Still preparing for jee
Haha
@@abhijeetkumar2204 same
I too feel like I am useless after seeing the video what is this DFS and BFS which language is this why there 🌲 problems. How on earth She is answering so fast when the question is asked I wish to be like that on day. I have only started learning python recently I learned string, lists, tuples, dictionaries and understood that python is an OOP and all I did was using objects of some claas. I only know that much 🥺🥺🥺
Are the stuffs in the interview is of higher level that I should learn in future . Please comment guys how of you are comfortable with what asked in the interview and what should I do too improve
really...
You positivity and confident was awesome..
Super and wonderfull..
Sisyy....
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.
Thnk u Shreya
Anshika: sir I can do it with either DFS or BFS
Interviewer: Which one you are comfortable with?
Anshika: DFS
Interviewer: Ok let's do it in BFS
Anshika would be in trouble agar DFS poocha hota.
@@SHASHANKRUSTAGII no she looks like very much prepared
Harami nikla sala😂😂
Thug lyf.
@@sohamsen7892 checkout arshwood. You will love his talent.
She is so confident
Only one word.. brilliant 👌👌👌
Thank you Mouli!
U have a awsm coding skills🔥
4:42 me space complexity O(n2) kese ho skti hai... We are pushing only no of 1s in queue... So, space complexity O(no. Of 1s present in the matrix) ni hogi...?? 🤔🤔
There is visited array who takes n2 space
In worst case no. Of 1s will be equal to n2
Twist: Actually she was comfortable with BFS 😂
Probably Christopher Nolan had given her some tips 😂.
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).
8:50 she is a bit wrong here guys...even if she used a single count variable - space complexity of recursion is still O(LogN) and if the tree is skewed the worst space complexity will be O(N)....
This question can be done in O(N) time complexity and O(1) space complexity only by using MORRIS INORDER TRAVERSAL which is based on idea of threaded binary tree .
Very helpful & informative video!!
Please make more interview videos for product-based companies.
Thank you so much Anshika Di & RU buZZing team!
Thank you Anshu... Hope you have seen 2 interviews on Microsoft on RU buZZing...
ruclips.net/video/CDcvykP5Ulw/видео.html (Mohit Agrawal - 3 Rech Rounds)
ruclips.net/video/wDxWilNpYaE/видео.html (Rohan Kamath)
Thanks@@rubuzzing, I will surely watch these videos.
Thank you Anshika di and RUbuzzing
Thank you Ananya
Important thing to learn here people never tell interviewer which method you are comfortable with.😆
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²)
mujhe kuch bhi nhi smjha par sun k achcha laga, good job.
I didn't knew most of the stuff Great interview!
Glad you like it
Bhai itne paise jo privt cllg mai diyee...itne ru buzzing ko dete aj mai samaj pata ye kya bol rahe hai 😂😂😂😂😂😂 me be like I'm an engineer...😂😂😂
@@karanbhat719 exactly man i am like wtf i forgot everything 😂
I have completed my class 12 .I have taken c++ as a additional subject.I don't know why but the questions seems familiar to me.BTW I like the interview