HashiCorp OA 2025 | Graph Cycles, Interval Merging & Sliding Window
Question · Posted Jun 2026
Problem 1 - Terraform Configuration Cyclical Dependency Detector Problem Statement You are building a parser for an infrastructure-as-code engine. You are given N resource blocks labeled from 0 to N - 1. You are also given a 2D integer array dependencies where: dependencies[i] = [u, v] indicates that resource u depends on resource v being provisioned first. Before executing the deployment plan, determine whether the dependency graph contains a circular dependency. Return: true if the configuration is valid and contains ...
The full answer & interview discussion are available to premium members.
Log in Create a free account