Transunion

Role: Internship and Performance-based PPO / FTE

College: Not Specified

Interview Date: 2023-07-18

Interview Type: On-Campus (Internship and FTE opportunity)

Result: Rejected

Difficulty: Easy Medium (Coding)

Rounds: 2 Steps (Online Coding Round, Interview Round)

Topics Asked: Data Structures (Hashmaps), Algorithms (Arrays, Strings, Sorting algorithms - describe/choose, Searching algorithms - describe/choose), Dynamic Programming (Traveling Salesman Problem), Behavioral (Fit for role, passion, weaknesses).

Experience:

This experience details an interview process for an Internship and performance-based PPO opportunity, which later also presented an FTE (Full Time Employment) opportunity.

Step 1: Resumes Shortlisted
Candidates submitted resumes via Google Forms, and these were then shortlisted.

Step 2: Online Coding Round
This round consisted of two easy to medium-level questions, primarily on the topics of arrays and strings.

Interview Round (Technical + Behavioral)
This round involved a mix of technical and behavioral questions.

• Describe all sorting algorithms you know.
• Which sorting algorithm would you use in any given situation?
• What are hashmaps? Implement a hash map in C from scratch.
• What are different searching algorithms?
• Which searching algorithm would you use if you are given strings instead of integers and you do not know if they are sorted?
• A coding problem related to the Traveling Salesman Problem was given to solve via screen share.
• Discussion on Heap Sort and different ideas for sorting like Merge Sort and Quick Sort implementation.
• Behavioral questions: "Why do you think you are fit for this role, what's your passion?" and "What are your weaknesses and how are you striving to overcome them?"

The candidate mentioned failing this interview, despite being among the top 5 from college, as only 2 were selected.