is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.
Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.
Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.
1.) sort the array(waters array) in descending order.
2.)Assuming every bucket as candidate find the minimum amount of water need to be removed.Result will be minimum amount of water among that.
3.)Every bucket which is in left of current bucket have more water than current bucket and every bucket which is in right of current bucket have less water than current bucket.
4.)For every bucket we remove all the bucket on its right and some amount of water from all the bucket on its left(they have more water).
5.)Amount of water removed can be calculated using (total_water - waters[i]*(i+1)).
5.) res = min(res, total_water - waters[i]*(i+1)).
6.)Time complexity - O(n) and Space Complexity - O(1)
- harivanshkashyap04 August 10, 2020