Google Interview Question Java Developers
Country: United States
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.
we are given a string as input.
- eitan_ben_amos@hotmail.com January 20, 2018the SWAP rules are:
(*) the 'L' character can only swap to the left, i.e. move left.
(*) the 'R' character can only swap to the right, i.e. move right.
both 'L' & 'R' can only swap with the '_' character.
so we need to find a sequence of SWAPs that will bring the left-most character can arrive at the right-most position
i'm assuming the string is made of only those 3 characters bcz otherwise, a different character at either ends means it can SWAP.
and in any other position, its simply ignored bcz it cannot SWAP.
!!! Observation !!!
* it seems that once we have 'L' on right-most position, 'R' on left-most position (to satisfy initial requirement), we only need 2 '_' characters within the string, regardless of their position.
lets all these two '_' characters F & S *for first & second from left.
so the following sequence always works:
SWAP(left-most index <--> S)
SWAP(right-most index <--> F)
SWAP(right-most index <--> original position of S)