TCL Software Engineer Interview Questions and Answers

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

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

Q1. String reversal , Data structures
Add your answer

Q1. Interview with Architect , mostly technical and logical reasoning.
Add your answer

Q1. Situation based question like how to handle a situation when you are overloaded. personal info and what made you apply for this role.
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

Apti quest normal maths english

Medium leetchode question