Teradata SSE - Rejected

teradata logo
teradata
· Senior software engineer
February 6, 2026 · 7 reads

Summary

I interviewed for a Senior Software Engineer role at Teradata, undergoing two technical rounds. Despite feeling positive about my performance, I received a rejection and am unsure what went wrong.

Full Experience

Recruiter reached out to me from Naukari and scheduled 2 rounds on same day for Senior software engineer. There will be 3 rounds in total, 2 Tech, 1 Managerial. It took a week of time overall.

Round 1: Programming round

Quick introduction and then DSA

1. There will be binary string containing # at multiple places and need to replace # by 0 and 1 and find all such possible strings.
I told my appraoches and she asked me to do code with queue approach, I coded it completely with dry run.

2. LinkedList find cycle, remove cycle and cycle length

3. Reverse Doubly Linked List

Self verdict- strong positive

Round 2 : DSA round

He started asking me Tree questions basic ones and then asked me to implement insert, delete, undo and redo operations from scratch along with how can we maintain the original structure
I implemented all the functions and told my approaches. He seems satisfied.

Self verdict- positive as I took little time initially

After both rounds got rejection mail. Did not understand what went wrong.

Saw similar other posts.

Interview Questions (4)

1.

Generate All Binary Strings with Wildcards

Data Structures & Algorithms·Medium

Given a binary string containing '#' at multiple places, replace each '#' with either '0' or '1' to find all such possible unique strings.

2.

Linked List Cycle Detection and Removal

Data Structures & Algorithms·Medium

Given a singly linked list, detect if it has a cycle. If a cycle is present, find its length and remove it.

3.

Reverse Doubly Linked List

Data Structures & Algorithms·Easy

Reverse a given doubly linked list.

4.

Tree Operations with Undo/Redo Functionality

Data Structures & Algorithms·Hard

Implement insert, delete operations for a tree data structure, and additionally, implement undo and redo functionalities, ensuring the original tree structure can be maintained through these operations.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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