Avalara Technologies Interview Questions, Process, and Tips

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
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
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
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
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
Add your answer

EU VAT related based case study

Q1. Related to EU Vat
Add your answer

Q1. Ops round How u spend ur yestrdy Ur last memorable day Can u plz explain smthing about ur memorable day 3advantage or 3disadvantages of online shopping How will u handle angry cstmr Wht is call cntre Hr ro...read more
Add your answer

Q1. Hr round m Introduce ur self About ur family About ur hobbies Ur last memorable day Wht do u mean by bpo
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Merge K Sorted Arrays Problem Statement
Given 'K' different arrays that are individually sorted in ascending order, merge all these arrays into a single array that is also sorted in ascending order.
Inpu...read more
Ans. Sorting
 
1. Create an output array ‘RESULT’.
2. Traverse all the given arrays from start to end and insert all the elements in the output array ‘RESULT’.
3. Sort the ‘RESULT’ and return it.
Space Complexity: O(2^n)Explanation:
O(N * K), Where ‘K’ is the number of arrays and ‘N’ is the average number of elements in every array.
 
We are using an array/list of size O(N * K) to store all the elements of the ‘K’ arrays/lists. T...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. What is the low-level design for storing contacts in a phone book?
Ans. 
used trie data structure to save contact data.
Answered Anonymously
Add your answer