Minimum Direction Violations
Asked at Google · Coding & Leetcode-style Questions · Difficulty: Medium · Last asked Jul 19, 2026
You are given a directed graph with `n` nodes labeled from `0` to `n - 1`. `edges[i] = [u, v]` represents an original directed edge `u -> v`.
Loading the problem…
More Google interview questions
- LLM conceptual questions
- Implement a Nested Tic-Tac-Toe Game Engine
- ML Fundamentals Deep Dive (AI/ML & MLE Roles)
- ML System Design: Recsys, Chatbot, Image Classifier
- ML Coding: Implement a Simple Attention / Layer Forward Pass
- Longest-Match Greedy Tokenization with Dictionary ID Replacement