Prepare for and practice interview questions from Komodo Health across topics like Python, SQL, Probability and more.

Komodo Health Interview Questions

Komodo Health 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

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

Prime to N

Write a function moving_window to find the moving window average

Moving Window

Write a function one_element_removed that returns the integer removed from list Y in O(1) space and O(n) time without using set

One Element Removed

Machine Learning

Which model would perform better and why?

Booking Regression

How do we deal with the missing square footage data to construct our model

Missing Housing Data

How would we build a model to detect fraud and text customers to approve or deny fraudulent transactions

Bank Fraud Model

What metrics would you use to track accuracy and validity of the model

Spam Classifier 

How would you build a machine learning system to generate Spotify's discover weekly playlist

Generating Discover Weekly

Write a SQL query to create a histogram of the number of comments per user in the month of January 2020.

Comments Histogram

Write a query to return whether each user's subscription date range overlaps with any other completed subscription

Subscription Overlap

Write a query to show the number of users, transactions, and total order amount per month in 2020

Monthly Customer Report

Write a query to forecast each project's budget and label it overbudget or within budget

Over-Budget Projects

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

Random SQL Sample

A/B Testing

Button AB Test

How would you make a control group and test group to account for network effects

Network Experiment Design

How would you analyze the effectiveness of this new feature?

Green Dot

What are the pros and cons of user-tied test vs user-untied test

AB Test Ties

How would you design a two-week A/B test to determine whether a pricing increase is a good business decision

Testing Price Increase

Statistics

Say you are given a dataset of perfectly linearly separable data. What would happen when you run logistic regression?

Perfectly Separable

What is the downside of only using the R-Squared (R^2) value to determine a relationship between two variables

Using R Squared

Design a test to determine whether the coin is biased

Possibly Biased Coin

How do you detect and handle correlation between variables in linear regression, and what happens if you ignore it

Correlation in Regression

How would you tackle multicollinearity in multiple linear regression

Multicollinearity in Regression

A jar holds 1000 coins. Out of all of the coins, 999 are fair and one is double-sided with two heads. Picking a coin at random, you toss the coin ten times.

Given that you see 10 heads, what is the probability that the coin is double headed and the probability that the next toss of the coin is also a head?

Compute the probability the coin is double headed and the probability the next toss is a head given 10 heads

Jars and Coins

Probability

Given a dataframe with three columns:

<ul>
<li>client_id</li>
<li>ranking</li>
<li>value</li>
</ul>

Write a function to fill the NaN values in the value column with the previous non-NaN value from the same client_id ranked in ascending order.

If there doesn’t exist a previous client_id then return the previous value.

Input:

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

<table>
<thead>
<tr>
<th>client_id</th>
<th>ranking</th>
<th>value</th>
</tr>
</thead>

<tbody>
<tr>
<td>1001</td>
<td>1</td>
<td>1000</td>
</tr>

<tr>
<td>1001</td>
<td>2</td>
<td>NaN</td>
</tr>

<tr>
<td>1001</td>
<td>3</td>
<td>1200</td>
</tr>

<tr>
<td>1002</td>
<td>1</td>
<td>1500</td>
</tr>

<tr>
<td>1002</td>
<td>2</td>
<td>1250</td>
</tr>

<tr>
<td>1002</td>
<td>3</td>
<td>NaN</td>
</tr>

<tr>
<td>1003</td>
<td>1</td>
<td>1100</td>
</tr>

<tr>
<td>1003</td>
<td>2</td>
<td>NaN</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>client_id</th>
<th>ranking</th>
<th>value</th>
</tr>
</thead>

<tbody>
<tr>
<td>1001</td>
<td>1</td>
<td>1000</td>
</tr>

<tr>
<td>1002</td>
<td>1</td>
<td>1500</td>
</tr>

<tr>
<td>1003</td>
<td>1</td>
<td>1100</td>
</tr>

<tr>
<td>1001</td>
<td>2</td>
<td>1000</td>
</tr>

<tr>
<td>1002</td>
<td>2</td>
<td>1250</td>
</tr>

<tr>
<td>1003</td>
<td>2</td>
<td>1100</td>
</tr>

<tr>
<td>1001</td>
<td>3</td>
<td>1200</td>
</tr>

<tr>
<td>1002</td>
<td>3</td>
<td>1250</td>
</tr>
</tbody>
</table>

Write a function to fill the NaN values in the dataframe.

Previous NaN Values

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 create a histogram of the number of comments per user in the month of January 2020.

Note: Assume bin buckets class intervals of one.

Note: Comments that were created outside of January 2020 should be counted in a “0” bucket

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

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

<tr>
<td><code>mail</code></td>
<td>VARCHAR</td>
</tr>
</tbody>
</table>
<code>comments</code> table

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

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

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

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

<tr>
<td><code>frequency</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 a table of product subscriptions with a subscription start date and end date for each user, write a query that returns true or false whether or not each user has a subscription date range that overlaps with any other completed subscription.

Completed subscriptions have <code>end_date</code> recorded.

Example:

Input:

<code>subscriptions</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>start_date</code></td>
<td>DATETIME</td>
</tr>

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

<table>
<thead>
<tr>
<th><code>user_id</code></th>
<th><code>start_date</code></th>
<th><code>end_date</code></th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>2019-01-01</td>
<td>2019-01-31</td>
</tr>

<tr>
<td>2</td>
<td>2019-01-15</td>
<td>2019-01-17</td>
</tr>

<tr>
<td>3</td>
<td>2019-01-29</td>
<td>2019-02-04</td>
</tr>

<tr>
<td>4</td>
<td>2019-02-05</td>
<td>2019-02-10</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th><code>user_id</code></th>
<th><code>overlap</code></th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>1</td>
</tr>

<tr>
<td>2</td>
<td>1</td>
</tr>

<tr>
<td>3</td>
<td>1</td>
</tr>

<tr>
<td>4</td>
<td>0</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>

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>

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

A team wants to A/B test multiple different changes through a sign-up funnel.

For example, on a page, a button is currently red and at the top of the page. They want to see if changing a button from red to blue and/or from the top of the page to the bottom of the page will increase click-through.

How would you set up this test?

Your team wants to run an AB test on the color (red or blue) and position (top/bottom of the page) of a button that links to a promotion.

How many different variants of the test should you run to see the effect that a red button has on the bottom of the page, if currently the button is blue and on the top of the page.

Your team wants to run an AB test on the color (red or blue) and position (top/bottom of the page) of a button that links to a promotion.

How many different variants of the test should you run to see the effect that a red button has on the bottom of the page, if currently the button is blue and on the top of the page.

A/B Test Variants

You have a table containing information about the time that employees have worked on a project.

Write a query to find how many unique calendar days each employee worked. Order your query by the <code>employee_id</code>.

Example:

An employee worked on two projects, and recorded their time like this:

<table>
<thead>
<tr>
<th>employee_id</th>
<th>project_id</th>
<th>start_date</th>
<th>end_date</th>
</tr>
</thead>

<tbody>
<tr>
<td>1	</td>
<td>1</td>
<td>2024-01-01</td>
<td>2024-01-06</td>
</tr>

<tr>
<td>1	</td>
<td>2</td>
<td>2024-01-03</td>
<td>2024-01-07</td>
</tr>
</tbody>
</table>
The number of unique calendar days is therefore 7.

<h3>Schema</h3>

Input:

<code>projects</code> table

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

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

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

<tr>
<td><code>start_date</code>	</td>
<td>	DATE	</td>
</tr>

<tr>
<td><code>end_date</code>	</td>
<td>	DATE	</td>
</tr>
</tbody>
</table>
Output:

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

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

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

<h3>Example</h3>

Input:

<code>projects</code> table

<table>
<thead>
<tr>
<th>employee_id</th>
<th>project_id</th>
<th>start_date</th>
<th>end_date</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>1</td>
<td>2024-01-01</td>
<td>2024-01-15</td>
</tr>

<tr>
<td>1</td>
<td>1</td>
<td>2024-01-21</td>
<td>2024-01-31</td>
</tr>

<tr>
<td>1</td>
<td>2</td>
<td>2024-01-25</td>
<td>2024-02-28</td>
</tr>

<tr>
<td>2</td>
<td>3</td>
<td>2024-01-01</td>
<td>2024-01-31</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>employee_id</th>
<th>unique_days_worked</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>54</td>
</tr>

<tr>
<td>2</td>
<td>31</td>
</tr>
</tbody>
</table>

Unique Work Days

Given an array and a target integer, write a function <code>sum_pair_indices</code> that returns the indices of two integers in the array that add up to the target integer. If not found, just return an empty list.

Note: Can you do it on $O(n)$ time?

Note: Even though there could be many solutions, only one needs to be returned.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>array = [1 2 3 4] 
target = 5 
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def sum_pair_indices(array, target) -&gt; [0 3] or [1 2]
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>array = [3]
target = 6 
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>Do NOT return [0 0] as you can&#39;t use an index twice.
</code></pre>

Given an array and a target integer, write a function that returns the indices of two integers in the array that add up to the target integer.

Target Indices

Write a query to show the number of users, number of transactions placed, and total order amount per month in the year 2020. Assume that we are only interested in the monthly reports for a single year (January-December).

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>
<code>users</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>sex</code></td>
<td>VARCHAR</td>
</tr>
</tbody>
</table>
Output:

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

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

<tr>
<td><code>num_customers</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>num_orders</code></td>
<td>INTEGER</td>
</tr>

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

Let’s say we have a very naive advertising platform. There is an audience of size A and a limited amount of impressions B.

Each of the impressions goes to just one user, defined at random. Every user in the audience has the same random chance of receiving each impression. 

<ol>
<li>Compute the probability that a user has exactly 0 impressions. </li>

<li>What’s the probability that every person has at least 1 impression?</li>
</ol>

Compute the probability a user gets exactly 0 impressions, and the probability everyone gets at least 1 impression

Impression Reach

You are given two rectangles <code>a</code> and <code>b</code> each defined by four ordered pairs denoting their corners on the <code>x</code>, <code>y</code> plane. Write a function <code>rectangle_overlap</code> to determine whether or not they overlap. Return <code>True</code> if so, and <code>False</code> otherwise.

Note: If the two rectangles border one another, or share a corner like two diagonally adjacent positions on a chessboard, they are said to overlap.

Note: The lists of ordered pairs are in no particular order. The first entry in list <code>a</code> could be the top left corner while the first in list <code>b</code> is the bottom right.

Example:

Input:

<pre tabindex="0" class="chroma"><code>
a = [(-3,5), (-3,2),(0,5),(0,2)]
b = [(-1,4), (3,4), (3,1), (-1,1)]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def rectangle_overlap(a, b) -&gt; True
</code></pre>

As point <code>(0,2)</code> is fully contained in rectangle <code>b</code> and point <code>(-1,4)</code> is fully contained in a rectangle <code>a</code>.

Write a function to determine whether or not two rectangles overlap.

Rectangle Overlap

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

Let’s say you want to test the close friends feature on Instagram Stories.

How would you make a control group and test group to account for network effects?

What could be a potential risk when Facebook segments the metrics of the user interface change by market or demographic groups?

What could be a potential risk when Facebook segments the metrics of the user interface change by market or demographic groups?

Network Experiment Design I

What is the primary metric that Facebook should monitor if it decides to make the user interface of its posting feature more like Instagram's?

What is the primary metric that Facebook should monitor if it decides to make the user interface of its posting feature more like Instagram's?

Network Experiment Design II

If Facebook changes its user interface to mimic Instagram's, which adverse effect should they anticipate and monitor?

If Facebook changes its user interface to mimic Instagram's, which adverse effect should they anticipate and monitor?

Network Experiment Design III

Given a list of integers, identify all the duplicate values in the list. Assume that the list can contain both positive and negative numbers, and the order of the list does not matter. A number is considered a duplicate if it appears more than once in the list. Return a list of the duplicate numbers.

Example 1:

Input:

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

Output:

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

The numbers 1, 2, and 3 all appear more than once in the list, so they are considered duplicates.

Example 2:

Input:

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

Output:

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

The numbers -1 and 3 both appear more than once in the list, so they are considered duplicates. Note that the order of the output does not matter.

Example 3:

Input:

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

Output:

<pre tabindex="0" class="chroma"><code>find_duplicates(nums) -&gt; []
</code></pre>

None of the numbers in the list appear more than once, so there are no duplicates.

This problem involves identifying duplicate numbers in a list of integers. The function should return a list of the duplicate numbers.

Find Duplicate Numbers in a List

There are two lists, <code>list X</code> and <code>list Y</code>. Both lists contain integers from <code>-1000</code> to <code>1000</code> and are identical to each other except that one integer is removed in <code>list Y</code> that exists in <code>list X</code>.

Write a function <code>one_element_removed</code> that takes in both lists and returns the integer that was removed in $O(1)$ space and $O(n)$ time without using the python set function.

Example:

Input:

<pre tabindex="0" class="chroma"><code>list_x = [1,2,3,4,5]
list_y = [1,2,4,5]

one_element_removed(list_x, list_y) -&gt; 3
</code></pre>

Which of the following methods would be the most efficient way of identifying what element is not included in two lists of integers that differ by a single element being removed?

For example, if the lists are <code>[1,2,3,4,5]</code> and <code>[1,2,4,5]</code>, the function should return <code>3</code>

Which of the following methods would be the most efficient way of identifying what element is not included in two lists of integers that differ by a single element being removed? 

For example, if the lists are `[1,2,3,4,5]` and `[1,2,4,5]`, the function should return `3`

Efficiently Identifying Missing Integer

Given two strings, <code>string1</code> and <code>string2</code>, write a function <code>is_subsequence</code> to find out if <code>string1</code> is a subsequence of <code>string2</code>.

Bonus: A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

Example:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;abc&#39;
string2 = &#39;asbsc&#39;
string3 = &#39;acedb&#39;

is_subsequence(string1, string2) -&gt; True
is_subsequence(string1, string3) -&gt; False
</code></pre>

Write a function is_subsequence to find out if string1 is a subsequence of string2

String Subsequence

Say you are given a dataset of perfectly linearly separable data.

What would happen when you run logistic regression?

What happens when logistic regression is run on a dataset of perfectly linearly separable data?

What happens when logistic regression is run on a dataset of perfectly linearly separable data?

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?

Let’s say that you’re the PM on Google Maps.

<ol>
<li>How would you improve Google Maps?</li>

<li>What metrics would you check to see if your feature improvements are successful?</li>
</ol>

Google Maps Improvement

Product Sense & Metrics

Let’s say you’re interning at a fintech startup that’s building a platform for online games of chance. During testing, one of your simulations flips a coin 10 times and gets 8 tails and 2 heads.

How would you determine if the coin is fair, and what statistical approach would you use to support your conclusion?

How would you assess if a coin is fair after observing 8 tails in 10 flips?

Fair Coin

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>

Write a function str_map to determine if there exists a one-to-one correspondence between characters of string1 and string2

String Mapping

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

Given a 2D terrain represented by an array of non-negative integers, where each integer represents the height of a terrain level at that index, implement an algorithm to calculate the total amount of rainwater that can be trapped in this terrain.
Consider that rainwater can only be trapped between two terrain levels with higher heights, and the trapped water cannot flow out through the edges.

The algorithm should have an optimal time complexity of O(n) and a space complexity of O(n).
 Provide a detailed explanation of the algorithm and its implementation in Python.

Example:

<table>
<thead>
<tr>
<th>Index</th>
<th>0</th>
<th>1</th>
<th>2</th>
<th>3</th>
<th>4</th>
</tr>
</thead>

<tbody>
<tr>
<td>Terrain Level</td>
<td>3</td>
<td>0</td>
<td>2</td>
<td>0</td>
<td>4</td>
</tr>

<tr>
<td>Trapped Water</td>
<td>0</td>
<td>3</td>
<td>1</td>
<td>3</td>
<td>0</td>
</tr>
</tbody>
</table>
In this table, the ‘Index’ row represents the position of the terrain levels, the ‘Terrain Level’ row shows the height of the terrain at each index, and the ‘Trapped Water’ row illustrates the trapped rainwater between the terrain levels. The total trapped rainwater in this example is 7 units (3 + 1 + 3).

Input:

<pre tabindex="0" class="chroma"><code>terrainLevels = [3, 0, 2, 0, 4]
</code></pre>

Output:

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

In this example, the terrain is represented by the <code>terrainLevels</code> array. The algorithm should calculate the total trapped rainwater, which is 7 units in this case. The trapped rainwater is formed between the heights of 3, 0, 2, 0, and 4.

Given a 2D terrain array, calculate the total amount of trapped rainwater with O(n) time and O(n) space

Level Of Rain Water In 2D Terrain

Say you are tasked with analyzing how well a model fits the data given. You want to determine a relationship between two variables.

What is the downside of only using the R-Squared $(R^2)$ value to do so?

In the context of regression analysis, why is it misleading to rely solely on a high R-squared ($R^2$) value to infer a causal relationship between variables?

In the context of regression analysis, why is it misleading to rely solely on a high R-squared ($R^2$) value to infer a causal relationship between variables?

Using R Squared I

Which of the following best describes the R-squared ($R^2$) value in the context of a regression model?

Which of the following best describes the R-squared ($R^2$) value in the context of a regression model?

Using R Squared II

What is a limitation of using R-squared ($R^2$) as the only metric to evaluate a regression model's fit?

What is a limitation of using R-squared ($R^2$) as the only metric to evaluate a regression model's fit?

Using R Squared III

Let’s say that you’re looking at the metrics of a job board. You see that the number of job postings per day has more or less remained the same the last few months but the number of applicants that have applied to jobs has steadily been decreasing.

Why would this be happening?

Why would the number of applicants be steadily decreasing while job postings remain the same

Declining Applicants

Business Case

Given a list of numbers <code>nums</code> and an integer <code>window_size</code>, write a function <code>moving_window</code> to find the moving window average.

Example 1:

Input:

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

Output:

<pre tabindex="0" class="chroma"><code>def moving_window(input, window_size) -&gt; [1, 1.5, 2, 3, 4, 5]
</code></pre>

Example 2:

Input:

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

Output:

<pre tabindex="0" class="chroma"><code>def moving_window(input, window_size) -&gt; [1, 1.5, 2, 2.5, 3.5, 4.5]
</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

Komodo Health Interview Questions

Komodo Health Interview Guides

Komodo Health Interview Questions

Challenge

Komodo Health Salaries by Position

Discussion & Interview Experiences

Discussion & Interview Experiences