Google SDE interview experience sharing, including Google's OA and two rounds of interview process, take a look together.
Google Interviewcourse of events
Online Test(OA)
The first round is an online test. There were five sets of questions, each with two topics, and you would be randomly drawn to one set. We spent most of our time on the second question, the first one was a leetcode easy question, but it was roughly known that it was a question about graphs.
The title is as follows:
Given an array A of integers of length n, define aThe good triad.is the set of three indexes (i,j,k) that satisfy the following conditions:
- Indexing conditions: 0≤i<j<k<n
- Array Value Condition:
- For all i<q<jMeet:
- Satisfies: A[i] > A[q] and A[j] > A[q]
- For all j<p<k, satisfying: A[k]>A[p]
- Good ternary distances:
- Defined as: distance = k-i+1
Find the good ternary in the array A ofMaximum distance.
Logic: Use the monotonic stack to preprocess the position of each index, i.e. how far to the left and right it can be extended. The array is then traversed, assuming the current index is the first element of the ternary, and using the preprocessed data the second and third indexes can be found quickly to compute the distance of the ternary in O(1) time.
result：Finally passed all the test cases. Successfully shortlisted for next round of interviews!
GoogleFirst round interview (VO)
The interviewer was a new Google employee and very friendly. We spent 5 minutes introducing ourselves and then she gave the following questions:
Question 1: A string is calledgrouped string, if all the characters in it occur consecutively. For example.AAABBBBBCDEE is a grouped string, and AAABBBACCED It's not.
Given agrouped strings and an integer k, you need to divide the string into groups of size up to kkk, e.g. the first k characters are group 1, the next k characters are group 2, and so on. Note that the last group may be less than k characters.
A character is calleddistributed character, if it appears in more than one group. For example, for the string AABBCCDEE and k = 2k, grouped as aa, bb, cc, de, e. Characters E appear in more than one group and are therefore distributed characters, while the rest of the characters A, B, C, D Then no.
Requirement: output string inUndistributed charactersQuantity.
Idea: Maintains two hash tables: a global hash table to record characters that have appeared in previous groups, and a hash table for the current group to record characters in the current group. Iterate through the groups, checking to see if each character occurs in more than one group.
Question 2: Given a binary tree, each node has a value of 0 or 1. An island of 1 is defined as a contiguous region of 1s (1s separated by 0s or bounded by boundaries). Enter the root node of the binary tree and return the number of islands.
Idea: Recursively traverse the tree, splitting upstream and downstream islands when a node with value 0 is encountered, otherwise merge the islands.
Google Second Round Interview (VO)
This round is slightly more difficult, but the questions are logical. Included:
- Finds the length of the longest subarray that is all zeros.
- Find the area of the connected region with the largest 1 in the binary matrix.
- Find the area of the largest rectangle with all zeros in the binary matrix.
Final Results: After several rounds of interviews, the student was successful in securing an internship at Google!
Reference
We provide interview support services such as Interview Assist, VO Assist, VO Assist, Interview on behalf of Interview. For OA assistance, we will make sure you get full marks, for interview support, we are sure that we can help you to get the big company Offer, if you need Google's interview support service, pleaseContact Us.
