TCL Software Developer Interview Questions and Answers for Experienced

Q1. Why to join WD?
Ans. 
WD offers exciting opportunities for growth and innovation in the software engineering field.
• Opportunity to work on cutting-edge technologies

• Collaborative and supportive work environment

• Career development and growth opportunities

• Strong company culture and values

• Global presence and diverse projects
Answered by AI
Add your answer
Q2. Detect loop in linked list
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect loop in linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a loop in the linked list.
Answered by AI
Add your answer
Q3. What are different product of WD?
Ans. 
WD offers a variety of products including external hard drives, internal hard drives, SSDs, and network attached storage devices.
• External hard drives

• Internal hard drives

• SSDs

• Network attached storage devices
Answered by AI
Add your answer
Q4. Do you want to ask any questions?
Add your answer

There was a coding round on techgig which i cleared

Q1. I was invited to the technical round which was also online
Add your answer
Q2. I could not attend the online technical round
Add your answer
Q3. 2 questions on dsa
Add your answer

It was open coding contest called Ode 2 Code organised on hackerearth. Top 100 students got interview calls

Q1. This was a 1:1 online technical interview.
Add your answer
Q2. Basic question on web development, regarding projects in resume. 1 problem solving question and DSA basics
Add your answer
Q3. I was asked to explain merge sort
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half, and then merges the sorted halves.
• Divide the array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

The questions were quite straight forward skill based and the this round also included aptitude questions as well.
The key was to manage time

Round duration - 30 minutes
Round difficulty - Easy

Questions from your CV and also some coding questions like Program to find GCD first for two numbers and then enhance the code for better complexity

Q1. 
Greatest Common Divisor Problem Statement
You are tasked with finding the greatest common divisor (GCD) of two given numbers 'X' and 'Y'. The GCD is defined as the largest integer that divides both of the...read more
Ans. 
Find the greatest common divisor (GCD) of two given numbers 'X' and 'Y'.
• Implement a function to calculate the GCD of two numbers using Euclidean algorithm

• Iteratively find the remainder of dividing the larger number by the smaller number until the remainder is 0

• The last non-zero remainder is the GCD of the two numbers
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a Managerial Round where he asked some problem solving questions as well as get to know you (kinda HR)
and also some questions like agile and all

Q1. Framework of your company
Add your answer
Q2. Final, Finally, finalize
Add your answer