Question Details
Problem Determine whether a string can become a palindrome by removing at most one character. Likely LeetCode equivalent Directly matches Valid Palindrome II (LC 680). Tags strings, two_pointers, whatnot
Full Details
🔒
Unlock all Whatnot 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 whatnot interview during the phone round.
It covers the following topics: Coding, Onsite, Phone, Strings .
More Whatnot Interview Questions
1p3a
whatnot fulltime software engineer tech phone screen interview overview
InterviewDB
Whatnot SWE Phone - First Bad Version
1p3a
fulltime software engineer tech phone screen interview experience at whatnot
InterviewDB
Whatnot SWE Phone - Group Anagram
InterviewDB
Whatnot SWE Phone - K Closest Points