InterviewDB
Question
Toast SWE Phone - Palindrome with Restriction (Strings)
phone
Question Details
Problem Determine if a string can be made a palindrome under some additional constraints (e.g., at most k deletions). Likely LeetCode equivalent Similar to LC 680 Valid Palindrome II. Tags strings, toast, palindrome
Full Details
🔒
Unlock all Toast 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 toast interview during the phone round.
It covers the following topics: Coding, Onsite, Phone, Strings .
More Toast Interview Questions
1p3a
Toast Senior Software Engineer 6 YOE Onsite Interview Rejection 2025
1p3a
Toast SDE-2 Technical Interview Round 1 Maximum Profit Bread Problem
LeetCode
#121 Best Time to Buy and Sell Stock
InterviewDB
Menu Price Resolution: Resolve Final Item Prices After Applying Cascading Discounts
InterviewDB
Toast SWE Phone - String Search (Strings/Sliding Window)