View All num of num See all Photos Goldman Sachs www.goldmansachs.com Engaged Employer Overview Reviews Salaries Interviews Jobs Photos Benefits 2.1k Reviews 7.5k Salaries 2.1k Interviews 1.5k Jobs Follow Add Interview Follow Add Interview Interview Question New Associate Programmer Analyst Interview(Student Candidate) Salt Lake City, UT Goldman Sachs Implement an intersection method for two lists. After showing a brute force method, I was asked to improve upon the method and analyze time complexity for both algorithms. Tags: algorithm See more , See less 8 Answer Add Tags Answer Interview Answer 1 Answer ▲ 2 ▼ 1. Traverse through the first list and put all items in a hash table.2. Traverse through the second list and try to find these items in the hash table created in step 1 -> Add all items found to the intersection list.O(N) complexity. Vinod on Nov 19, 2012 Interviews > New Associate Programmer Analyst > Goldman Sachs Add Answers or Comments To comment on this, Sign In or Sign Up.