T

Teradata

Developer

Interview Date

Not Specified (Recently visited campus)

Result

Not Specified (Implied progression through rounds)

Difficulty

Medium to Hard (for written test)

Rounds

3 rounds

Drive Type

On-Campus, Full-Time

Topics asked

Data StructuresOperating SystemsComputer OrganisationRecursionAlgorithmsSystem DesignFunction PointersProjectsBehavioral Questions

Detailed experience

Role: Developer

College: Not Specified (On-Campus)

Interview Date: Not Specified (Recently visited campus)

Interview Type: On-Campus, Full-Time

Result: Not Specified (Implied progression through rounds)

Difficulty: Medium to Hard (for written test)

Rounds: 3 rounds

Topics Asked: Data Structures, Operating Systems, Computer Organisation, Recursion, Algorithms, System Design, Function Pointers, Projects, Behavioral Questions

Experience:

Teradata recently visited the candidate's campus for developer and test developer profiles, and the candidate was shortlisted for the developer profile.

Round 1: Written Test
This round consisted of 20 MCQs with a time limit of 40 minutes. Questions covered Data Structures, Operating Systems, Computer Organisation, and Recursion. The difficulty level was described as medium to hard, requiring strong conceptual clarity. Only 4 candidates were shortlisted for the second round.

Round 2: Technical Round (2 hours)
This round was comprehensive and included several coding and design problems.

  • Coding Question 1: Given two sorted strings of length m+n and n, merge them into a single sorted string of length m+n in place.
  • Coding Question 2: Run length encoding, with a focus on handling the worst case where each character is repeated only once.
  • Coding Question 3: Mirror of a binary tree.
  • Design Question 1: Design a stack data structure that allows push(key), pop(), and max() operations in O(1) time, with efficient space usage.
  • Coding Question 4: Search in a row and column sorted matrix.
  • Coding Question 5: Root to leaf path equal to a given sum.
  • Coding Question 6: Given an array, find if an element can be represented as a subset sum of the array.
  • Technical Question: Declaration of some complex function pointers.

Round 3: HR + Technical Round (1 hour)
This round combined technical and behavioral aspects.

  • Coding Question: Write code that returns true if a matrix is a subset of another matrix.
  • Behavioral Questions:
    • Introduce yourself.
    • How did you overcome some serious problem of yours?
    • Why did you work as an intern for a company that paid you nothing?
    • What is so unique about you?
    • What is your plan after 2 years from now?
    • Would you want to work for 24 hours a day for the company?
    • What do you do in your free time?
    • Why should I hire you?
    • What if you don't get to learn new things from the company?
    • What do you expect from the company?
    • Discussion on projects and articles contributed to GeeksforGeeks.
Posted on - 13 Nov 2025
Teradata Interview Experience - Developer | OAHelper