MIH Interview Question Software Engineer / Developers
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.
I have this weird sol method. Am sure smarter ones exist.
- knap October 14, 2008This sol involves forming a graph. The starting word is the source node and end word as dest node (for now assume it exists in the dictionary). An edge is formed when the nodes are one character away. So this completes the graph. Now its simple dijkstra algo with dest word as a break condition. The number of hops and intervening nodes give u the answer.
If dest is never met then the word can't be converted thru' the transformations.