Avalara Technologies Interview Questions and Answers for Freshers

It was a 30 mins aptitude test, consisting mathematical, logical and few basic programming questions

We were asked to write 3 different basic programs on paper

Q1. Interviewer asked basic and cire java interview questions
Add your answer

Q1. The manager asked few general questions on my resume
Add your answer

Regular MCQ based questions on java, maths, dsa.

Solving problems in java in front of the interviewer.

Q1. Manager take this round
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Q1. 
Minimum Number of Taps to Water the Garden
Given a garden that extends along a one-dimensional x-axis from point 0 to point N, your task is to determine the minimum number of taps needed to water the enti...read more
Ans. 
Find the minimum number of taps needed to water the entire garden using given tap ranges.
• Iterate over each tap and find the maximum range it can cover.

• Sort the taps based on their starting position and ending position.

• Use a greedy approach to select the taps that cover the maximum range possible.

• If any part of the garden remains uncovered, return -1.
Answered by AI
Add your answer
Q2. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal problem on an undirected and disconnected graph to find connected components.
• Perform Depth First Search (DFS) on the graph to find connected components.

• Use a visited array to keep track of visited vertices.

• Iterate through all vertices and perform DFS on unvisited vertices to find connected components.

• Print the number of connected components and list vertices in each component in ascending order.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Return Subsets Sum to K Problem Statement
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
Explanation:
A subset of an array 'ARR' is a tupl...read more
Ans. 
Return all subsets of an array that sum to a given integer K.
• Use recursion to generate all possible subsets of the array.

• Keep track of the current subset and its sum while traversing the array.

• If the sum of the subset equals K, add it to the result.

• Sort the elements in each subset to ensure increasing order of index.

• Handle duplicate elements in the array appropriately.
Answered by AI
Add your answer
Q2. 
Palindrome Partitioning Problem Statement
You are given a string S. Your task is to partition S such that every substring of the partition is a palindrome. Your objective is to return all possible palindr...read more
Ans. 
Partition a string into palindromes and return all possible configurations.
• Use backtracking to generate all possible palindrome partitions of the string.

• Check if each substring is a palindrome before adding it to the partition.

• Return all valid partitions as an array of strings.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

Mainly this round consisted of project discussion and 1 coding problem.

Q1. 
Queue Using Stacks Implementation
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Explanation:
Your task is to complete predefined functions t...read more
Ans. 
Implement a queue using stacks following FIFO principle.
• Use two stacks to simulate a queue - one for enqueueing and one for dequeueing.

• For enqueuing, simply push elements onto the stack.

• For dequeuing, if the dequeue stack is empty, transfer all elements from enqueue stack to dequeue stack.

• Peek operation can be done by checking the top element of the dequeue stack.

• Check if the queue is empty by verifying if both stacks ...read more
Answered by AI
Add your answer