tata digital logo
Tata Digital· Lead Engineer

Tata Digital | Lead Engineer | Bengaluru

Location
Bengaluru
Posted
7 Feb 2026
272 reads

Summary

I interviewed at Tata Digital for a Lead Engineer role in Bengaluru. I cleared the HackerRank test which included problems on priority queues and segment trees, but I was rejected after a second round which featured a problem on finding the Largest BST in a binary tree.

How it went

I interviewed at Tata digital last summer.

Hackerrank test:

Q1. A question on priority queue. Question was a story and not easy to figure out the usage of Heap

Q2. Question on segment trees, although it was another story and had to deduce the segment trees application

Cleared the test.

Round 2:

Largest BST in a binary tree

Verdict: Rejected

Questions asked (1)

  1. 01

    Largest BST in Binary Tree

    Data Structures & Algorithms

    I was asked to find the largest Binary Search Tree (BST) within a given binary tree.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Tata Digital recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!