Avalara Technologies Engineering Intern Interview Questions and Answers

Q1. They will ask basic sql questions and it was very basic
Add your answer

Q1. Design a efficiënte db read
Ans. 
Efficient database read design
• Use indexing to quickly locate data

• Minimize the number of reads by fetching only necessary columns

• Consider denormalizing data for faster reads

• Implement caching mechanisms to reduce database load

• Optimize queries by avoiding unnecessary joins
Answered by AI
Add your answer
Q2. Exception handling
Add your answer
Q3. Customruntime exception
Add your answer
Q4. Design abstract factory
Add your answer
Q5. Design a system to read the data efficiently without iterating on record repeatedly
Ans. 
Use indexing to access data directly without iterating
• Implement a database with proper indexing on key fields

• Utilize data structures like hash tables or binary search trees for quick access

• Consider using caching mechanisms to store frequently accessed data

• Optimize queries by using efficient algorithms like merge sort or quicksort
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Round 1  was a coding round of 60 min which started around 5:30PM in which 2 problem statements were given. The questions were based on Array and linked list. The platform used for test was coding which was user friendly and which use to display number of test cases passed and some test cases were hidden.

Q1. 
Problem: Deletion in Circular Linked List
You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.
Your task is to implement a function that locates the spec...read more
Ans. Recursion
The idea is to use a recursive approach to find the given key and then remove that node. The recursive idea is very clear that we will traverse through the circular linked list, and we will check if the value of the node is equal to the given key. 
 
We will define a function deleteNodeHelper(root, key, head) to remove the key in which the head is the starting node of the linked list, and we will send ...read more
Answered Anonymously
Add your answer
Q2. 
Rearrange Array: Move Negative Numbers to the Beginning
Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...read more
Ans. Using Sorting
Approach: A brute force approach could be to just sort the given array in ascending order. This will result in all negative numbers to appear at the beginning and positive number at the end.
Space Complexity: O(1)Explanation:
O(1)
 
Because no extra space is required.
Time Complexity: O(nlogn)Explanation:
O(N*logN), where N is the number of elements in the array.
 
In the worst case, sorting requires O...read more
Answered Anonymously
Add your answer

Round duration - 30-35 minutes
Round difficulty - Medium

This round was of technical interview and they asked me various concepts