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.
Here is the most simple solution....but it takes you to o(n) worst case and best case o(1)...
- RamSrini September 08, 2016import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class WAPSumbetweentwoLists {
public boolean isTargetFound(){
List<Integer> list1=Arrays.asList(10,02,73,46,5,16,7,8,29);
List<Integer> list2=Arrays.asList(11,2,31,4,5,56,7,88,29);
Scanner scan=new Scanner(System.in);
int targetValue=scan.nextInt();
System.out.println("targetValue>>>>>>>>>"+targetValue);
for(int i=1;i<list1.size();i++){
if(list2.contains(targetValue-list1.get(i))){
System.out.println("here u go>>targetValue>>"+targetValue);
System.out.println("here u go>>list1.get(i))>>"+list1.get(i));
System.out.println("here u go>>>>"+(targetValue-list1.get(i)));
return true;
}
}
return false;
}
public static void main(String args[]){
WAPSumbetweentwoLists w=new WAPSumbetweentwoLists();
boolean isfound=w.isTargetFound();
//sysout();
System.out.println("isfound>>>>>>"+isfound);
}
}