Quick Overview

This two-problem prompt evaluates proficiency in tree algorithms and recursion for computing longest paths in binary trees, along with string processing and palindromic substring enumeration that involve pattern recognition and algorithmic optimization.

Solve Tree Diameter and Palindromic Counts

Company: Meta

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: This two-problem prompt evaluates proficiency in tree algorithms and recursion for computing longest paths in binary trees, along with string processing and palindromic substring enumeration that involve pattern recognition and algorithmic optimization.

Loading…