Avalara Technologies Interview Questions, Process, and Tips 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 Garden
The gardener wants to water the garden by opening the minimum number of taps. The garden is one-dimensional along the x-axis of length N i.e. the garden starts from p...read more
Ans. 
I started with N*N solution. Then optimised it to O(N). Using the idea similar to Jump Game 2.
Answered by CodingNinjas
Add your answer
Q2. DFS Traversal
Given an undirected and disconnected graph G(V, E), containing 'V' vertices and 'E' edges, the information about edges is given using 'GRAPH' matrix, where i-th edge i...read more
Ans. DFS For Each Connected Component
• Run a loop from 0 to V-1 and if this vertex is not visited do a DFS from this vertex and add all the reachable vertex to a vector/list ‘singleComponent’.
• Sort the singleComponent vector/list in increasing order and add it to the answer vector/list which is called ‘components’.
• Print the size of the vector/list ‘components’ on the first line.
• On each line after the first, print one sing...read more
Answered by CodingNinjas
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. Return Subsets Sum to K
Given an integer array 'ARR' of size 'N' and an integer 'K', return all the subsets of 'ARR' which sum to 'K'.
Subset of an array 'ARR&...read more
Ans. Brute Force
Recursively generate all the subsets and keep track of the sum of the elements in the current subset.
Subsets can be generated in the following way. For every element of the array, there are 2 options: 
1. Include the element in the current subset : If we include the element in the current subset, then we decrease the value of ‘K’ by  the value of the element.
2. Do not include the element in the current su...read more
Answered by CodingNinjas
Add your answer
Q2. Palindrome Partitioning
You are given a string 'S'. Your task is to partition 'S' such that every substring of the partition is a palindrome. You need to return all possible palindrome part...read more
Ans. 
Gave him N^2 DP approach, interviewer was happy with it.
Answered by CodingNinjas
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

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

Q1. Queue Using Stack
Implement a queue data structure which follows FIFO(First In First Out) property, using only the instances of the stack data structure.
Note:
1. To implement means you need to complete ...read more
Ans. 
Used 2 stacks to implement queue.
Answered by CodingNinjas
Add your answer