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 spent almost an hour to come up with below solution. could please give your feedback on solution.
Let us assume given matrix A[3][3] is
A N T
A I M
T O P
Also assume :: Is_word() check the string & print the string if it is a word
We need to check following strings start with A[0][0] (i.e A ) are words are not
Is_word ( "A[0][0]") ; // A[0][0] is A , first check, single letter could be a valid word
Case 1: Left to Right
AN , ANT
Case 2 : diagonal
AI , AIP
Case 3: Top to down
AA, AAT
similarly check following strings start with A[0][1] (i.e N ) are words are not
Is_word ( "A[0][1]") ; // A[0][1] is N ,first check, single letter could be a valid word
case 1: Left to right
NT
Case 2: diagonal
NM
case 3: top to down
NI , NIO
simlrly of other A[0][2], A[1][0] .... etc. location letters
Code for this problem is
Time complexity O(n^3) .
- Siva.Sai.2021 May 01, 2012Please let me know if find any mistakes in my approach.