Wunderman Thompson Commerce Technical Associate Interview Questions and Answers

Round duration - 50 Minutes
Round difficulty - Medium

there were two coding question in first round.

Q1. 
Doctor Ninja's House Problem Statement
In a network of 'N' cities with 'M' paths connecting them, Doctor Ninja aims to purchase a house in a city 'X' such that it is possible to reach every other city fro...read more
Ans. 
The task is to find a city 'X' from which all other cities can be reached in a given graph.
• Find the mother vertices in the graph.

• If there are multiple mother vertices, return the minimum value.

• If there are no mother vertices, return -1.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

1 coding question of scrambled string.

Q1. 
Scramble String Problem Statement
You are given an integer 'N' and two strings S and R, each having the size N. Determine if you can scramble string S to obtain string R using specified operations.
Your ...read more
Ans. 
The question asks to determine if string 'R' can be obtained by scrambling string 'S' using certain operations.
• The length of both strings 'S' and 'R' should be the same.

• The operations can be applied recursively on the substrings of 'S'.

• If the length of 'S' is 1, the scrambling process stops.

• The strings only contain lowercase letters.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

oops and some sql queries

Round duration - 20 Minutes
Round difficulty - Easy

HR round