1- Create a hash table.
2- Insert each char of S1 in the hash table.
3- Iterate every char in S2. If that char is in the hash table return the index.
If the index ==strlen(S2) return -1;//Not found
The order of checking an element in the hashtable is O(1) therefore the order of the function is O(n)
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.
If the question is: "Get the first character from s1 that is repeated in s2." (otherwise, reformulate the question and/or give a sample), then:
- S January 17, 2011-Assume ASCII.
-Create a array a[128] where you set the frequency of the characters from s2.
-For every char in s1, check if the frequency is >= 2.
-O(n+m)