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.
i think, we can achieve this by following, merge sort technique (External Merge Sort)
- janardhana.ch April 02, 2016split the file into chunks.
use merge sort/insertion sort (as you doing only chunks by chunks, performance wise both are okay)
and after sorting each chuck , write them back to the disk, repeat this process for all chunks and for both files.
when each file are completed, treat them two separate sorted arrays, and now do the merging.
while doing merging, if you see duplicates keep them in a List (some data structure in memory) and throw away all other string
at the end you have only duplicates that you want to find.
this can be done in O(nlogn) where n = x+y (number of words in file 1 + number of words in file 2)