Databricks Online Assessment Lessons Learned and Preparation Guide

Databricks Compared with other large companies, the difficulty of the OA is medium to high, not only with regular programming questions, but also with SQL, data processing and distributed computing test points, after all, the company's positioning is big data + AI platform. The OA that I helped the students to do this time is about 90 minutes, including two programming questions + one SQL data processing. The questions are similar to Leetcode high-frequency questions, but with a little bit of Databricks' own flavor.

Databricks OA Overview of interviews

Databricks Online Assessment | Interview Questions Sharing

Problem 1: Binary String Operations

You are given a string binaryString consisting of '0's and '1's, and an array of strings requests containing two types of requests.

• "count:": Find the number of '0's in binaryString up to and including the specified 0-based index.
• "flip": Flip all elements of binaryString, i.e., change every '0' to '1' and every '1' to '0 '.

Return an array answers, where answers[i] contains the answer for the respective count request.

Example

For binaryString = "111010" And requests = ["count:4", "count:6", "flip", "count:4", "flip", "count:2"], the expected output is [1, 2, 4, 0].

Problem 2: Swappable Numbers

You are given an array of integers Numbers. Your task is to count the number of distinct pairs (i,j) Such that 0 <= i < j < numbers.length And numbers[i] can be obtained from Numbers[j] by swapping no more than two digits of Numbers[j]. Note that if numbers[i] = numbers[j], the pair should also be counted.

Examples

• For numbers = [1, 23, 156, 1650, 651, 165, 32], the output should be 3.
• For numbers = [123, 321, 123], the output should be 3.

Input/Output

• Input.array.integer numbers (An array of positive integers)
  • Guaranteed constraints.
    • 1 <= numbers.length <= 10^4
    • 1 <= numbers[i] <= 10^9
• Output. integer (The count of pairs from Numbers meeting the criteria)

Problem 3: Maximum Items by Budget

You are given an array of integers costs and a budget total. The costs array contains the costs of n Your task is to find the maximum number of items you can buy with your budget, and to find the maximum number of items you can buy with your budget, and to find the maximum number of items you can buy with your budget. total.

Example

For costs = [1, 3, 2, 4, 1] And total = 7, the output should be 4. You can buy items with costs 1, 1, 2, 3, which sum up to 7, which is the maximum number of items possible.

Input/Output

• Input. array.integer costs, integer total
• Guaranteed constraints.
  • 1 <= costs.length <= 10^5
  • 1 <= costs[i] <= 10^5
  • 1 <= total <= 10^9
• Output. integer (The maximum number of items that can be bought)

Don't just hang in there by yourself. An assist will get you twice the result with half the effort.

Many students will have similar feelings when rushing Databricks or OA of North American big factories: the amount of questions is large, the time is pressed tightly, and it is easy to panic in the field, and the result is that you can't play out. In fact, there is no need to fight alone. Programhelp We have been providing OA ghostwriting, VO remote real-time prompts, and even interviews instead of the whole process, ensuring a smooth process through a hidden and stable way. Whether it's written test support to ensure that all test points are passed, or instant reminders in interviews, or even accompanying you all the way until the offer falls into your pocket, we have mature experience and successful cases. If you are preparing for Databricks or FAANG, it is much more efficient to use the right method earlier than to brush questions blindly.

jor jor

See Full Bio