Google Interview Question Software Engineers
Country: United States
Interview Type: In-Person
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.
Looking for interview experience sharing and coaching?
Visit AONECODE.COM for private lessons by FB, Google and Uber engineers
Our ONE TO ONE class offers
SYSTEM DESIGN Courses (highly recommended for candidates of FB, LinkedIn, Amazon, Google & Uber etc.)
ALGORITHMS (conquer DP, Greedy, Graph, Advanced Algos & Clean Coding),
latest interview questions sorted by companies,
mock interviews.
Our students got hired from G, U, FB, Amazon, LinkedIn and other top-tier companies after weeks of training.
Feel free to email us aonecoding@gmail.com with any questions. Thanks!
Sliding window anagram:
- aonecoding November 03, 2017public static List<Integer> getAnagrams(String s, String word) { Map<Character, Integer> letters = new HashMap<>(); int distinct_letters = 0; for(char c: word.toCharArray()) { if(!letters.containsKey(c)) distinct_letters++; letters.put(c, letters.getOrDefault(c, 0) + 1); } //search for anagrams with two pointers List<Integer> res = new ArrayList<>(); int lo = 0, hi = 0; while(hi < s.length()) { if(!letters.containsKey(s.charAt(hi))) { while(lo < hi) { char c = s.charAt(lo); if(letters.get(c) == 0) distinct_letters++; letters.put(c, letters.get(c) + 1); lo++; } hi++; lo = hi; } else if(letters.get(s.charAt(hi)) == 0){ while(s.charAt(lo) != s.charAt(hi)) { char c = s.charAt(lo); if(letters.get(c) == 0) distinct_letters++; letters.put(c, letters.get(c) + 1); lo++; } lo++; } else { char c = s.charAt(hi); letters.put(c, letters.get(c) - 1); if(letters.get(c) == 0) distinct_letters--; if(distinct_letters == 0) { res.add(lo); } hi++; } } return res; }