Rajesh Trading Tableau Developer Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Easy

It was a hangout video call. The interviewer asked me these questions. Tell me about yourself and 1 coding question.

Q1. 
Special Numbers Problem Statement
Your task is to find the total count of special numbers within a range from 1 to a given integer, 'MAXVAL'. A special number is defined as a number whose digits, when rot...read more
Ans. 
Count the total number of special numbers within a given range by rotating digits 180 degrees.
• Create a function to check if a number is a special number by rotating its digits.

• Iterate through the range from 1 to MAXVAL and count the special numbers.

• Handle the digit rotation mapping for 0, 1, 6, 8, 9.

• Return the count of special numbers for each test case.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This was an On-site (Behavioural Round) interview. He asked me these questions.

Round duration - 60 Minutes
Round difficulty - Easy

This was another On-site ( DS & Algo) algorithm.

Q1. 
Covid Vaccination Distribution Problem
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...read more
Ans. 
Given constraints, find max vaccines administered on a specific day during a vaccination drive.
• Iterate through each test case and calculate the maximum number of vaccines distributed on the specified day.

• Distribute vaccines evenly across days while maximizing the number on the specified day.

• Ensure that the sum of vaccines administered does not exceed the maximum allowed.

• Consider edge cases like when the number of days ...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Another On-site ( DS & Algo) interview.

Q1. 
Painter's Partition Problem Statement
Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, determine the minimum time required...read more
Ans. 
Determine the minimum time required to paint all boards with given constraints.
• Use binary search to find the minimum and maximum possible time to paint all boards.

• Iterate through the boards and assign them to painters based on the time constraints.

• Calculate the total time taken to paint all boards with the assigned painters.
Answered by AI
View 1 more answer
Q2. 
Chocolate Distribution Problem
You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...read more
Ans. 
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
• Sort the array of chocolates.

• Use sliding window technique to find the minimum difference between the largest and smallest number of chocolates.

• Return the minimum difference as the output.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Another On-site ( DS & Algo) interview.

Q1. 
Problem Statement: Minimize the Maximum
You are given an array of integers and an integer K. For each array element, you can adjust it by increasing or decreasing it by a value of K. Your goal is to minim...read more
Ans. 
Given an array of integers and an integer K, minimize the difference between the maximum and minimum elements after adjusting each element by +/- K.
• Sort the array in non-decreasing order.

• For each element, calculate the difference between the current element and the next element.

• Adjust the element by adding or subtracting K to minimize the difference.

• Return the minimum possible difference between the maximum and minimum
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

On-site ( DS & Algo) interview.
Google mainly focuses on logic and how you are coming with a solution. It notes down each and every small mistake. Interviewers are really very helpful. They expect clear code with an optimal approach.

Q1. 
Farthest Distance From Lands Problem Statement
Given a binary square matrix 'ARR' with 'N' rows and 'N' columns, where '0' represents water and '1' represents land.
Determine the water cell whose distanc...read more
Ans. 
Find the water cell farthest from land in a binary matrix using Manhattan distance.
• Iterate through the matrix to find all land cells and water cells

• Calculate the Manhattan distance of each water cell to the nearest land cell

• Return the maximum distance found
Answered by AI
Add your answer