unknown Interview Question Developer Program Engineers
Country: United States
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
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.
Solvable with recursion, start with the whole matrix, check the edges of the rectangle, if an edge contains O, split the matrix into three areas without the O, solve the problem for the 3 smaller areas. DP - keep track of the biggest rectangle found so that the smaller areas that can't contain a bigger rect aren't explored. Dunno if that is optimal though, this is 3^(n*m) with DP, this would be my first try.
- JimmyMVP February 27, 2016