Successfully cracked my MS interview today. Feeling great. Work hard guys it is worth the effort
@whatis9622 жыл бұрын
Ms from iit or somewhere abroad
@khushiswaradityaghidode46292 жыл бұрын
@@whatis962 he said Microsoft not masters 🤦♂️
@PinkiKumari-bt1ei2 жыл бұрын
Can u plzz give some tips from where to start and end and when Application comes out for MS recruitment 🙏🏻🙏🏻
@animeshanandcool2 жыл бұрын
Hii..So they only ask coding logic or theory also in interviews....I am curretly in testing from 2 years and learning DSA
@terra36732 жыл бұрын
No one cares
@ratulc3 жыл бұрын
This is the most realistic mock interview I have seen honestly. More like this is really helpful!!
@KeertiPurswani3 жыл бұрын
Thank you so much Ratul. Means a lot. Hope you like rest of the videos as well 😇
@mohammedmustufa99283 жыл бұрын
Love the way how you also provided what the expectation of the interviewer at that particular time was. Really helped in understanding how an interviewer thinks. Thank you :)
@KeertiPurswani3 жыл бұрын
Thanks! Hope you like rest of the videos as well 😇😇
@anshusinha21353 жыл бұрын
Please do such more mock interviews.Thanks for doing such videos :)
@KeertiPurswani3 жыл бұрын
For sure. I hope the videos help 😇😊
@aniketprasad18893 жыл бұрын
Yes mam please make more videos
@abhishekgarg03042 жыл бұрын
Hi Keerti, thanks for putting this type of content out. You actually looked like one of the interviews who are serious as well as 'nice' and helpful' at the same time giving space to the candidate to express themselves. The way you have edited the video giving references to what needs to be done when and the approach to be followed is also very helpful ! Thank you Keerti !
@shehzadahmed6933 жыл бұрын
Thanks for sharing the tips as an interviewee! Please make such content in the future Keerti!
@KeertiPurswani3 жыл бұрын
For sure Shehzad. So glad you liked it 🙏😇
@yashlearnscode55023 жыл бұрын
I've never seen Nishant this serious, lol. Great job, you guys. Keep the good content flowing.
@shaileshbharti10263 жыл бұрын
Productive one 💯 More mock interviews like this ...pls At least we freshers will get an idea what will have to do and not to do😅
@KeertiPurswani3 жыл бұрын
Yup. That's the purpose. Entire playlist will be there. Stay tuned! 😊😊
@abhishekhorton793 жыл бұрын
@@KeertiPurswani thankyou dii
@shaileshbharti10263 жыл бұрын
@Satish Sutar thanks to YT and especially Jio 😂
@shaileshbharti10263 жыл бұрын
@@KeertiPurswani Yes ✌️
@sanujitmajhi42329 ай бұрын
can u bring hitesh choudhary and some foreign coder@@KeertiPurswani
@arihantjain85593 жыл бұрын
His approach for the second question was wrong, he should have divided the number in 2 equal parts for even and (x-1/2, x+1/2) in case of odd. His approach will fail for A = [1, 100] k =1. he will give 99, but answer is 50
@arihantjain85593 жыл бұрын
@UCpm7NOlzwUeehNpbBY8GAcg ur logic fails for the case that I have provided above lol 😂
@saksham20913 жыл бұрын
I noticed that too! Also the second question was too easy and such questions rarely come up in an interview
@isharthrastogi7822 жыл бұрын
@@saksham2091 can you tell me the solution with priority queue?
@sayandeepghosh29112 жыл бұрын
I think it can be solved using binary search
@dhruvpurwar66423 жыл бұрын
This is absolute gold. I urge you to please make an entire playlist with different incoming SDE's so we can see how different people handle the process . ❤️❤️
@KeertiPurswani3 жыл бұрын
For sure Dhruv. Stay tuned 😇 And please do share the videos with your friends 🙏
@TheArchit13 жыл бұрын
There is no gold in this. The first question was a failed attempt to display irrelevant graph and backtracking approach before finally doing a greedy solution which he couldn't even explain , the second question was just plain wrong, the solution was to use binary search. Gold my a**.
@k9killer2 жыл бұрын
bro same , i didn't even not get clear understanding of 1st ques and solution he does , finally sigh of relief , that it is not possible to attempt best in interview everytime
@sraynitjsr3 жыл бұрын
Great , specially awesome from Nishant, very few people will have the courage to give mock interviews publicly, that too after being selected at Microsoft, shows that he is ready to accept his mistakes and keep learning from whatever opportunity he gets. And interviewer was really helpful 😅
@NishantChahar113 жыл бұрын
😁❤️
@KeertiPurswani3 жыл бұрын
Exactly. It takes a LOT of guts and he agreed in once and was a great sport. More power to him❤️
@abhigyansharma91083 жыл бұрын
@@NishantChahar11 Bhai Yh questions ko itna logically reach krna leetcode se aa paega yaa cp bhi krni hi pdegi... Please answer
@niteshnareshnarwade3213 жыл бұрын
@@abhigyansharma9108 cp must ..... do on codeforce
@harshpanwar82052 жыл бұрын
@@niteshnareshnarwade321 not mandatory
@sakshamvijay74513 жыл бұрын
Me:- Concentrating on the code and explanation Also Me:- Bhai Thief ki spelling galat h......
@govindvarshney51164 ай бұрын
bro me to😂😂
@soumyadiptabanerjee82563 жыл бұрын
Even I overlooked the 2nd test case . It changes the whole situation.
@tarunbisht80163 жыл бұрын
but if in 2nd test case k would be onw then a-b approach is wrong ig
@jashanbansal26133 жыл бұрын
First time I have seen that much long video completely. Great Interview Keerti, Good job Nishant :)
@NishantChahar113 жыл бұрын
Thank you ❤️
@ravishasharma12193 жыл бұрын
I am a second-year student. I kept trying it alongside and taking hints whenever you gave. I really enjoyed this. Please upload more such mock interviews.
@KeertiPurswani3 жыл бұрын
More power to you Ravisha. If you are already doing this in second year, I am sure you are gonna do just amazing in future. Keep going ❤️
@ravishasharma12193 жыл бұрын
@@KeertiPurswani Thank You♥️
@palashagrawal23433 жыл бұрын
@@KeertiPurswani 😁 BTW I am doing it in 1st year(Non- CS branch though)☹️
@rajdeepnagar78453 жыл бұрын
video is to the point,the best thing i like,no unwanted discussion in starting and last ,they just start a video by solving questions and end up with conclusion.👍👍 keep it continue !
@KeertiPurswani3 жыл бұрын
Thanks Rajdeep. Means a lot 😇😇
@rydham82523 жыл бұрын
Wow . This was an amazing mock interview. I myself really have come to know about lot things by watching the whole video which would not be possible if I would just had read some interview experience. Your videos are literally good . Keep uploading this kind of content 😊
@KeertiPurswani3 жыл бұрын
Thanks Rydham. So so glad you liked and learnt from it! 😇😇
@gomzysharma3 жыл бұрын
this is so amazing that you have embedded comments for us... Thanks for your time :)
@KeertiPurswani3 жыл бұрын
So glad you liked it. Thank you ❤️😇
@rakshitsahu34173 жыл бұрын
Sliding window is a good approach for the first one. We can solve it in one pass
@gouravsingh91462 жыл бұрын
Why not BS?
@rishabhkalra95053 жыл бұрын
honestly, i was surprised with this approach. I initially came up with the optimised approach but then after following the video for first half, i was like, maybe this approach is better and the moment you guys came to the optimised version, i literally paused the video and gave a pat on my back :p Good content. Learnt a lot from this.
@GauravSingh-lo4jv3 жыл бұрын
This was an amazing video, shows how things actually goes in a real DSA round. I think it will be helpful for those who are new and unaware of this. Also, will help as a guide to boost confidence before any actual DSA interview.
@KeertiPurswani3 жыл бұрын
Thanks Gaurav. That's exactly what I was hoping for. Many videos coming up soon! 🙂🙂
@omkarshendge54383 жыл бұрын
Wow this was definitely one of the best mock interviews I've seen so far. 😂 I was pausing just before Nishant bhai and was trying to answer the question given by mam and lol even I did the same mistake of not properly reading the 2nd point. 😅😂 Yes mam, actually she even gave the time to read the question and also explained it a bit also told us that we didn't read the second point I don't think some Interviewers will be this patient and supportive tho
@anaranyabose2 жыл бұрын
Solved both in 20 mins 😁thankyou
@chandrachudpati9023 жыл бұрын
These videos are so informative and insightful. Just one thing after 2 months into leetcoding, whenever there is a term/relation to maximize the minimum or minimize the maximum, the first approach should be to solve using Binary Search! I guess it would even work in the second problem.
@AmanSharma-vb5jl3 жыл бұрын
Mam it is the one of the best interview with tips , thanks mam ,,it taught me a lot that i could not able to learn in 4yrs of my college.
@KeertiPurswani3 жыл бұрын
Thanks Aman 😅😅🙏🙏
@vishakhasinghal1652 Жыл бұрын
it was a fantastic interview given by nishant to u his concept clarity is outstanding and as an interviewer urs as well . i liked the way u r connecting with him in between the time when he was answering . superb guys .keep going keerti and nishant
@harshavardhanragi68383 жыл бұрын
Thanks for this video keerti. It would be grateful if u could upload this type of content frequently. I am also from NIT CALICUT and as your junior i am really proud of you
@SonuKumar-sf1ch3 жыл бұрын
This is Amazing! Taking more mock interview for helping people.
@KeertiPurswani3 жыл бұрын
For sure. Thank you! 🙏😇
@ashutoshsingh55683 жыл бұрын
Good one. this kind of interviews will give us path to focus more on problem solving skills. Thanks for sharing. I also follow Nishant channel so I also wanted to see how he performed here. 😅
@shashankprabhu41263 жыл бұрын
This video was soo good ma'am. Me as a 1st year student of CS, i have an idea of how mock interview would be and how we can talk and prepare for it. More mock interview and more questions plz would love it
@helloworld66533 жыл бұрын
He definitely didn't answer the first question properly... As it's a straight forward greedy problem and he is thinking of doing graph, backtracking and all. If this is a interview he will be definitely rejected!!!
@ritwikchakraborty17023 жыл бұрын
yes it is greedy bro i also think ... simple maniplutaion with index
@harshavardhanranger3 жыл бұрын
how can u directly conclude its a greedy prob, unless u first brainstorm the solutions possible and understand the core of the problem. He was really good to do that.
@helloworld66533 жыл бұрын
@@harshavardhanranger yes you need to think for a while, but not 30 minutes to come up with the approach after so many hints... I am not opposing nishant bhai, ppl sometimes may stack with the problem, but just want to say it was not up to mark performance to clear interview if it was an actual interview...
@shivammishra-sj8jo3 жыл бұрын
Kindly organise such interveiw often so we can get an idea
@KeertiPurswani3 жыл бұрын
For sure shivam 😊😇
@hrishikeshnikam15843 жыл бұрын
This was amazing! Could you have students from TIER 3 COLLEGES who have cracked product based companies or FAANG . That would be great!
@KeertiPurswani3 жыл бұрын
Sure, noted 😊
@hrishikeshnikam15843 жыл бұрын
@Satish Sutar I am aware of that. And I'm a third year student from a Teir 3 college and I'm trying my best to change the fact that product based companies overlook Tier 3 college students.
@vivekkumar-ix8wc3 жыл бұрын
We can solve the first question using sliding window technique by take the window size = k and checking the ith and kth position for T and P. If ith and kth index is T and P, increment the count and move the window to right.
@akashyadav32112 жыл бұрын
Yes...
@deadpool_00773 жыл бұрын
This was great, I was coming up with the solution myself, and was applying my approach on docs.. please do more of these. :)
@KeertiPurswani3 жыл бұрын
That's exactly how you are supposed to watch these videos. More power to you ❤️ Hope you are liking rest of the videos as well 😇😇
@SaurabhSharma4203 жыл бұрын
The first question was very simple, 2 iteration (forward and backward) would have done the task. The question would have been solved for not more than 20 mins.
@nikunjkhakhkhar10303 жыл бұрын
That seems to be a greedy approach which won’t work in second case since if P at index 2 catches T at index 1 then P at index 3 won’t be able to catch T at index 0 since distance is larger than k=2, so I don’t think it will work.
@SaurabhSharma4203 жыл бұрын
@@nikunjkhakhkhar1030 why would P at index 3 need to catch T at index 0.. T at index 0 will be taken care bt P at index 2, for K=2
@ShubhamKumar-pv8pj3 жыл бұрын
I don't know why I am getting nervous while reading the questions 😄 Thank you for giving us Idea what to do and not to do ❤️
@KeertiPurswani3 жыл бұрын
Happens with everyone Shubham! Hoping the videos help 😇🙏
@ShubhamKumar-pv8pj3 жыл бұрын
@@KeertiPurswani definitely it help ma'am for student like me who just get admission in college 😊
@shivabansfore75103 жыл бұрын
the approach for first program is very simple it is a greedy problem where you just need to catch the theif to your leftmost in range so that the distance between theif and police decreased and you can catch maximum thiefs.
@darshanmukadam2 жыл бұрын
Or check left and right both?
@pgigamingtelugu35059 ай бұрын
Used the concept of Stack to solve this. Like I used a police stack to store the indices of Police and another stack for theif. I used this because the condition states that each police can only catch one theif which indicates popping both the indices from each stack because they are of no use later. So the time complexity would be O(n) and Space complexity is O(n).
@suryanshsinghchauhan5750 Жыл бұрын
An Optimized solution for the second question would be to use binary search. the range of possible answers would be [1 - max number in given array] . we can just apply the binary search on this range and for each mid which we encounter we will just check whether or not it is possible to get that mid as the max number. If it is possible to get the mid as max we will check in the left part of the array and store the mid as ans, and if it is not possible for us to get that mid as max in given array we will check in the right part. we will do it until low < high. If low >=high we will come out of the loop. I hope it does make sense 🙂🙂
@ankita81993 жыл бұрын
Awesome video, get to know about really good perspective of how to approach solution and communicate with interviewer. Please make more videos like this!
@KeertiPurswani3 жыл бұрын
So glad you liked it Ankita. Thank you❤️🙏😇
@Smile20212 жыл бұрын
Pahli baar hasi udi hai chahar bhai ki🫡🫡
@acousticIndie3 жыл бұрын
Thank you, ma'am, for those tips you flash in between also help us greatly as to how the interviewer might be thinking. Very helpful, thank you!
@timetoknow3171 Жыл бұрын
Hi , I came across the video after watching the striver mock interview . Worth it .
@souravsinha41732 жыл бұрын
I think Nishant bhaiya's approach for the second question will fail for the testcases like 2,100 and k = 1. Here Max(A) = 100 , Max2(B) = 2 ; So , C = 100 - 2 = 98 ; after inserting in priority queue we get {98 , 2 , 2} in priority queue. Since we have already exhausted our k(k was 1), our max answer will be 98 , but ideally it should have been 50.(If we had simply divided it by 2).
@abhishekshrivastava98953 жыл бұрын
second question approach will fail for tc [ 8 , 12 ] and k = 2 According to his approach answer will be [ 8 , 8 , 4] -> [ 4 , 4 , 8 , 4 ] so it is 8 whereas answer will be 6 [8 ,12] -> [ 8 , 6 , 6] -> [4,4,6,6]
@ABHAY-hu9kw3 жыл бұрын
subscribed :) thanks for making this type of video. came from nishant bhaiya's channel.
@KeertiPurswani3 жыл бұрын
Welcome to the channel. Hope you like rest of the videos as well. I will keep creating 🙏😇
@ABHAY-hu9kw3 жыл бұрын
@@KeertiPurswani yaa i had watched rest of the videos on your channel 😇
@prasantharavindramesh10783 жыл бұрын
Awesome video.Itll be very useful for us if you can make more mock interviews especially for Amazon
@KeertiPurswani3 жыл бұрын
Yup. Hoping the videos will help 😇😇
@soumyadiptabanerjee82563 жыл бұрын
The second answer would fail for 18,17 and k=2.
@namantewari75863 жыл бұрын
yes. even with 7, 17 and k=1
@tarunbisht80163 жыл бұрын
@@namantewari7586 yeah dude i was thinking same that will work only if k is greater than 2 ig
@studyminutes_com Жыл бұрын
Brute force will be O(n*k) for each policeman check from kth distance at left until there is thief. Optimal O(n) use queue for thieves.
@nikcsm3 жыл бұрын
A very simple solution is For each policemen, tabulate every element at k distance from him thus their positions are already known as index_of_police + or - k . And then for each of them , try marking the left thief first and then if left DNE, then mark the right one. Once a T is marked, don't touch him again.
@adi8079803 жыл бұрын
First Question with O(n*2) brute force approach inputarr=["T","T","T","P","P","T","T","P","P","P","P","T","T","T"] temparr= [0 for i in range(len(inputarr))] k=1 k=k+1 count=0 print(temparr) for i in range(len(inputarr)): if inputarr[i]=="P": for j in range(len(inputarr)): if (inputarr[j]=="T") and (abs(j-i)
@ashutoshsingh55683 жыл бұрын
Max thief count problem solution has been made a little complicated by Nishant as I solved it with simple nested for loops and one Boolean array which will set an index to true whenever a thief is caught and based upon that Boolean value of thief index I can move forward. Finally I can count the total true values and that is the total count of thieves caught.
@depression_plusplus61202 жыл бұрын
Simply use binary search concept. That's what was required here
@mano36803 жыл бұрын
Gud work! Please do more mock interview like these...Thank you!
@KeertiPurswani3 жыл бұрын
One more is up today. Hope you like it ❤️😇
@mahaksaxena14013 жыл бұрын
This is very informative . I have been practising dsa from a long but yet not sure if i am ready for interviews or not. But this video really help to realize where i stand now. Thank you di ❤️
@KeertiPurswani3 жыл бұрын
So glad it helped Mahak. Thank you 🙏❤️ All the best for your interviews 😊😊
@y17t903 жыл бұрын
so are you ready
@DeepakYadav-vu1fz2 жыл бұрын
Dii it was very good
@caimgeo50092 жыл бұрын
From my experience with micosoft. Don't think and find solutions yourself. Those interviewer wont accept your own solution. They want exactly what is on the internet. Spend time in look all the websites and Better memories them as they are in Internet. 90% percent you will succeed.
@vikashmishra5210 Жыл бұрын
0:06 now he got 200k+ subs..!! gone a long way
@nitishjha85493 жыл бұрын
PYTHON SOLN FOR QUES 1: lis=[] n=int(input()) for i in range(n): lis.append(input()) k=int(input()) count=0 for i in range(len(lis)): if lis[i] == 'P': for j in range(len(lis)): if lis[j]=='T': if(k>=abs(i-j)): count+=1 lis[j] = 'c' break print(count)
@littlemaster74263 жыл бұрын
Seeing this ,I learnt a lot ,thank you very much Mam . Please upload more these types of mock interviews
@AnkitKumarCoder3 жыл бұрын
I'm so amazed THank you so much
@firdoushsiddique12803 жыл бұрын
#Keerti Purswani thanks for letting us to have Idea about interview session and also to expand the horizon. a humble request to you to share your knowledge with us regarding learning d s algorithm and programming questions so that we can take start early Doing the great work keep it up 👍👍
@afzalnomani75612 жыл бұрын
My approach -: 1.take a police array and thief array and store their corresponding index. 2.iterate on police array and if absolute difference b/w each element
@SoloScholar02023 жыл бұрын
Personally I feel that if the interviewer is explaining the question, he would sometimes hint the solution or maybe an approach to solve which can be a boon for the session. Corrections are always appreciated.
@siddharthkeshri56493 жыл бұрын
The second was Based on Binary Search I guess It was like allocate Minimum no of Pages
@5590priyank3 жыл бұрын
His approach won't wok for [7,17], K = 2 as per his ans, we will do [7,7,10] then [7,7,7,3] and it ends. But we can get [7, 6,6,5] then [3,4,6,6,5] and we will have 6 as ans
@Shivamkumar-xu6hu3 жыл бұрын
We can divide a number into 2 numbers ... You did [7,17] = [7,6,6,5] It will take 2 steps to do that.
@aayushpatel7923 жыл бұрын
Very helpful session done by you and Nishant Bhaiya.Thank you
@code62333 жыл бұрын
thank you ma'am for this video. Please make more videos like this.
@prashantprogrammer86993 жыл бұрын
more mocks like this would be great!!
@souravmalik61202 жыл бұрын
Was able to code first question in mere 2 minutes. Extremey elated. yesssssss!!
@Trax2551 Жыл бұрын
Kaise hoga
@Ji-yoon3 жыл бұрын
Nice.....Do more videos of this kind.....
@ranvijaysinghchauhan59523 жыл бұрын
It is very good. I learn a lot about do's and don't in interview. I am looking for more such mock interview. Thank u so much.
@KeertiPurswani3 жыл бұрын
Thanks Ranvijay. More coming up! 😊😇
@salvo96963 жыл бұрын
Can you do some frequently asked leetcode or hackerrank questions and the approach to solve them, what data structures should one use and why. Also some problems do not have a straightforward time and space complexity, so how do we tackle those. And keep going this is absolutely great and very helpful.
@ng3w8783 жыл бұрын
A real mock interview Di...!! You really scared at some moments 😅😅... Also di he already declared vector and you were asking in which language will you be coding...😁😁 I am going to follow you greatly for my internship prep and placement prep🤟... And di one more thing if you could answer..are two projects enough...to display in our resume...of a webapp??...it would be of great help if you could let me know🤟🤟
@KeertiPurswani3 жыл бұрын
Why am I scared though 🤭🤭 He is the one interviewing 🤭 Han I know, I wasn't expecting him to code in C++, plus I just asked so that viewers can know 😅😅 Depends on the projects and the level of your contribution 😊
@mukeshmahajan15863 жыл бұрын
Thanks Intuit Vali didi ...u r awesome💕
@KeertiPurswani3 жыл бұрын
This is new. Pehli baar suna "Intuit vali didi" 🤭🤭😂😂
@mukeshmahajan15863 жыл бұрын
@@KeertiPurswani ap ho na hmare intuit vali didi :)
@SaiKumar-kt7cc3 жыл бұрын
Explaining the question looks great. coz it gives better understanding and can get more hints😂
@user-cd7lf8nk4cАй бұрын
Testcase for Question 2 : arr = [ 2 30 ] k=1 Accoding to Nishant Solution ans = 28 but according to me we can split 30 into 15.15 to get [ 2 15 15 ] ans will be 15
@vaibhavgupta9733 жыл бұрын
i am your new subscriber . it would be helpful if could upload more Mock coding interviews.
@KeertiPurswani3 жыл бұрын
Welcome to my channel Vaibhav. Hope you like rest of the videos as well. More mock interviews coming up 😊😇
@humbleGuy_17292 жыл бұрын
0:01 I thought you were cleaning your screen
@shubhamtiwari96112 ай бұрын
Really Helpful!
@rules4362 жыл бұрын
I do think solution is over-engineered , its a sliding window problem and it can be solved in 0n in one pass. with 2 counters one for result and one from -k to +k to keep count of pending police or thief , updating counter is bit tricky thou you dont need those vectors For 2nd qus the split should be either a/2,a/2 or a-b, b Where num is list is 1 4 3 9 12 and K as 2 having solution with a-b be 9 and a/b will be 6
@himanshujain70143 жыл бұрын
Fantastic🤘😝🤘
@aniket82923 жыл бұрын
in 2nd que , his approach is wrong Ex:- {7,17} k=3 According to me :- 7, 6,11 k=2 7,6,5,6 k=1 4,3,6,5,6 k=0 Max = 6 but according to nishant 7, 7,10 k=2 7,7,5,5 k=1 7,7,0,5,5 k=0 Max = 7 So he was wrong.....
@MayankSharma-wx4mf3 жыл бұрын
Correct take k=1 for instance. The ideal breakdown is 7,8,9 but as per him it will be 7,7,10
@aniket82923 жыл бұрын
@@MayankSharma-wx4mf finally I got someone who understands me 😊
@sushantsingh56893 жыл бұрын
One genuine thing was..it was not scripted. Most of the times in such playlists interviewer already know the soln and act first 10-15 min and then come to brute with 100% confidence ..This one was completely done by him at instant ! Nice work guys .
@prakashg19443 жыл бұрын
Really good one, keep going..... You finally smiled at 32:04, till then you kind of giving a confused look :) ... I also can hear some background noise/feedback, it could be a fan sound or something.. not sure..
@JangBahadur30283 жыл бұрын
Zomato वाले बन्दे की तरह smile किया था starting में ...😊
@omkarkumbharkar9063 жыл бұрын
Thank you so much such a helpful vedio and inspiring Tysm kerti di👍🎉
@vermaankit20053 жыл бұрын
Cann't this question be solved using sliding window and HashMap 1.Take a window of K+1 items and maintain number of police and thiefs. 2. Find min of these values and subract with count of both police and thief. 3. Slide the window by 1, (reduce the count of the item removed from window , if any left and add new item) Keep doing this till window reaches end. Correct me if this solution won't work .
@KeertiPurswani3 жыл бұрын
Hi Ankit, If you notice, he is doing the same thing finally. Instead of saving two vectors like he did, you are using hashmap And he used 2 iterators (2 pointers) and you are calling it window technique. If you have watched my window sliding technique video, I have explained how window technique is same as 2 pointer technique. Hope I was able to explain 😊
@vermaankit20053 жыл бұрын
Understood. Thank you for replying. 🙂
@rogerop67213 жыл бұрын
one thing that i understood from this video is that , interviewer don't want a correct solution with optimized space and time complexity in the very first try ,what he/she actually want is the discussion of 40 to 60 minutes on the question. He want to analyse how the candidate handle the situation when he got stuck or how good is he in grasping the hints . Thankyou Keerti and nishant for this video . 0_0
@shubhamsingh-gb5zh3 жыл бұрын
It is really very helpful. Please keep making such type of videos keerti❤️
@KeertiPurswani3 жыл бұрын
So glad toy liked it Shubham. More videos coming up 😇😇🙏
@mechanicalengineer13 жыл бұрын
++respect @Nishant Chahar
@VikramSingh-mj2ug3 жыл бұрын
I feel the second question is solved wrongly. It will fail for a simple TC as arr = {2, 17} and k = 2.
@pranaytanniru77643 жыл бұрын
thank you so much for asking the interviewee to speak in Hindi, I really wanted to know the solution and not miss anything cause I am not good with Hindi.
@KeertiPurswani3 жыл бұрын
I understand. This channel is for you as well 😊
@pranaytanniru77643 жыл бұрын
@@KeertiPurswani thanks :)
@AshutoshPandey-se8vt3 жыл бұрын
amazing work, thanks a lot
@KeertiPurswani3 жыл бұрын
Thanks Ashutosh. Means so much! ❤️
@animeshkumarjha40693 жыл бұрын
Mam please Do more mock videos like this . Thank you mam for making such videos.
@singhji4149 Жыл бұрын
Keerti, beleive me ur vedios are mind blowing....
@sharathpaka419810 ай бұрын
@KeertiPurswani - Keerti, is the 2nd problem discussed here in this video the same as this? If not, what's the difference? kzbin.info/www/bejne/enK0eYubZt6Bqq8
@m.vineeth97243 жыл бұрын
This was the best learning experience so far. Please make more such videos, it really makes me feel as if I am giving the real interview.
@KeertiPurswani3 жыл бұрын
For sure Vineeth. Glad you liked the video 😇
@krishmakhija8333Ай бұрын
i think first question can be solved using unordered_set data structure easily by putting the thives in the set which can be catched by any police means they are catchable thief. if size of set > total no. of police return total no. of police. otherwise return total no. of thief.
@Cubeone113 күн бұрын
O(nlogn)will be time complexity for your soultion
@samagrapathak38542 жыл бұрын
hey i am like like ,i just cant explain (super impressed mam)