Google Backend Engineer Interview Questions
Prepare for this exact position with 2 real candidate reports. Review the levels, locations, interview formats, and questions that appeared most often for Google Backend Engineer candidates.
2
role-specific reports
9
questions found
1
levels represented
2
locations represented
Search real candidate reports
Google Backend Engineer candidate reports
Search within this position by level, location, interview type, outcome, or a specific question.
2 matching interviews
Backend Engineer · L4
- 01
Solve a breadth-first search traversal problem.
Coding & Algorithms · Medium
- 02
Find the minimum path between points while avoiding obstacles using Dijkstra's algorithm.
Coding & Algorithms · Hard
- 03
Two diseases spread from different starting points toward a destination; determine if the first disease reaches it given relative power and movement constraints.
Coding & Algorithms · Hard
Backend Engineer · L4
- 01
Count the number of nodes reachable from a source to destination in a directed graph.
Coding & Algorithms · Medium
- 02
Given a directed graph with time constraints on connections, determine the earliest time when all nodes become mutually reachable.
Coding & Algorithms · Hard
- 03
Given an N-ary tree encoded as an array with parent pointers, return the modified array after removing a specified leaf node.
Coding & Algorithms · Medium
Most-asked Google Backend Engineer questions
Ranked by how often each question appeared in reports for this exact position. Answers are written by our team.
More reported questions
- 01
Count the number of nodes reachable from a source to destination in a directed graph.
asked in 1 reports - 02
Describe a challenging situation you faced and how you handled it.
asked in 1 reports - 03
Find a peak element in a mountain array containing duplicate values.
asked in 1 reports - 04
Find the minimum path between points while avoiding obstacles using Dijkstra's algorithm.
asked in 1 reports - 05
Given a directed graph with time constraints on connections, determine the earliest time when all nodes become mutually reachable.
asked in 1 reports - 06
Given an N-ary tree encoded as an array with parent pointers, return the modified array after removing a specified leaf node.
asked in 1 reports - 07
Given employee arrival and departure times, output which employees are available during each time interval.
asked in 1 reports - 08
Solve a breadth-first search traversal problem.
asked in 1 reports - 09
Two diseases spread from different starting points toward a destination; determine if the first disease reaches it given relative power and movement constraints.
asked in 1 reports