Tata Digital | Lead Engineer | Bengaluru
February 7, 2026 · 6 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.
Full Experience
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
Interview Questions (1)
1.
Largest BST in Binary Tree
Data Structures & Algorithms
I was asked to find the largest Binary Search Tree (BST) within a given binary tree.