Quick Overview

This question evaluates combinatorial constraint-satisfaction and permutation/matching skills for the flower-placement grid alongside filesystem traversal and recursive versus iterative deletion strategies for the directory-deletion task.

Solve Flower Placement and Directory Deletion

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: This question evaluates combinatorial constraint-satisfaction and permutation/matching skills for the flower-placement grid alongside filesystem traversal and recursive versus iterative deletion strategies for the directory-deletion task.

Read the full Google Software Engineer interview experience this question came from

Loading…