Prepare for and practice interview questions from Unison.

Unison Interview Questions

unison controls private limited is a machinery company based out of 16 dhanlakshmi industrielestetnr police comm office shahibaug rd, ahmedabad, gujarat, india.

unison controls private limited is a machinery company based out of 16 dhanlakshmi industrielestetnr police comm office shahibaug rd, ahmedabad, gujarat, india.

Overview

Unison Interview Guides

Data Structures & Algorithms

Given two sorted lists, write a function to merge them into one sorted list.

Merge Sorted Lists

Find the missing integer from a array of consequtive integers

Find the Missing Number

Get Top N Frequent Words

String Shift

Minimum Change

Machine Learning

Bank Fraud Model

Rebalancing outcome probabilities for a classifier on imbalanced data.

Rebalance Probabilities

Lasso vs Ridge

Bagging vs Boosting

FAQ Matching

Select the 2nd highest salary in the engineering department

2nd Highest Salary

Write a query that returns all neighborhoods that have 0 users.

Empty Neighborhoods

Paired Products

Write a query to get the average commute time for each commuter in New York

Average Commute Time

Find the total salary of slacking employees.

Slacking Employees Salaries

Probability

Profit-Maximizing Dice Game

HHT or HTT

Approximate Ad Views

Poker Pair

The probability of a stick broken into three pieces forming a triangle as determined by geometric analysis

Stick Break

Statistics

Write a function to return the cumulative percentage of students that received scores within certain buckets.

Bucket Test Scores

P-value to a Layman

What are the assumptions of linear regression?

Assumptions of Linear Regression

Interquartile Distance

Use of historical loan data to estimate the probability of default for new loans

MLE for Default Prediction

Challenge

We’re given two tables, a <code>users</code> table with demographic information and the neighborhood they live in and a <code>neighborhoods</code> table.

Write a query that returns all neighborhoods that have 0 users. 

Example:

Input:

<code>users</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>

<tr>
<td><code>neighborhood_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>created_at</code></td>
<td>DATETIME</td>
</tr>
</tbody>
</table>
<code>neighborhoods</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>

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

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

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

Given two sorted lists, write a function to merge them into one sorted list.

Bonus: What’s the time complexity?

Example:

Input:

<pre tabindex="0" class="chroma"><code>list1 = [1,2,5]
list2 = [2,4,6]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def merge_list(list1,list2) -&gt; [1,2,2,4,5,6]
</code></pre>

You have two sorted lists, one with m elements and one with n elements. What would be the time complexity of merging the two lists via merge sort?

You have two sorted lists, one with m elements and one with n elements. What would be the time complexity of merging the two lists via merge sort? 

Merging Lists Complexity

Write a SQL query to select the 2nd highest salary in the engineering department.

Note: If more than one person shares the highest salary, the query should select the next highest salary.

Example:

Input:

<code>employees</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>first_name</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>last_name</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>salary</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>department_id</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<code>departments</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>
</tbody>
</table>
Output:

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

<tbody>
<tr>
<td><code>salary</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>

Suppose your company needs to cut costs due to an economic downturn. During a coffee break, you hear a rumor that a lot of money goes to employees who don’t do their work, and you decide to find out if the rumor is true.

Given two tables: <code>employees</code> and <code>projects</code>, find the sum of the salaries of all the employees who didn’t complete any of their projects.

Clarification:

We will consider a project unfinished if it has no end date (its <code>End_dt</code> is <code>NULL</code>).

Given this, we’ll say an employee didn’t finish any of their projects when:

<ul>
<li>They were assigned at least one project.</li>
<li>None of their projects have an <code>End_dt</code>.</li>
</ul>

Example:

Input:

<code>employees</code> table

<table>
<thead>
<tr>
<th>id</th>
<th>salary</th>
</tr>
</thead>

<tbody>
<tr>
<td>INTEGER</td>
<td>FLOAT</td>
</tr>
</tbody>
</table>
<code>projects</code> table

<table>
<thead>
<tr>
<th>employee_id</th>
<th>project_id</th>
<th>Start_dt</th>
<th>End_dt</th>
</tr>
</thead>

<tbody>
<tr>
<td>INTEGER</td>
<td>INTEGER</td>
<td>DATETIME</td>
<td>DATETIME</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>total_slack_salary</th>
</tr>
</thead>

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

As part of the financial management in a large corporation, the CFO wants to review the expenses in all departments for the previous financial year (2022).

Write a SQL query to calculate the total expenditure for each department in 2022. Additionally, for comparison purposes, return the average expense across all departments in 2022.

Note: The output should include the department name, the total expense, and the average expense (rounded to 2 decimal places). The data should be sorted in descending order by total expenditure.

<h3>Example:</h3>

Input:

<code>departments</code> table

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

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

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

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

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

<tr>
<td>department_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>amount</td>
<td>FLOAT</td>
</tr>

<tr>
<td>date</td>
<td>DATE</td>
</tr>
</tbody>
</table>
Output:

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

<tbody>
<tr>
<td>department_name</td>
<td>VARCHAR</td>
</tr>

<tr>
<td>total_expense</td>
<td>FLOAT</td>
</tr>

<tr>
<td>average_expense</td>
<td>FLOAT</td>
</tr>
</tbody>
</table>

Calculate total and average expenses for each department.

Department Expenses

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>

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>

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

Prime to N

There are two tables. One table is called <code>swipes</code> that holds a row for every Tinder swipe and contains a boolean column that determines if the swipe was a right or left swipe called <code>is_right_swipe</code>. The second is a table named <code>variants</code> that determines which user has which variant of an AB test.

Write a SQL query to output the average number of right swipes for two different variants of a feed ranking algorithm by comparing users that have swiped 10, 50, and 100 swipes in a <code>feed_change</code> experiment.

Note: Users have to have swiped at least 10 times to be included in the subset of users to analyze the mean number of right swipes.

Example:

Input:

<code>variants</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>experiment</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>variant</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>user_id</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<code>swipes</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>user_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>swiped_user_id</code></td>
<td>INTEGER</td>
</tr>

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

<tr>
<td><code>is_right_swipe</code></td>
<td>BOOLEAN</td>
</tr>
</tbody>
</table>
Output:

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

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

<tr>
<td><code>mean_right_swipes</code></td>
<td>FLOAT</td>
</tr>

<tr>
<td><code>swipe_threshold</code></td>
<td>INTEGER</td>
</tr>

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

Write a SQL query to find the average number of right swipes for different ranking algorithms.

Swipe Precision

A/B Testing

Given two strings <code>A</code> and <code>B</code>, write a function <code>can_shift</code> to return whether or not <code>A</code> can be shifted some number of places to get <code>B</code>.

Example:

Input:

<pre tabindex="0" class="chroma"><code>A = &#39;abcde&#39;
B = &#39;cdeab&#39;
can_shift(A, B) == True

A = &#39;abc&#39;
B = &#39;acb&#39;
can_shift(A, B) == False
</code></pre>

How would you explain what a p-value is to someone who is not technical?

What does a p-value in a statistical test represent?

What does a p-value in a statistical test represent?

P-value to a Layman I

In a statistical test, how does a low p-value (less than 0.05) influence our decision about the null hypothesis?

In a statistical test, how does a low p-value (less than 0.05) influence our decision about the null hypothesis?

P-value to a Layman II

Write a Python function called <code>max_profit</code> that takes a list of integers, where the i-th integer represents the price of a given stock on day i, and returns the maximum profit you can achieve by buying and selling the stock.

You may complete, at most, two complete buy/sell transactions to maximize profits on a stock.

Input:

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

Output:

<pre tabindex="0" class="chroma"><code>def max_profit(prices) -&gt; 6
</code></pre>

Explanation:

<pre><code>Buy on day 4 (price = 0) and sell on day 6 (price = 3): profit = 3 - 0 = 3.
Then buy again on day 7 (price = 1) and sell on day 8 (price = 4): profit = 4 - 1 = 3.
Total profit: 3 + 3 = 6.
</code></pre>

Maximum Profit

Write a function <code>minimum_change</code> to find the minimum number of coins that make up the given amount of change <code>cents</code>. Assume we only have coins of value 1, 5, 10, and 25 cents.

Example:

Input:

<pre tabindex="0" class="chroma"><code>cents = 73
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def minimum_change(cents) -&gt; 7
#(25 + 25 + 10 + 10 + 1 + 1 + 1)
</code></pre>

Let’s say you work at Costco. Costco has a database with two tables. The first is <code>users</code> composed of user information, including their registration date, and the second is <code>purchases</code> that has the entire item purchase history (if any) for those users.

Write a query to get the total amount spent on each item in the ‘purchases’ table by users that registered in 2022.

Example:

Input:

<code>users</code> table

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

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

<tr>
<td><code>user_name</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>registration_date</code></td>
<td>DATETIME</td>
</tr>
</tbody>
</table>
<code>purchases</code> table

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

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

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

<tr>
<td><code>item</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>price</code></td>
<td>FLOAT</td>
</tr>

<tr>
<td><code>purchase_date</code></td>
<td>DATETIME</td>
</tr>
</tbody>
</table>
Output:

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

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

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

Total Spent on Products

Given the <code>transactions</code> table below, write a query that finds the third purchase of every user.

Note: Sort the results by the <code>user_id</code> in ascending order. If a user purchases two products at the same time, the lower <code>id</code> field is used to determine which is the first purchase.

Example:

Input:

<code>transactions</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>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>Columns</th>
<th>Type</th>
</tr>
</thead>

<tbody>
<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>

Third Purchase

Let’s say you’re given a dataframe of standardized test scores from high schoolers from grades 9 to 12 called df_grades.

Given the dataset, write code function in Pandas called bucket_test_scores to return the cumulative percentage of students that received scores within the buckets of &lt;50, &lt;75, &lt;90, &lt;100.

Example:

Input:

<pre tabindex="0" class="chroma"><code>print(df_grades)
</code></pre>

<table>
<thead>
<tr>
<th>user_id</th>
<th>grade</th>
<th>test score</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>10</td>
<td>85</td>
</tr>

<tr>
<td>2</td>
<td>10</td>
<td>60</td>
</tr>

<tr>
<td>3</td>
<td>11</td>
<td>90</td>
</tr>

<tr>
<td>4</td>
<td>10</td>
<td>30</td>
</tr>

<tr>
<td>5</td>
<td>11</td>
<td>99</td>
</tr>
</tbody>
</table>
Output:

<pre tabindex="0" class="chroma"><code>def bucket_test_scores(df_grades) -&gt;
</code></pre>

<table>
<thead>
<tr>
<th>grade</th>
<th>test score</th>
<th>percentage</th>
</tr>
</thead>

<tbody>
<tr>
<td>10</td>
<td>&lt;50</td>
<td>33%</td>
</tr>

<tr>
<td>10</td>
<td>&lt;75</td>
<td>66%</td>
</tr>

<tr>
<td>10</td>
<td>&lt;90</td>
<td>100%</td>
</tr>

<tr>
<td>10</td>
<td>&lt;100</td>
<td>100%</td>
</tr>

<tr>
<td>11</td>
<td>&lt;50</td>
<td>0%</td>
</tr>

<tr>
<td>11</td>
<td>&lt;75</td>
<td>0%</td>
</tr>

<tr>
<td>11</td>
<td>&lt;90</td>
<td>50%</td>
</tr>

<tr>
<td>11</td>
<td>&lt;100</td>
<td>100%</td>
</tr>
</tbody>
</table>

Given a string, find the first non-repeating character in it and return its index. If it doesn’t exist, return -1.

Example questions:

Consider a string where all characters are lowercase alphabets.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>s = &#39;helloworld&#39;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>first_uniq_char(s) -&gt; 0
</code></pre>

In the string ‘helloworld’, the first non-repeating character is ‘h’, which is at index 0.

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>s = &#39;concussion&#39;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>first_uniq_char(s) -&gt; 4
</code></pre>

In the string ‘concussion’, the first non-repeating character is ‘u’, which is at index 4.

This problem involves finding the first non-repeating character in a given string. The solution involves iterating over the string and keeping track of the frequency of each character. The first character that has a frequency of 1 is the first non-repeating character.

Find the First Non-Repeating Character in a String

Tell me about a data project that didn’t go the way you expected. What did you set out to do, what surprised you, and how did you handle it?

Describing a data project and its challenges

Hurdles In Data Projects

Behavioral

Let’s say you work at Uber. The <code>rides</code> table contains information about the trips of Uber users across America

Write a query to get the average commute time (in minutes) for each commuter in New York (NY) and the average commute time (in minutes) across all commuters in New York.

Example:

Input:

<code>rides</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>commuter_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>start_dt</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>end_dt</code></td>
<td>DATETIME</td>
</tr>

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

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

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

<tr>
<td><code>avg_commuter_time</code></td>
<td>FLOAT</td>
</tr>

<tr>
<td><code>avg_time</code></td>
<td>FLOAT</td>
</tr>
</tbody>
</table>
Display results like:

<table>
<thead>
<tr>
<th><code>commuter_id</code></th>
<th><code>avg_commuter_time</code></th>
<th><code>avg_time</code></th>
</tr>
</thead>

<tbody>
<tr>
<td>11</td>
<td>27</td>
<td>45</td>
</tr>

<tr>
<td>22</td>
<td>97</td>
<td>45</td>
</tr>

<tr>
<td>33</td>
<td>11</td>
<td>45</td>
</tr>
</tbody>
</table>

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

Write a query to return pairs of projects where the end date of one project matches the start date of another project. 

Example:

Input:

<code>projects</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>title</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>start_date</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>end_date</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>budget</code></td>
<td>FLOAT</td>
</tr>
</tbody>
</table>
Output

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

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

<tr>
<td><code>project_title_start</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>date</code></td>
<td>DATETIME</td>
</tr>
</tbody>
</table>

Project Pairs

Assume you have a logistic model that is heavily weighted on one variable and that one variable has sample data like 50.00, 100.00, 40.00, etc….

Next let’s assume that there was a data quality issue with that variable and an unknown number of values removed the decimal point. For example 100.00 turned into 10000.

Would the model still be valid? Why or why not? How would you fix the model?

In predicting Airbnb booking prices with a dataset containing thousands of diverse features, which regression model could potentially perform better?

In predicting Airbnb booking prices with a dataset containing thousands of diverse features, which regression model could potentially perform better?

Variable Error

Let’s say that you work at a bank that wants to build a model to detect fraud on the platform.

The bank wants to implement a text messaging service in addition that will text customers when the model detects a fraudulent transaction in order for the customer to approve or deny the transaction with a text response.

How would we build this model?

Let’s say that you work at a bank that wants to build a model to detect fraud on the platform.

The bank wants to implement a text messaging service that will text customers when the model detects a fraudulent transaction in order for the customer to approve or deny the transaction with a text response.

Which statement is true?

Let's say that you work at a bank that wants to build a model to detect fraud on the platform.

The bank wants to implement a text messaging service that will text customers when the model detects a fraudulent transaction in order for the customer to approve or deny the transaction with a text response.

Which statement is true?

Given two strings, <code>string1</code> and <code>string2</code>, write a function <code>str_map</code> to determine if there exists a one-to-one correspondence (bijection) between the characters of <code>string1</code> and <code>string2</code>.

For the two strings, our correspondence must be between characters in the same position/index.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;qwe&#39;
string2 = &#39;asd&#39;

string_map(string1, string2) == True

# q = a, w = s, and e = d
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;donut&#39;
string2 = &#39;fatty&#39;

string_map(string1, string2) == False
# cannot map two distinct characters to two equal characters
</code></pre>

Example 3:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;enemy&#39;
string2 = &#39;enemy&#39;

string_map(string1, string2) == True
# there exists a one-to-one correspondence between equivalent strings
</code></pre>

Example 4:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;enemy&#39;
string2 = &#39;ymene&#39;

string_map(string1, string2) == False
# since our correspondence must be between characters of the same index, this case returns &#39;False&#39; as we must map e = y AND e = e
</code></pre>

String Mapping

Given a list of tuples featuring names and grades on a test, write a function <code>normalize_grades</code> to normalize the values of the grades to a linear scale between <code>0</code> and <code>1</code>.

Example:

Input:

<pre tabindex="0" class="chroma"><code>grades = [
 (&#39;Jason&#39;, 94),
 (&#39;Tessa&#39;, 80),
 (&#39;Carla&#39;, 38),
 (&#39;Matt&#39;, 43),
 (&#39;Jessica&#39;, 100)
]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def normalize_grades(grades) - &gt; [
 (&#39;Jason&#39;, 0.9),
 (&#39;Tessa&#39;, 0.68),
 (&#39;Carla&#39;, 0.0),
 (&#39;Matt&#39;, 0.08),
 (&#39;Jessica&#39;, 1.0)
]
</code></pre>

Given a list of tuples featuring names and grades on a test, write a function to normalize the values of the grades to a linear scale between 0 and 1.

Normalize Grades

Over budget on a project is defined when the salaries, prorated to the day, exceed the budget of the project.

For example, if Alice and Bob both combined income make 200K and work on a project of a budget of 50K that takes half a year, then the project is over budget given 0.5 * 200K = 100K &gt; 50K.

Write a query to forecast the budget for all projects and return a label of <code>&#34;overbudget&#34;</code> if it is over budget and <code>&#34;within budget&#34;</code> otherwise.

Note: Assume that employees only work on one project at a time.

Example:

Input:

<code>employees</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>first_name</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>last_name</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>salary</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>department_id</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<code>projects</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>title</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>state_date</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>end_date</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>budget</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
departments 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>
</tbody>
</table>
<code>employee_projects</code> table

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

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

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

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

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

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

Over-Budget Projects

You’re playing casino dice game. You roll a die once. If you reroll, you earn the amount equal to the number on your second roll otherwise, you earn the amount equal to the number on your first roll.

Assuming you adopt a profit-maximizing strategy, what would be the expected amount of money you would win?

Imagine you are asked to build a machine learning model to decide new loan approvals for a
financial firm. You ask the data department in the company for a subset of data to get started
working on the problem. The data includes different features about applicants such as age,
occupation, zip code, height, number of children, favorite color, etc. You decide to build
multiple machine learning models to test out different ideas before settling on the best one.

How would you explain the bias-variance tradeoff with regards to
building and choosing a model to use?

Bias vs. Variance Tradeoff

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

<ol>
<li>Given an example paragraph string and an integer <code>N</code>, write a function <code>n_frequent_words</code> that returns the top <code>N</code> frequent words in the posting and the frequencies for each word.</li>

<li>What’s the function run-time?</li>
</ol>

Example:

Input:

<pre tabindex="0" class="chroma"><code>posting = &#34;&#34;&#34;
Herbal sauna uses the healing properties of herbs in combination with distilled water. 
The water evaporates and distributes the effect of the herbs throughout the room. 
A visit to the herbal sauna can cause real miracles, especially for colds. 
&#34;&#34;&#34; 
n = 3
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>n_frequent_words(posting,N) = [
 (&#39;the&#39;, 6), 
 (&#39;herbal&#39;, 2), 
 (&#39;sauna&#39;, 2),
]
</code></pre>

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

Unison Interview Questions

Overview

Unison Interview Guides

Challenge

Unison Interview Questions

Discussion & Interview Experiences

Discussion & Interview Experiences