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.
How about following?
- dilip.kumar2k6 April 04, 2014c^((b^c)&-(a&1))
Following is logic behind this.
1. First mask a to convert into either 1 or 0 using a&1
2. Now change (a&1) into negative number, in case of 1 it will be converted into -1 and in case of 0 it will be 0. When it will become -1 then in binary it will be full of 1 sequence.
3. Following are two cases.
a. When a&1 is 0 then result should be c
b. When 1&1 is 1 then result should be b.
Based on above two condition applied logic.