ThoughtWorks Software Engineer Interview Questions, Process, and Tips

Round duration - 180 Minutes
Round difficulty - Easy

it was an coding round. i was not able to solve questions

Q1. Anagram Pairs
Pre-requisites: Anagrams are defined as words or names that can be formed by rearranging letters of another word. Such as "spar" can be formed by rearranging letters of "rasp&q...read more
Ans. Count Characters
Anagrams have a unique property: the counts of each distinct character present in both strings are the same. One way to check this is: 
1. Sort both strings, so that all the same characters come together
2. Then loop through both strings together and check each element in both strings one by one
3. If at any position, the characters are found to be different or if the lengths of the two strings are different, ...read more
Answered by CodingNinjas
View 1 more answer
Q2. Remove character
For a given string(str) and a character X, write a function to remove all the occurrences of X from the given string and return it.
The input string will remain unchanged if the given ch...read more
Ans. Iterative Solution
• We create an empty string that will store our final result. We will return it at the end.
• We iterate from 0 to the length of the string. Say, our loop variable is i. We can then access the ith character as input[i]
• If the ith character equals the character c i.e input[i] == c, then we skip this character and do nothing.
• Else we need to append the character to the output string.
• We finally return the outpu...read more
Answered by CodingNinjas
Add your answer
Q3. Complete String
Ninja developed a love for arrays and strings so this time his teacher gave him an array of strings, ‘A’ of size ‘N’. Each element of this array is a string. The teacher taught Ninja about ...read more
Ans. Brute Force
 
Approach : 
 
• We first find all the prefixes of each string in array ‘A’.
• For each string ‘S’, we check if all the prefixes are part of the array ‘A’.
• To check this, we mark the strings of array ‘A’ in a map.
• If there are no such strings, we return “”.
• We select the largest length string that has all prefixes in ‘A’.
• We sort all the strings that satisfy the above criteria and return the lexicographi...read more
Answered by CodingNinjas
View 1 more answer
Q4. Segregate Odd-Even
There is a wedding ceremony at NinjaLand. The bride and groom want everybody to play a game and thus, they have blindfolded the attendees. The people from the bride’s side are holding od...read more
Ans. Iterative Approach 1
As we have to arrange the nodes such that all the odd nodes should come before all the even nodes, we can move all the even valued nodes from their current positions to the end of the linked list. 
 
Algorithm:
 
• Initialise a pointer ‘LAST_NODE’ by NULL.
• Traverse the linked list to the end and get the last node of the list which will be pointed by ‘LAST_NODE’.
• Initialize a pointer ‘NEW_END’...read more
Answered by CodingNinjas
View 1 more answer
Q5. Boundary Sum
Given a Binary Tree of 'N' nodes, find and print the sum of all the boundary nodes. Boundary nodes consist of a root node, leftmost external nodes, rightmost external nodes and all the...read more
Ans. Recursive Approach
1. For calculating the boundary sum, we need to calculate 3 things :
   • Sum of leftmost nodes
   • Sum of rightmost nodes
   • Sum of leaf nodes
2. For calculating the sum of leaf nodes we traverse recursively through all the nodes of the binary tree. If we find a node whose left and right child is ‘NULL’ simultaneously then we add that node to the sum.
3. For calculating the sum of the leftmost nodes we start traversing in the...read more
Answered by CodingNinjas
Add your answer

Quantitative ability and logical ability

Q1. In which programming language you are good at?
Ans. 
I am proficient in Java and Python.
• Strong understanding of object-oriented programming concepts

• Experience with Java frameworks such as Spring and Hibernate

• Proficient in Python libraries such as NumPy and Pandas
Answered by AI
Add your answer
Q2. Write a program to print HCF of numbers as output
Ans. 
Program to print HCF of numbers as output
• Take input of two numbers from user

• Find the smaller number between the two

• Run a loop from 1 to the smaller number

• Check if both numbers are divisible by the current loop variable

• If yes, update the HCF variable

• Print the HCF as output
Answered by AI
Add your answer

Q1. Why should we hire you?
Add your answer