← Google Interview Insights

Google·Software Engineer·Onsite - Coding / Algorithms·Intermediate

IntermediatePending
Aug 2026

Summary

Had a Google SWE round where the interviewer skipped a written problem statement entirely and just showed me an image, expecting me to figure out what the problem even was before solving it. Managed to identify it as a graph problem about finding max node values, but ran out of time before I could work through the adjacency list construction properly. Came out of it pretty unsure whether any of that was enough.

Questions Asked (1)

Q1

You are shown an image with no accompanying problem statement. Deduce the underlying algorithmic problem from the image, then solve it.

Algorithms & Data StructuresAdaptability & Ambiguity
Author's notes

This format genuinely threw me.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by carefully describing the image and asking clarifying questions to confirm your interpretation. Then, restate the deduced problem in your own words, outline a solution approach, and discuss trade-offs. Finally, walk through an example to validate your solution.

Pro tip: Verbalize your thought process and explicitly state assumptions; interviewers value structured reasoning over a perfect answer. If the image is ambiguous, propose multiple interpretations and ask which one to solve.

1. Describe the image

Verbally describe what you see in the image, focusing on elements that suggest an algorithmic problem (e.g., nodes, edges, arrays, grids).

2. Clarify and confirm

Ask clarifying questions to confirm your interpretation and rule out alternative problems. If needed, propose a specific problem statement based on the image.

3. Outline solution

State the algorithmic approach (e.g., BFS, DP, sorting) and explain why it fits. Mention time and space complexity.

4. Walk through example

Use a small example derived from the image to demonstrate how your solution works step-by-step.

5. Discuss trade-offs

Compare alternative approaches, edge cases, and potential optimizations to show depth of understanding.

Key Points to Mention

  • Clearly state assumptions and ask for confirmation when the problem is ambiguous.
  • Identify the problem type from visual cues (e.g., graph, tree, array, matrix).
  • Explain the chosen algorithm and its complexity.
  • Walk through a concrete example to validate the solution.
  • Discuss edge cases and potential optimizations.
  • Show adaptability by considering multiple interpretations if the image is unclear.

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.