Longest Arithmetic Sequence Tree Path - Google Top Interview Questions

Problem Statement :

You are given a binary tree root. Return the length of the longest path starting from a node that goes top to bottom where its values form an arithmetic sequence.

An arithmetic sequence is a sequence of numbers where the difference between each consecutive two numbers is the same. For example, [2, 4, 6, 8] is an arithmetic sequence as is [1, 4, 7, 10]. A sequence of length two or fewer is considered an arithmetic sequence.


0 ≤ n ≤ 100,000 where n is the number of nodes in root

Example 1


root = [1, [4, [7, [0, null, null], null], null], null]



Solution :


                        Solution in C++ :

int maxS = 0;
void dfs(Tree* root, int diff, int l) {
    maxS = max(maxS, l);
    if (!root) {
    if (root->left) {
        if (root->left->val - root->val == diff) {
            dfs(root->left, diff, l + 1);
        } else {
            dfs(root->left, root->left->val - root->val, 2);
    if (root->right) {
        if (root->right->val - root->val == diff) {
            dfs(root->right, diff, l + 1);
        } else {
            dfs(root->right, root->right->val - root->val, 2);
int solve(Tree* root) {
    if (root) {
        maxS = 1;
    } else {
        return 0;
    dfs(root, 0, 1);
    return maxS;

                        Solution in Java :

import java.util.*;

 * public class Tree {
 *   int val;
 *   Tree left;
 *   Tree right;
 * }

class Solution {
    int ans;

    public int solve(Tree root) {
        if (root == null) {
            return 0;

        ans = 1;
        return ans;

    HashMap<Integer, Integer> sol(Tree root) {
        if (root == null) {
            return new HashMap<>();

        HashMap<Integer, Integer> l = sol(root.left);
        HashMap<Integer, Integer> r = sol(root.right);

        HashMap<Integer, Integer> mp = new HashMap<>();

        if (root.left != null) {
            int ldiff = root.val - root.left.val;
            int x = l.getOrDefault(ldiff, 1);
            int y = mp.getOrDefault(ldiff, 1);
            mp.put(ldiff, Math.max(x + 1, y));
            ans = Math.max(ans, mp.get(ldiff));

        if (root.right != null) {
            int rdiff = root.val - root.right.val;
            int x = r.getOrDefault(rdiff, 1);
            int y = mp.getOrDefault(rdiff, 1);
            mp.put(rdiff, Math.max(x + 1, y));
            ans = Math.max(ans, mp.get(rdiff));

        return mp;

                        Solution in Python : 
class Solution:
    # global ans to use same solve function for recursion 😅
    ans = 0
    # diff is diffrence of cur value with prev to check airth seq
    # ltill is longest airth seq ending before cur node
    def solve(self, cur, ltill=0, diff=None):
        # Intialize a global ans ans is max of prev longest airthmetic seq and cur longest
        self.ans = max(self.ans, ltill)
        # Check if ther is left child
        if cur.left:
            # compute diff with left child
            ldiff = cur.left.val - cur.val
                # if diff with previous child is diffrent
                # from diff of cur from par
                # or it's root new airthmetic sequence
                # start from here so ltill is 1
                # else extend prev max length ltill by 1
                1 if diff == None or ldiff != diff else ltill + 1,
        # same for right
        if cur.right:
            rdiff = cur.right.val - cur.val
            self.solve(cur.right, 1 if diff == None or rdiff != diff else ltill + 1, rdiff)

        # we start count from 0 so +1 solve single legth seq also
        return self.ans + 1

View More Similar Problems

Balanced Brackets

A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of bra

View Solution →

Equal Stacks

ou have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times. Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of

View Solution →

Game of Two Stacks

Alexa has two stacks of non-negative integers, stack A = [a0, a1, . . . , an-1 ] and stack B = [b0, b1, . . . , b m-1] where index 0 denotes the top of the stack. Alexa challenges Nick to play the following game: In each move, Nick can remove one integer from the top of either stack A or stack B. Nick keeps a running sum of the integers he removes from the two stacks. Nick is disqualified f

View Solution →

Largest Rectangle

Skyline Real Estate Developers is planning to demolish a number of old, unoccupied buildings and construct a shopping mall in their place. Your task is to find the largest solid area in which the mall can be constructed. There are a number of buildings in a certain two-dimensional landscape. Each building has a height, given by . If you join adjacent buildings, they will form a solid rectangle

View Solution →

Simple Text Editor

In this challenge, you must implement a simple text editor. Initially, your editor contains an empty string, S. You must perform Q operations of the following 4 types: 1. append(W) - Append W string to the end of S. 2 . delete( k ) - Delete the last k characters of S. 3 .print( k ) - Print the kth character of S. 4 . undo( ) - Undo the last (not previously undone) operation of type 1 or 2,

View Solution →

Poisonous Plants

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plan

View Solution →