Databricks Interview Questions, Process, and Tips

Q1. Total of 5-7 rounds with case study, assignment, coding, techinal and 1-1 with higher levels
Add your answer

4 questions in 1 hour 30 minutes

Q1. Subset sum - in leetcode
Ans. 
Subset sum problem is a classic algorithmic problem in computer science.
• The problem asks to find if there is a subset of the given array that sums up to a given target value.

• It can be solved using dynamic programming or backtracking.

• The time complexity of the dynamic programming solution is O(n*target), where n is the size of the array.

• The problem can be further optimized using memoization or by using a boolean array t
Answered by AI
Add your answer