TartanHQ Solutions Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

It is from 12 to 1:30 pm. Environment was very friendly and interviewer was very nice.

Q1. 
Nth Term of Geometric Progression Problem
Given the first term A, the common ratio R, and an integer N, your task is to find the Nth term of a geometric progression (GP) series.
Explanation:
The general...read more
Ans. 
Calculate the Nth term of a geometric progression series modulo 10^9 + 7.
• Use the formula A * R^(N-1) to find the Nth term of the GP series.

• Remember to calculate the result modulo 10^9 + 7.

• Handle multiple test cases efficiently to stay within the time limit.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Very friendly environment 

Round duration - 40 minutes
Round difficulty - Medium

Q1. 
Subarray Sums I Problem Statement
You are provided with an array of positive integers ARR that represents the strengths of different “jutsus” (ninja techniques). You are also given the strength of the ene...read more
Ans. 
Count the number of subarrays whose combined strength matches the given enemy strength.
• Iterate through the array and maintain a running sum to check for subarrays with sum equal to the enemy strength.

• Use a hashmap to store the running sum frequencies and increment the count of subarrays accordingly.

• Return the count of subarrays that sum up to the given enemy strength.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the night around 7:00PM-7:15PM. Platform used for this round was skype. Interviewer was very friendly in nature. This round focusses more on your personality rather than knowledge.

Round duration - 30 minutes
Round difficulty - Medium

It was conducted in morning around 8:00AM-8:40AM. Platform used for this round was hackerrank. Questions were of moderate level. Total number of mcq are 20.

Q1. 
Count Good Subsets Problem Statement
Given an array ARR of size N consisting of distinct elements, your task is to determine the total number of good subsets. A subset is considered a good subset if the e...read more
Ans. 
Count the total number of good subsets in an array where elements can be rearranged to divide the next element.
• Iterate through all possible subsets of the array.

• Check if each subset is a good subset by rearranging elements to divide the next element.

• Count the number of good subsets and return the total count.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was conducted in afternoon around 2:00PM-2:30PM. Platform used for this round was google meet. Interviewer was looking very serious in questioning.