Determine feasibility and clean parentheses string
Company: Meta
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Quick Answer: This pair of problems evaluates proficiency with graph algorithms (dependency modeling and cycle detection/topological ordering) and string processing (parentheses balancing and minimal-edit transformations), focusing on algorithmic thinking, data-structure usage, and efficient linear-time solutions.