ThoughtWorks Software Developer Interview Questions, Process, and Tips

Such a nice experience

Such a nice experience

Q1. Covered LinkedLists and Trees
Add your answer

Q1. Cultural Assessment Round
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Mcq + Data structures questions

Q1. 
Maximum Sum Subarray Problem Statement
Given an array of integers, find the maximum sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
Exp...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array in O(N) time complexity.
• Use Kadane's algorithm to find the maximum sum subarray in O(N) time complexity

• Initialize two variables: max_sum and current_sum to keep track of the maximum sum subarray

• Iterate through the array and update current_sum by adding the current element or starting a new subarray

• Update max_sum if current_sum is greater than max_sum

• Return...read more
Answered by AI
View 1 more answer

Round duration - 70 minutes
Round difficulty - Medium

Standard System Design round

Q1. Design a Doctor Appointment System and provide some test cases.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Interview of DSA + OOPS + Databse(SQL query) + Operating System

Q1. 
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...read more
Ans. 
The task is to print the left view of a binary tree, which contains the nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner and keep track of the leftmost node at each level.

• Use a queue to perform level order traversal.

• Print the leftmost node at each level to get the left view of the binary tree.
Answered by AI
Add your answer
Q2. What is the difference between CHAR and VARCHAR2 data types in SQL?
Ans. 
CHAR is fixed length while VARCHAR2 is variable length in SQL.
• CHAR stores fixed length strings, padding with spaces if necessary.

• VARCHAR2 stores variable length strings, not padding with spaces.

• CHAR is faster for fixed length data, VARCHAR2 is more flexible for varying length data.
Answered by AI
View 1 more answer
Q3. What are the various types of constructors in C++?
Ans. 
There are three types of constructors in C++: default constructor, parameterized constructor, and copy constructor.
• Default constructor: Constructor with no parameters.

• Parameterized constructor: Constructor with parameters.

• Copy constructor: Constructor that initializes an object using another object of the same class.

• Example: // Default constructor ClassName() {} // Parameterized constructor ClassName(int x, int y) :...read more
Answered by AI
Add your answer
Q4. What is the difference between overloading and overriding?
Ans. 
Overloading is having multiple methods in the same class with the same name but different parameters, while overriding is implementing a method in a subclass that is already defined in the superclass.
• Overloading involves multiple methods with the same name but different parameters.

• Overriding involves implementing a method in a subclass that is already defined in the superclass.

• Overloading is resolved at compile time ba...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Hr round - normal hr questions + situational 

Thoughtworks community discussion

Q1. Why should we hire you?
Add your answer

DSA

About Social changes

Q1. Tell me about yourself.
Add your answer
Q2. Very basic questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

We were supposed to give test in any time between 3 PM to 9 PM.

Q1. 
Total Unique Paths Problem Statement
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...read more
Ans. 
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
• Use dynamic programming to solve the problem efficiently.

• Create a 2D array to store the number of unique paths at each cell.

• Initialize the first row and first column with 1 as there is only one way to reach them.

• For each cell (i, j), the number of unique paths is the sum of paths...read more
Answered by AI
Add your answer
Q2. 
Subtree Node Count Problem
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...read more
Ans. 
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
• Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.

• Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.

• The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM

Focus Areas: Problem solving and implementation of extensions.

The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
 

Q1. 
River Crossing: Help Ninja Cross Over
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...read more
Ans. 
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
• Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.

• Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.

• Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Answered by AI
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.

Q1. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Ans. 
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• Return the element pointed to by the slow pointer
Answered by AI
Add your answer