Two LeetCode Style Questions:
Maximum Subarray Sum:
Problem Statement: Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Balanced Binary Tree:
Problem Statement: Given a binary tree, determine if it is height-balanced. In a height-balanced tree, the depth of the two subtrees of every node never differs by more than one.
I can't remember, but it was Data Structures and Algorithms.
The following metrics were computed from 1 interview experience for the Google Software Engineer role in Eugeniów, Poland.
Google's interview process for their Software Engineer roles in Eugeniów, Poland is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Google's Software Engineer interview process in Eugeniów, Poland.