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.
Sequence is possible when 1, 4th positions are of the same or 0, 1 positions are same.
- sp August 20, 2014Approach for sequence based on the moves given here:
Checking if a single position can be corrected or not.
By using few moves of A and few moves of B such that total moves is 4 we can achieve any moves on position 2. (A3 times and B1 time - moving 2 one time without changing anything else.)
Now we know that 2 can be changed independent of other positions. Using this and move D we can change 5 independent of others.
similarly.. using 5 and E change 3
Using 3 and F change 7
using 7 and H change 6.
Using 5, 6 and C we can change 1,4 together.
With A we can change 0,1 at the same time and using above 1, 4 at the same time.
If there is change in 0, 1 then we can use 1, 4 moves to match 0, 1 -- But only possible if 1, 4 are same here. Similarly matching 1, 4 possible by using A, with constrain that 0, 1 are same.
Lowest moves?
Don't have an approach but would see which side is present max in 8 positions and remove those.
If I need to correct 2 and 2 has to move 2 times to match to most common I write it as
(2A + 2B)
If 5 has to be changed 1 time then I will write it as three 2' (3A+B) moves and one D
Now for 2 moving two times + 5 moving 1 time. (2A+2B) + 3 * (3A+B) + D= 11A + 5B + D.
Any move multiplied by 4 can be removed.
So total moves for example taken is 3A+ B + D.
Does someone has better approach for finding low moves.