TCL Cloud Engineer 1 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

2 ad-hoc coding questions :

1st was related to the incremental sorting of an array.
2nd was related to adding logic to a function snippet.

Q1. Personals and educational background
Add your answer
Q2. Logic of binary tree, heap, doubly link list
Ans. 
Binary tree is a tree data structure where each node has at most two children, heap is a specialized tree-based data structure, doubly linked list is a linked list where each node points to both the next and previous nodes.
• Binary tree: each node has at most two children, left child and right child. Example: binary search tree.

• Heap: a complete binary tree where the value of each node is greater than or equal to the valu...read more
Answered by AI
Add your answer
Q3. Questions around final year project
Add your answer

Q1. Personals and cultural fit round
Add your answer