Prepare for and practice interview questions from Jabil.

Jabil Interview Questions

Jabil Interview Guides

Data Structures & Algorithms

Find the missing integer from a array of consequtive integers

Find the Missing Number

Given a list of integers, find the index at which the sum of the left half of the list is equal to the right half.

Equivalent Index

Given an integer N, write a function that returns all of the prime numbers up to N

Prime to N

One Element Removed

Stop Words Filter

Machine Learning

Missing Housing Data

Why would one algorithm generate different success rates with the same dataset?

Same Algorithm Different Success

Bagging vs Boosting

Food Delivery Times

Decision Tree Evaluation

Paired Products

Write a query to get the number of customers that were upsold

Upsell Transactions

Create a report displaying which shipments were delivered to customers during their membership period.

Completed Shipments

Daily Active Users

List out the exams sources of each student in MySQL

Exam Scores

Statistics

Reducing Error Margin

What are the assumptions of linear regression?

Assumptions of Linear Regression

Using R Squared

Covariance vs Correlation

Correlation in Regression

Analytics

We're interested in how user activity affects user purchasing behavior. 

Activity Conversion

Create and write queries for health metrics for stack overflow 

Community Health Metrics

How would you determine customer service quality through a chat box?

Measuring Customer Service Quality

Challenges of specific student test score layouts, recommended formatting changes for enhanced analysis, and common issues found in "messy" datasets.

Digitizing Student Test Scores

Describing a real-world data cleaning and organization project

Data Cleaning Experiences

We’re given a table of product purchases. Each row in the table represents an individual user product purchase.

Write a query to get the number of customers that were upsold, or in other words, the number of users who bought additional products after their first purchase.

Note: If the customer purchased two things on the same day, that does not count as an upsell, as they were purchased within a similar timeframe.

Example:

Input:

<code>transactions</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>user_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>created_at</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>product_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>quantity</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>num_of_upsold_customers</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>

Let’s say we have a table with an <code>id</code> and <code>name</code> fields. The table holds over 100 million rows and we want to sample a random row in the table without throttling the database.

Write a query to randomly sample a row from this table.

Input:

<code>big_table</code> table

<table>
<thead>
<tr>
<th>Columns</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>name</code></td>
<td>VARCHAR</td>
</tr>
</tbody>
</table>

Write a query to randomly sample a row from a big table.

Random SQL Sample

Let’s say we have two tables, <code>transactions</code> and <code>products</code>. Hypothetically the <code>transactions</code> table consists of over a billion rows of purchases bought by users.

We are trying to find paired products that are often purchased together by the same user, such as wine and bottle openers, chips and beer, etc..

Write a query to find the top five paired products and their names.

Notes:
 For the purposes of satisfying the test case, p2 should be the item that comes first in the alphabet.
 The <code>qty</code> column represents paired products count

Example:

Input:

<code>transactions</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>user_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>created_at</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>product_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>quantity</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<code>products</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>name</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>price</code></td>
<td>FLOAT</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>p1</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>p2</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>qty</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>

You have an array of integers, <code>nums</code> of length <code>n</code> spanning <code>0</code> to <code>n</code> with one missing. Write a function <code>missing_number</code> that returns the missing number in the array.

Note: Complexity of \(O(n)\) required.

Example:

Input:

<pre tabindex="0" class="chroma"><code>nums = [0,1,2,4,5] 
missing_number(nums) -&gt; 3
</code></pre>

Given an integer <code>N</code>, write a function that returns a list of all of the prime numbers up to <code>N</code>.

Note: Return an empty list there are no prime numbers less than or equal to <code>N</code>.

Example:

Input:

<pre tabindex="0" class="chroma"><code>N = 3
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def prime_numbers(N) -&gt; [2,3]
</code></pre>

As an accountant for a local grocery store, you have been tasked with calculating the daily sales of each product since their last restocking.

You have been provided with three tables: <code>products</code>, <code>sales</code>, and <code>restocking</code>. The <code>products</code> table contains information about each product, the <code>sales</code> table records the sales transactions, and the <code>restocking</code> table tracks the restocking events.

Write a query to retrieve the running total of sales for each product since its last restocking event.

Notes: The <code>sales_since_last_restock</code> column represents the cumulative sales of the product for each day since its last restocking event. Order the result set by <code>product_id</code>.

Example:

Input:

Table <code>products</code>:

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td>product_id</td>
<td>int</td>
</tr>

<tr>
<td>product_name</td>
<td>varchar</td>
</tr>
</tbody>
</table>
Table <code>sales</code>:

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td>sales_id</td>
<td>int</td>
</tr>

<tr>
<td>product_id</td>
<td>int</td>
</tr>

<tr>
<td>date</td>
<td>date</td>
</tr>

<tr>
<td>sold_count</td>
<td>int</td>
</tr>
</tbody>
</table>
Table <code>restocking</code>:

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td>restock_id</td>
<td>int</td>
</tr>

<tr>
<td>product_id</td>
<td>int</td>
</tr>

<tr>
<td>restock_date</td>
<td>date</td>
</tr>
</tbody>
</table>
Output

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td>product_name</td>
<td>varchar</td>
</tr>

<tr>
<td>date</td>
<td>date</td>
</tr>

<tr>
<td>sales_since_last_restock</td>
<td>int</td>
</tr>
</tbody>
</table>

Calculate daily sales of each product since last restocking.

Cumulative Sales Since Last Restocking

Let’s say that you’re a data scientist working on a distribution team at Amazon.

Create a report displaying which shipments were delivered to customers during their membership period.

If the transaction is shipped during the membership period, column <code>is_member</code> should have the value <code>Y</code>. If not, the column should have the value <code>N</code>.

Hint: You may assume that <code>customer_id</code> is unique and that shipments are made only to registered customers.

Example:

Input:

<code>customers</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>customer_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>membership_start_date</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>membership_end_date</code></td>
<td>DATETIME</td>
</tr>
</tbody>
</table>
<code>shipments</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>shipment_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>ship_date</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>customer_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>quantity</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>shipment_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>ship_date</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>customer_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>is_member</code></td>
<td>TEXT</td>
</tr>

<tr>
<td><code>quantity</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>

To finish a class, students must pass four exams (exam ids: 1,2,3 and 4).

Given a table <code>exam_scores</code> containing the data about all of the exams that students took, form a new table to track the scores for each student.

Note: Students took each exam only once.

Example:

For the given input:

<table>
<thead>
<tr>
<th><code>student_id</code></th>
<th><code>student_name</code></th>
<th><code>exam_id</code></th>
<th><code>score</code></th>
</tr>
</thead>

<tbody>
<tr>
<td>100</td>
<td><code>Anna</code></td>
<td>1</td>
<td>71</td>
</tr>

<tr>
<td>100</td>
<td><code>Anna</code></td>
<td>2</td>
<td>72</td>
</tr>

<tr>
<td>100</td>
<td><code>Anna</code></td>
<td>3</td>
<td>73</td>
</tr>

<tr>
<td>100</td>
<td><code>Anna</code></td>
<td>4</td>
<td>74</td>
</tr>

<tr>
<td>101</td>
<td><code>Brian</code></td>
<td>1</td>
<td>65</td>
</tr>
</tbody>
</table>
the expected output should be:

<table>
<thead>
<tr>
<th><code>student_name</code></th>
<th><code>exam_1</code></th>
<th><code>exam_2</code></th>
<th><code>exam_3</code></th>
<th><code>exam_4</code></th>
</tr>
</thead>

<tbody>
<tr>
<td><code>Anna</code></td>
<td>71</td>
<td>72</td>
<td>73</td>
<td>74</td>
</tr>

<tr>
<td><code>Brian</code></td>
<td>65</td>
<td>NULL</td>
<td>NULL</td>
<td>NULL</td>
</tr>
</tbody>
</table>
Input:

<code>exam_scores</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>student_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>student_name</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>exam_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>score</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>student_name</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>exam_1</code></td>
<td>INT</td>
</tr>

<tr>
<td><code>exam_2</code></td>
<td>INT</td>
</tr>

<tr>
<td><code>exam_3</code></td>
<td>INT</td>
</tr>

<tr>
<td><code>exam_4</code></td>
<td>INT</td>
</tr>
</tbody>
</table>

Given a list of integers, find the index at which the sum of the left half of the list is equal to the right half.

If there is no index where this condition is satisfied return -1.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>nums = [1, 7, 3, 5, 6]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>equivalent_index(nums) -&gt; 2
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>nums = [1,3,5]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>equivalent_index(nums) -&gt; -1
</code></pre>

A digital health startup is analyzing ECG sensor data captured from wearable heart monitors. Each row in the dataset represents one heartbeat, including its timestamp and calculated heart rate at that moment.

The clinical team wants to detect tachycardia runs, periods where a patient’s heart rate stays above 100 bpm continuously for at least 10 seconds .

Write a SQL query to identify every valid tachycardia run and return:

<ol>
<li><code>patient_id</code></li>
<li><code>run_start</code>: timestamp of the first beat in the run</li>
<li><code>run_end</code>: timestamp of the last beat in the run</li>
<li><code>duration_seconds</code>: difference in seconds between start and end (rounded to 2 decimals)</li>
</ol>

Sort results by <code>patient_id</code>, then <code>run_start</code>.

Definition of a Tachycardia Run

<ul>
<li>All consecutive heartbeats must have <code>heart_rate &gt; 100</code></li>
<li>Total duration ≥ 10 seconds</li>
<li>Any gap ≥ 3 seconds between consecutive beats breaks the run</li>
</ul>

Note: A patient may have multiple separate runs.

Schema

Input

<code>ecg_readings</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td>patient_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>timestamp</td>
<td>DATETIME</td>
</tr>

<tr>
<td>heart_rate</td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
Output

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td>patient_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>run_start</td>
<td>DATETIME</td>
</tr>

<tr>
<td>run_end</td>
<td>DATETIME</td>
</tr>

<tr>
<td>duration_seconds</td>
<td>DECIMAL</td>
</tr>
</tbody>
</table>
Example

Input

<code>ecg_readings</code> table

<table>
<thead>
<tr>
<th>patient_id</th>
<th>timestamp</th>
<th>heart_rate</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>2025-03-01 10:00:00</td>
<td>98</td>
</tr>

<tr>
<td>1</td>
<td>2025-03-01 10:00:02</td>
<td>105</td>
</tr>

<tr>
<td>1</td>
<td>2025-03-01 10:00:04</td>
<td>110</td>
</tr>

<tr>
<td>1</td>
<td>2025-03-01 10:00:07</td>
<td>108</td>
</tr>

<tr>
<td>1</td>
<td>2025-03-01 10:00:12</td>
<td>107</td>
</tr>

<tr>
<td>1</td>
<td>2025-03-01 10:00:15</td>
<td>85</td>
</tr>

<tr>
<td>1</td>
<td>2025-03-01 10:00:20</td>
<td>120</td>
</tr>

<tr>
<td>1</td>
<td>2025-03-01 10:00:28</td>
<td>122</td>
</tr>
</tbody>
</table>
Output

<table>
<thead>
<tr>
<th>patient_id</th>
<th>run_start</th>
<th>run_end</th>
<th>duration_seconds</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>2025-03-01 10:00:02</td>
<td>2025-03-01 10:00:12</td>
<td>10.00</td>
</tr>
</tbody>
</table>

<h3>Explanation</h3>

The high-rate streak from 10:00:02 to 10:00:12 forms one continuous sequence because each gap between timestamps (2 to 4, 4 to 7, and 7 to 12) is less than three seconds. This creates a valid 10-second run. The later high values at seconds 20 and 28 are separated by an eight-second gap, so they form a different sequence that is shorter than 10 seconds and is therefore ignored.

Write a SQL query to identify every valid tachycardia run.

Detecting ECG Tachycardia Runs

You’re given a string that may contain the characters <code>{</code>, <code>}</code>, <code>[</code>, <code>]</code>, <code>(</code>, and <code>)</code>.

Task: Verify that the string is balanced. A balanced string is one where every opening character, <code>{</code>, <code>[</code>, or <code>(</code>, has a corresponding closing character, <code>}</code>, <code>]</code>, or <code>)</code>.

Write a function called <code>is_balanced(string: str) -&gt; bool</code> which verifies the balance of a string.

Example:

<pre tabindex="0" class="chroma"><code>is_balanced(&#39;(())[]{}&#39;) -&gt; True
</code></pre>

<pre tabindex="0" class="chroma"><code>is_balanced(&#39;{([(){}])()}&#39;) -&gt; True
</code></pre>

<pre tabindex="0" class="chroma"><code>is_balanced(&#39;{}[]())&#39;) -&gt; False
</code></pre>

<hr/>

Write a function that tests whether a string of brackets is balanced.

The Brackets Problem

Say you are tasked with designing a data mart or data warehouse for a new online retailer.

How would you design the system?

Note: Sketch a star schema to explain your design.

Design a data warehouse for a new online retailer

Retailer Data Warehouse

Data Modeling

Why would the same machine learning algorithm generate different success rates using the same dataset?

Note: When they ask us an ambiguous question, we need to gather context and restate it in a way that’s clear for us to answer.

You’re a data scientist at YouTube. Leadership wants to revisit how the platform measures success, not for a specific new feature, but for the product as a whole given its current state.

How would you define and measure success for YouTube? Identify your primary and secondary metrics, explain your rationale for each, and discuss how you would choose the right thresholds for any engagement-based metrics you propose.

The role of A/B testing in measuring the success rate of an analytics experiment

Success Measurement

Product Sense & Metrics

You are given a binary tree of unique positive numbers. Each node in the binary tree is represented as a dictionary with the following keys:

<ul>
<li><code>data</code>: integer value stored in the node</li>
<li><code>left</code>: reference to the left child (or <code>None</code>)</li>
<li><code>right</code>: reference to the right child (or <code>None</code>)</li>
</ul>

<pre tabindex="0" class="chroma"><code>node = {
 &#34;data&#34;: 6,
 &#34;left&#34;: {
 &#34;data&#34;: 3,
 &#34;left&#34;: {...},
 &#34;right&#34;: {...}
 },
 &#34;right&#34;: {
 &#34;data&#34;: 9,
 &#34;left&#34;: {...},
 &#34;right&#34;: {...}
 }
}
</code></pre>

Given two node values as input (<code>value1</code> and <code>value2</code>), write a function to return the value of the nearest common ancestor (lowest node in the tree that has both nodes as descendants).

Note: If one of the nodes doesn’t exist in the tree, return <code>-1</code>.

Example:

Input:

<pre tabindex="0" class="chroma"><code># Diagram of the binary tree
&#39;&#39;&#39;
 6 
 / \ 
 3 9 
 / \
 2 11
 / \
 5 8
&#39;&#39;&#39;
value1 = 8
value2 = 2
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>common_ancestor(root,value1,value2) -&gt; 3
</code></pre>

Explanation:

<ul>
<li>Ancestors of <code>8</code>: <code>11 → 3 → 6</code></li>
<li>Ancestors of <code>2</code>: <code>3 → 6</code></li>
<li>Common ancestors: <code>3</code> and <code>6</code></li>
<li>The nearest common ancestor is <code>3</code>.</li>
</ul>

Write a function to return the value of the nearest node that is a parent to both nodes.

Nearest Common Ancestor

Three zebras are chilling in the desert. Suddenly a lion attacks.
Each zebra is sitting on a corner of a triangle with sides of equal length.
Each zebra randomly picks a direction and only runs along the outline of the triangle to either edge of the triangle.

What is the probability that none of the zebras collide?

Three zebras are chilling in the desert. Suddenly a lion attacks.

Each zebra is sitting on a corner of a triangle with side of equal length. Each zebra randomly picks a direction and only runs along the outline of the triangle to either edge of the triangle.

What is the probability that none of the zebras collide?

Three zebras are chilling in the desert. Suddenly a lion attacks.

Each zebra is sitting on a corner of a triangle with side of equal length.  Each zebra randomly picks a direction and only runs along the outline of the triangle to either edge of the triangle.

What is the probability that none of the zebras collide?



Three Zebras

Brainteasers

What are the assumptions of linear regression?

Which assumption of the residuals of the standard linear regression model can not be overcome by increasing the sample size?

Regression assumptions

Given the head of a singly linked list represented as a <code>ListNode</code>, and two zero-indexed positions <code>x</code> and <code>y</code>, write a function <code>swap_node</code> which swaps the positions of nodes <code>x</code> and <code>y</code> and returns the new head. Note that you cannot simply swap the values of these nodes, as these nodes do not have values. Instead, you must swap these two using pointer manipulation (i.e., modifying the <code>next</code> references of the involved nodes inside the list).

A <code>ListNode</code> is defined as:

<pre tabindex="0" class="chroma"><code>class ListNode:
 next: ListNode = None
</code></pre>

Example:

Input:

<pre tabindex="0" class="chroma"><code>linked_list = ListNode(0x01) -&gt; ListNode(0x02) -&gt; ListNode(0x03) 
# Here, imagine that &#39;0x0_&#39; refer to their memory locations.
head = 0x01
x = 1
y = 2
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def swap_node(head, x, y) -&gt; ListNode(0x01) -&gt; ListNode(0x03) -&gt; ListNode(0x02)
</code></pre>

Swapping Nodes

You are given two non-empty linked lists representing two non-negative integers. Each list contains a single number, where each item in the list is one digit. The digits are stored in reverse order.

Task: Add the two numbers and return the sum as a linked list, also with the digits in reverse order. You may assume the two numbers do not contain any leading zeros, except the number 0 itself.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>l1 = 2-&gt;4-&gt;3-&gt;null
l2 = 5-&gt;6-&gt;4-&gt;null
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>addTwoNumbers(l1, l2) = 7-&gt;0-&gt;8-&gt;null
</code></pre>

Explanation: 342 + 465 = 807.

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>l1 = 0-&gt;null
l2 = 0-&gt;null
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>addTwoNumbers(l1, l2) -&gt; 0-&gt;null
</code></pre>

Explanation: 0 + 0 = 0.

In this problem, we are given two linked lists representing two non-negative integers, with each item in the list holding one digit. The digits are stored in reverse order, and each of their nodes contains a single digit. We are required to add the two numbers and return the sum as a linked list.

Radix Addition

Given two strings, write a function to return <code>True</code> if the strings are anagrams of each other and <code>False</code> if they are not.

Note: A word is not an anagram of itself.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>string_1 = &#34;listen&#34;
string_2 = &#34;silent&#34;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>True
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>string_1 = &#34;banana&#34;
string_2 = &#34;bandana&#34;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>False
</code></pre>

Valid Anagram

Write a Python function called <code>group_anagrams</code> that takes a list of strings as input and returns a list of lists, where each inner list contains a group of anagrams that were present in the input list.

An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, using all the original letters exactly once.

Note: Each of the inner lists should be ordered alphabetically and contain no duplicate values

<h3>Example:</h3>

Input:

<pre tabindex="0" class="chroma"><code>words = [&#34;eat&#34;, &#34;tea&#34;, &#34;tan&#34;, &#34;ate&#34;, &#34;nat&#34;, &#34;bat&#34;]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>[ 
 [&#34;nat&#34;,&#34;tan&#34;],
 [&#34;ate&#34;,&#34;eat&#34;, &#34;tea&#34;],
 [&#34;bat&#34;]
]
</code></pre>

Explanation:

In the example, the words “eat”, “tea”, and “ate” are anagrams of each other, as are the words “tan” and “nat”. The word “bat” does not have any anagrams in the input list, and therefore is listed on its own. The function then groups the anagrams together and returns a list of lists representing these groups.

Each of the lists representing a group of anagrams is sorted in alphabetical order.

Identify the groups of anagrams in a list of words

Groups of Anagrams

You work as a data engineer in X (formerly Twitter), in a team responsible for building the platform’s trending chart for monitoring global social media trends. The system ingests a high-volume stream of tweets, and your team needs to partition incoming tweets into buckets based on hashtags as they arrive.

How would you architect the data pipeline and select data structures to efficiently partition and store tweets by hashtag in real time?

System design for real-time tweet partitioning by hashtag at Apple.

Real-Time Hashtag Partitioning

Concurrent & Distributed Systems

Given a 2-D matrix P of predicted values and actual values, write a function precision_recall to calculate precision and recall metrics.

Return the ordered pair (precision, recall).

Example:

Input:

<pre tabindex="0" class="chroma"><code>
P = [[121, 9],
 [17, 144]]
</code></pre>

where P represents the following table

<table>
<thead>
<tr>
<th></th>
<th>Predicted =TRUE</th>
<th>Predicted =FALSE</th>
</tr>
</thead>

<tbody>
<tr>
<td>Actual =TRUE</td>
<td>121</td>
<td>9</td>
</tr>

<tr>
<td>Actual =FALSE</td>
<td>17</td>
<td>144</td>
</tr>
</tbody>
</table>
Output:

<pre tabindex="0" class="chroma"><code>def precision_recall(P) -&gt; (0.931, 0.877,)
</code></pre>

Write a function to calculate precision and recall metrics.

Precision and Recall

How would you handle the data preparation for building a machine learning model using imbalanced data?

Addressing imbalanced data in machine learning through carefully prepared techniques.

Data Preparation for Imbalanced Data

An electronics retail company tracks its sales and wants to run a performance analysis. They’re hoping to categorize sales into different groups, based on the amount of sales and the region where the sale occurred. The conditions for categorization are:

<ul>
<li>Standard Sales: Any sales below 2000 are considered standard, except if they occur in the <code>East</code> region, or in the month of July.</li>
<li>Premium Sales: Any sales that are over or equal to 2000, or any sales in the <code>East</code> region (regardless of the amount), are considered premium, except again during the month of July.</li>
<li>Promotional Sales: All sales made in the promotional period of July, regardless of the amount or region, are considered promotional.</li>
</ul>

The company wants a report that sums these amounts by region to help with financial planning and bonus allocations.

Note: You may assume that table contains data only for 2023

Example:

Input:

<code>sales</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>sale_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>employee_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>product_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>sale_amount</code></td>
<td>FLOAT</td>
</tr>

<tr>
<td><code>sale_date</code></td>
<td>DATE</td>
</tr>

<tr>
<td><code>region</code></td>
<td>TEXT</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>region</code></td>
<td>TEXT</td>
</tr>

<tr>
<td><code>total_sales</code></td>
<td>FLOAT</td>
</tr>

<tr>
<td><code>premium_sales</code></td>
<td>FLOAT</td>
</tr>

<tr>
<td><code>standard_sales</code></td>
<td>FLOAT</td>
</tr>

<tr>
<td><code>promotional_sales</code></td>
<td>FLOAT</td>
</tr>
</tbody>
</table>

Categorize sales based on the amount of sales and the region

Categorize Sales

Given a table of user logs with platform information, count the number of daily active users on each platform for the year of 2020.

Example:

Input:

<code>events</code> table

<table>
<thead>
<tr>
<th>Column</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>user_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>created_at</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>action</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>url</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>platform</code></td>
<td>VARCHAR</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>Columns</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<tr>
<td><code>platform</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>created_at</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>daily_users</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>

Write a function, <code>search_list</code>, that returns a boolean indicating if the <code>target</code> value is in the <code>linked_list</code> or not.

You receive the head of the linked list, which is a dictionary with the following keys:
- <code>value</code>: contains the value of the node.
- <code>next</code>: contains the next node in the list, or <code>None</code>.

If the linked list is empty, you’ll receive <code>None</code> since there is no head node for an empty list.

Example:

Input:

<pre tabindex="0" class="chroma"><code>target = 2
linked_list = 3 -&gt; 2 -&gt; 5 -&gt; 6 -&gt; 8 -&gt; None
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>search_list(target, linked_list) -&gt; True
</code></pre>

Write a function that returns a boolean indicating if a value is in the linked list.

Search Linked List

Given a <code>ListNode</code> representing the head of a linked list, write a function <code>is_cyclic</code> which returns <code>True</code> if a linked list is cyclic and <code>False</code> if it is not. A linked list is cyclic when there is no tail to the linked list, and the supposed tail is attached to another node inside the list itself, creating a cycle.

A <code>ListNode</code> is defined as:

<pre tabindex="0" class="chroma"><code>class ListNode:
	value: ListNode = None
 next: ListNode = None
</code></pre>

Example:

Input:

<img src="/s3/questions/1a65651d-a483-4481-b073-2738d65ab9d7.png" alt="image"/>

Output:

<pre tabindex="0" class="chroma"><code>def is_cyclic(head) -&gt; True
</code></pre>

Cyclic Detection

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

You are given a target value to search. If the value is in the array, then return its index; otherwise, return -1. 

Notes:

<ul>
<li>Rotating an array at pivot \(n\) gives you a new array that begins with the elements after position \(n\) and ends with the elements up to position \(n\).</li>
<li>You may assume no duplicate exists in the array.</li>
</ul>

Bonus: Your algorithm’s runtime complexity should be in the order of \(O(\log n)\).

Example:

Input: 

<pre tabindex="0" class="chroma"><code>sample_input = [0,1,2,4,5,6,7] 
rotated_input = [4,5,6,7,0,1,2]
target_value = 6
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def target_value_search(rotated_input, target_value) -&gt; 2
</code></pre>

Search for a value in log(n) over a sorted array that has been shifted.

Target Value Search

Given an array filled with random values, write a function <code>rotate_matrix</code> to rotate the array by 90 degrees in the clockwise direction.

Example:

Input:

<pre tabindex="0" class="chroma"><code>import numpy as np

array = np.array( [[1, 2, 3, 4, 5], [2, 3, 4, 5, 6], [3, 4, 5, 6, 7], [4, 5, 6, 7, 8], [5, 6, 7, 8, 9]] )

</code></pre>

array
<table><tbody><tr><td>1</td><td>2</td><td>3</td><td>4</td><td>5</td></tr><tr><td>2</td><td>3</td><td>4</td><td>5</td><td>6</td></tr><tr><td>3</td><td>4</td><td>5</td><td>6</td><td>7</td></tr><tr><td>4</td><td>5</td><td>6</td><td>7</td><td>8</td></tr><tr><td>5</td><td>6</td><td>7</td><td>8</td><td>9</td></tr></tbody></table>

Output:

<table><tbody><tr><td>5</td><td>4</td><td>3</td><td>2</td><td>1</td></tr><tr><td>6</td><td>5</td><td>4</td><td>3</td><td>2</td></tr><tr><td>7</td><td>6</td><td>5</td><td>4</td><td>3</td></tr><tr><td>8</td><td>7</td><td>6</td><td>5</td><td>4</td></tr><tr><td>9</td><td>8</td><td>7</td><td>6</td><td>5</td></tr></tbody></table>

Write a function to rotate an array by 90 degrees in the clockwise direction.

Calculate Moving Average	SQL	Easy
Predict Customer Churn	Machine Learning	Medium
A/B Test Significance	Statistics	Medium
Optimize Query Performance	SQL	Hard
Feature Importance Analysis	Machine Learning	Medium
Clean Missing Data	Python	Easy
Neural Network Architecture	Deep Learning	Hard
Calculate Cohort Retention	SQL	Medium
Bayesian Probability	Statistics	Easy
Recommend Similar Products	Machine Learning	Hard

Jabil Interview Questions

Jabil Interview Guides

Jabil Interview Questions

Challenge

Discussion & Interview Experiences

Discussion & Interview Experiences