LeetCode
Question
·
Aug 2021
Google OA For FTE
6 upvotes
2,134 views
9 replies
Question Details
Google OA for FTE. 1) Question related to prefx sums(Easy). 2) Given a tree and values(B[i]) for each node in the tree, find for every node, the least non-negative integer that does...
Full Details
🔒
Unlock all Google questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a google interview for a swe role during the oa round reported in 2021.
It covers the following topics: Arrays, Binary Tree .
Difficulty rating: Easy
Topics
More Google Interview Questions
Reddit
7 months in Google Team Matching
Reddit
Google L4 SWE prep
Reddit
Google team matching new grad 2026 - US
Reddit
I got offers from Google, Meta, Amazon (SWE intern) by GRINDING for exactly ONE year which made technical interviews for big tech TRIVIAL (rant)
Reddit
Google L4 India - Accepted | Compensation and Preparation