LeetCode Experience · Oct 2019

Facebook | Phone Screen | Valid Palindrome 2 & Vertical Order traversal of Binary Tree

SWE Phone Screen Easy
8 upvotes 1,872 views 5 replies

Interview Experience

Question 1: Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome. I solved this question in 17 mins. They...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Hash Table Graph Strings Binary Tree Queue