Arthrex Interview Questions and Answers

Round duration - 180 Minutes
Round difficulty - Medium

Round was held in the morning at 10 am.

Q1. 
M - Coloring Problem Statement
Given an undirected graph with 'N' nodes in the form of an adjacency matrix and an integer 'M', determine if it is possible to color the vertices of the graph using at most ...read more
Ans. 
The problem involves determining if a given graph can be colored with at most 'M' colors without adjacent vertices sharing the same color.
• Create a function that takes the adjacency matrix, number of nodes 'N', and maximum number of colors 'M' as input.

• Implement a graph coloring algorithm such as backtracking or greedy coloring to check if the graph can be colored with at most 'M' colors.

• Check if adjacent vertices have ...read more
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

The round was held in the evening

Q1. 
Trie Data Structure Implementation
Design and implement a Trie (prefix tree) to perform the following operations:
• insert(word): Add a string "word" to the Trie.
• search(word): Verify if the string "w...read more
Ans. 
Implement a Trie data structure to insert, search, and check for prefixes in strings.
• Create a TrieNode class with children and isEndOfWord attributes.

• Implement insert, search, and startsWith methods in the Trie class.

• Use a Trie to efficiently store and search for strings based on prefixes.

• Example: insert 'apple', search 'apple' returns true, startsWith 'app' returns true, search 'app' returns false.
Answered by AI
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

Was held in the morning around 9 am

Round duration - 120 Minutes
Round difficulty - Medium

The round had 2 coding problems to solve with varying difficulty. Each candidate had a different set of questions. The round was around 2 pm. The webcam was turned on to keep an eye on candidates.

Q1. 
Bursting Balloons Problem
Given an array ARR of size N, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits...read more
Add your answer
Q2. 
Count Leaf Nodes in a Binary Tree
Count the number of leaf nodes present in a given binary tree. A binary tree is a data structure where each node has at most two children, known as the left child and the...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions related to DSA. I was first asked to explain my approach with proper complexity analysis and then code the soution in any IDE that I prefer.

Q1. 
Rod Cutting Problem Statement
Given a rod of a certain length, the rod can be divided into different sizes, each with an associated cost. Your task is to determine the maximum cost that can be obtained by...read more
Ans. 
The Rod Cutting Problem involves maximizing the profit obtained by cutting a rod into smaller pieces and selling them.
• Use dynamic programming to solve this problem efficiently.

• Create a table to store the maximum profit for each sub-length of the rod.

• Iterate through the rod lengths and update the table with the maximum profit.

• The final answer will be the maximum profit for the total length of the rod.
Answered by AI
Add your answer
Q2. 
Count Subarrays with Given XOR Problem Statement
You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.
Example...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

Q1. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Add your answer
Q2. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Add your answer
Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their
approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

Q1. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...read more
Add your answer
Q2. 
Quick Sort Problem Statement
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...read more
Add your answer
Q3. What are friend functions in C++?
Ans. 
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
• Friend functions are declared inside a class with the keyword 'friend'.

• They can access private and protected members of the class.

• They are not member functions of the class, but have the same access rights as member functions.

• Friend functions are useful for implementing operators that are not part ...read more
Answered by AI
Add your answer
Q4. What is the difference between Early Binding and Late Binding in C++?
Ans. 
Early binding is resolved at compile time while late binding is resolved at runtime in C++.
• Early binding is also known as static binding, where the function call is resolved at compile time based on the type of the object.

• Late binding is also known as dynamic binding, where the function call is resolved at runtime based on the actual type of the object.

• Early binding is faster as the function call is directly linked to ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was coding round and was conducted on Cocubes platform. It is not IDE but kind of white board coding platform. C/C++, Java and Python were only allowed languages.

Round duration - 30 minutes
Round difficulty - Easy

This was pen and paper round. Total 40 shortlisted candidates were grouped into 8 groups (each of 5). Each group was given a coding question which they have to solve on paper and explain it to the recruiter. 2 to 3 from each group were selected for the next round.

Round duration - 60 minutes
Round difficulty - Easy

This was general face to face Data Structures and Algorithms based round.

Q1. How do you perform a spiral order traversal of a binary tree? Please provide an explanation or code to print the binary tree in spiral order.
Ans. 
Spiral order traversal of a binary tree involves printing nodes level by level alternating between left to right and right to left.
• Start by pushing the root node into a queue.

• While the queue is not empty, pop a node, print its value, and push its children into the queue.

• For each level, alternate between printing nodes from left to right and right to left.

• Repeat until all nodes are printed in spiral order.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was the last round.

Q1. Typing test 30words per minute. 90% accuracy.
Add your answer

Q1. Personal information, Previous company work, Salary discussion.
Add your answer

General knowledge, Maths questions.