InterviewDB
Question
Glean SWE Phone - Minimum Deletions to Balance Parentheses
phone
Question Details
Problem Find the minimum number of parenthesis deletions to make a string valid using a stack or greedy counter. Likely LeetCode equivalent LeetCode 1249 - Minimum Remove to Make Valid Parentheses. Tags stack, strings, greedy
Full Details
🔒
Unlock all Glean questions
Full insider details, leaked discussions, and candidate experiences.
Get full access — $100 a year, unlimited accessAbout This Question
This is a reported interview question from a glean interview during the phone round.
It covers the following topics: Strings, Phone, Greedy, Coding, Onsite, Stack .
More Glean Interview Questions
1p3a
fulltime machine learning onsite interview experience at glean sf office
1p3a
glean software engineer tech phone screen interview experience
InterviewDB
Glean SWE Phone - Array Compression
1p3a
Glean Backend Engineer Interview Experience and Rejection Discussion
1p3a
Glean Tech Phone Screen Problem: Document Processing and Node Allocation