PracHub
QuestionsLearningGuidesInterview Prep

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.

  • medium
  • Google
  • Coding & Algorithms
  • Software Engineer

Solve Flower Placement and Directory Deletion

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Quick Answer: 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.

Last updated: Jun 19, 2026
Loading…
PracHub

Master your tech interviews with 8,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • AI Coding Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.

Related Coding Questions

  • Count Overlapping Rectangle Updates on a Grid - Google (hard)
  • Find A Threshold-Limited Path With Minimum Required Safety - Google (medium)
  • Filter Repeated Robot Status Messages - Google (medium)
  • Minimize Direction Violations in a Directed Road Network - Google (medium)
  • Find the Largest Monotone Increasing Number - Google (medium)