Cracking Meta's Software Engineer Interview: Longest Palindromic Subsequence Challenge

Software Engineering
, ,
1

meta | Software Engineer | Interview Experience

Interview Date: Not specified
Result: Not specified
Difficulty: Not specified

Interview Process

The interview lasted 45 minutes and consisted of two questions.

Technical Questions

  1. Find the average of all nodes in a binary search tree, noting that the nodes are zero. (Tree)
  2. Longest palindrome subsequence, LC516. (Dynamic Programming)

Tips & Insights

Focus on understanding the underlying concepts of data structures and algorithms, as this will help in tackling similar questions in the future.