@@dhruvmittal4992 not sure about other interviews but this one is probably not. The guy who gave interview is having you tube channel and he solves coding problems.
Haha 😆, hackerrank mai problem setter hai aur acting aise kar rha jaise uske dimaag mai naye naye approach prakat ho rahe hai. Ek ek algo rata hua hai isko.
In sorted for majority of answer exist it will be middle element,now count frequency of that middle element using binary search 0(logn) like first occurence and last occurrence and verify is it greater than n/2and done
Guys , the guy giving interview is from our college , academy of technology , west bengal , proud of you big brother ❤️, you are motivation 🔥for all the juniors
Try to ask Question before JUMPING into problem : For ex in majority problem(problem number 2 ) : 1 - He could have asked is array sorted or not ? 2 - values in array will be in range (1,N) or not ? 3 - Also after providing some solution and interview is looking for something better - can check with him what are trade offs he i looking for in solution ? Overall can say that good job done here to explain interview experiences. Kudos to GeeksforGeek for sharing this.
no, check if the the 2nd test case if another leaf node was present on the node 8, the burning would still remain same from the node 10. Hope you understand
Fake af …real interviews are much more nerve cracking…straight away he starts giving solution without even asking single cross questions …striver did an interview which was 100% realistic than this
This guy is next level actor he knew prime sieve and still acted like noob giving other approaches.
Exactly, are these mock interview scripted?
@@dhruvmittal4992 not sure about other interviews but this one is probably not.
The guy who gave interview is having you tube channel and he solves coding problems.
That's how interviews are supposed to be
@@muktadirkhan6674 Yeah ! Absolutely
Haha 😆, hackerrank mai problem setter hai aur acting aise kar rha jaise uske dimaag mai naye naye approach prakat ho rahe hai. Ek ek algo rata hua hai isko.
In sorted for majority of answer exist it will be middle element,now count frequency of that middle element using binary search 0(logn) like first occurence and last occurrence and verify is it greater than n/2and done
Guys , the guy giving interview is from our college , academy of technology , west bengal , proud of you big brother ❤️, you are motivation 🔥for all the juniors
Bro , can you suggest some good mock interview videos ??
This dude is not even thinking 🙂 just talking answers. All my fellow noobs be patient with your grind. We can do this!! Lessgoo
Bro , can you suggest some good mock interview videos ??
For majority element, without sorting, I presume the interviewer was looking for Boyer Moore voting algorithm
he gave moores vooting algo i think the interviewer wanted to confuse him with sorting
Yeah
1st question- this is what i do when i know the solution.
2nd question-- this is what happens when i dont know the solution.
Lol
Try to ask Question before JUMPING into problem :
For ex in majority problem(problem number 2 ) :
1 - He could have asked is array sorted or not ?
2 - values in array will be in range (1,N) or not ?
3 - Also after providing some solution and interview is looking for something better - can check with him what are trade offs he i looking for in solution ?
Overall can say that good job done here to explain interview experiences. Kudos to GeeksforGeek for sharing this.
Q . Print prime numbers in a range
Naive approach : 2 loops
TimeC: o(n*n)
Best cases : sieve of eratosthenes
Time: o(nloglogn)
Excellent, just excellent.. How well groomed this guy is.. churning out solutions on solutions.. wow
This is quite helpful
a great initiative by GFG. please make more such mock interviews
Yeahhh!.. This guy is really next level actor he knew prime sieve and majority element and still acted like noob giving other approaches.
As a subscriber of yogesh RUclips channel , Nice 🙂 Interview
Search till half the length of the array.
OMG , same question in same order asked
to me . 🤣🤣
Which company?
Bro , can you suggest some good mock interview videos ??
these interviewers are so lazy
What would be the selection chance if someone can answer 1st and 2nd questions with optimization but can't able to solve 3rd.
weak chances considering burining tree is a common questions and other candidates would solve that problem.
Bro , can you suggest some good mock interview videos ??
3rd question I think was a direct question on diameter of a binary tree
no, check if the the 2nd test case if another leaf node was present on the node 8, the burning would still remain same from the node 10. Hope you understand
It's a good one for aspirants
Bro , can you suggest some good mock interview videos ??
Time complexity will be nlogn first soln
Piyush sir great
Q how to check wether array contains majority element
:Boyer-Moore majority vote algorithm
Very nice interview
35:03 ...bhai sir ne sidhe binary search use karne ko bola he 😂
Fake af …real interviews are much more nerve cracking…straight away he starts giving solution without even asking single cross questions …striver did an interview which was 100% realistic than this
Why dont he use boolean ...rather than he is always using int with 0 and 1....strange for me....
Not everyone are same
uski mazi bro
more or less the same
in cp it doesnt matter
wah gfg mauj kra di
Tips for the students aaaaa aaaaa aaaaa can you aaaaaa help them aaaaaaaaa
Koi... web backend ka telegram share karo..
9:00
According to me his basics are not good.
Koi dsa ka telegram dedo
bhai kya acting kr rha hai yogesh hahaha
I WANT TO GIVE A MOCK INTERVIEW.
give it on "pramp"
Bro , can you suggest some good mock interview videos ??
Prepare carry pen & paper 📃