Prepare for and practice interview questions from Catalyte across topics like Statistics, SQL, Machine Learning and more.

Catalyte Interview Questions

Catalyte Interview Guides

Machine Learning

Why can the same machine learning algorithm produce different success rates on the same dataset

Same Algorithm Different Success

Rebalancing outcome probabilities for a classifier on imbalanced data.

Rebalance Probabilities

Lasso vs Ridge

In which case would you use a bagging algorithm versus a boosting algorithm

Bagging vs Boosting

How would you evaluate whether a decision tree is the right model and assess its performance before and after deployment

Decision Tree Evaluation

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

Find Bigrams

Minimum Change

Write a function to select only the rows where the student's favorite color is green or red and their grade is above 90.

Good Grades and Favorite Colors

Data Modeling

Design a database schema for a Tinder-style dating app and discuss needed optimizations

Swiping App Design

System design for a digital classroom service.

Digital Classroom System Design

Design a database for a stand-alone fast food restaurant

Fast Food Database

Migrating a social network's data from a document database to a relational database for better data metrics

Relational Migration

Design a database for a ride-sharing app.

Ride-Sharing App Schema

Write a query to get the current salary for each employee after an ETL error.

Employee Salaries (ETL Error)

Write a query to find the average downloads for free vs paying accounts by day, rounded to 2 decimals

Download Facts

Project Budget Error

Write a query to get the top five projects by budget-to-employee-count ratio

Employee Project Budgets

Find the 3 lowest-paid employees that have completed at least 2 projects

Lowest Paid

Data Pipelines

Design a data pipeline to compute hourly, daily, and weekly active user metrics from a data lake for an hourly-refreshing dashboard

Data Pipelines and Aggregation

How would you clean a 100GB .csv file without loading it into memory

Processing Large CSV

Redesign batch credit card processing to enable real-time streaming for fraud detection and reporting.

Real-Time Transaction Streaming

Aggregating and collecting unstructured data.

Unstructured Data Pipeline (ETL)

Design a secure, real-time, scalable portfolio management system with notifications and caching.

Portfolio Platform Architecture

Amy and Brad take turns in rolling a fair six-sided die. Whoever rolls a “6” first wins the game. Amy starts by rolling first.

What’s the probability that Amy wins?

Amy and Brad take turns in rolling a fair six-sided die. Whoever rolls a “6” first wins the game. Amy starts by rolling first.

What’s the probability that Amy wins?

First to Six

Probability

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

Given two tables: <code>accounts</code>, and <code>downloads</code>, find the average number of downloads for free vs paying accounts, broken down by day.

Note: You only need to consider accounts that have had at least one download before when calculating the average.

Note: round <code>average_downloads</code> to 2 decimal places.

Example:

Input:

<code>accounts</code> table

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

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

<tr>
<td><code>paying_customer</code></td>
<td>BOOLEAN</td>
</tr>
</tbody>
</table>
<code>downloads</code> table

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

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

<tr>
<td><code>download_date</code></td>
<td>DATETIME</td>
</tr>

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

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

<tbody>
<tr>
<td><code>download_date</code></td>
<td>DATETIME</td>
</tr>

<tr>
<td><code>paying_customer</code></td>
<td>BOOLEAN</td>
</tr>

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

Let’s say we have a table representing a company payroll schema.

Due to an ETL error, the employees table, instead of updating the salaries every year when doing compensation adjustments, did an insert instead. The head of HR still needs the current salary of each employee.

Write a query to get the current salary for each employee.

Note: Assume no duplicate combination of first and last names (I.E. No two John Smiths). Assume the <code>INSERT</code> operation works with <code>ID</code> autoincrement.

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>VARCHAR</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>
Output:

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

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

Given tables <code>employees</code>,
<code>employee_projects</code>, and <code>projects</code>, find the 3 lowest-paid employees that have completed at least 2 projects.

Note: incomplete projects will have an end date of <code>NULL</code> in the projects table.

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>employee_projects</code> table

<table>
<thead>
<tr>
<th>Column</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>
</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>start_date</code></td>
<td>DATE</td>
</tr>

<tr>
<td><code>end_date</code></td>
<td>DATE</td>
</tr>

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

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

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

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

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

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

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

You are about to get on a plane to Seattle. You want to know if you should bring an umbrella. You call 3 random friends of yours who live there and ask each independently if it’s raining. Each of your friends has a 2⁄3 chance of telling you the truth and a 1⁄3 chance of messing with you by lying. All 3 friends tell you that “Yes” it is raining.

What is the probability that it’s actually raining in Seattle?

What is the main difference between the Frequentist and Bayesian methods of probabilistic analysis?

What is the **main** difference between the Frequentist and Bayesian methods of probabilistic analysis?

Frequentist Vs Bayesian Analysis

What is the probability that it's actually raining in Seattle?

Raining in Seattle

We’re given two tables. One is named <code>projects</code> and the other maps employees to the projects they’re working on. 

We want to select the five most expensive projects by budget to employee count ratio. But let’s say that we’ve found a bug where there exist duplicate rows in the <code>employee_projects</code> table.

Write a query to account for the error and select the top five most expensive projects by budget to employee count ratio.

<h3>Schema</h3>

Input:

<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>
<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>budget_per_employee</code></td>
<td>FLOAT</td>
</tr>
</tbody>
</table>

<h3>Example</h3>

Input:

<code>projects</code> table

<table>
<thead>
<tr>
<th>id</th>
<th>title</th>
<th>start_date</th>
<th>end_date</th>
<th>budget</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>party</td>
<td>2006-04-17 00:00:00</td>
<td>2006-05-19 00:00:00</td>
<td>25875</td>
</tr>

<tr>
<td>2</td>
<td>diversity</td>
<td>2017-08-09 00:00:00</td>
<td>2017-09-18 00:00:00</td>
<td>77867</td>
</tr>

<tr>
<td>3</td>
<td>integration</td>
<td>2005-06-29 00:00:00</td>
<td>2005-07-19 00:00:00</td>
<td>75987</td>
</tr>

<tr>
<td>4</td>
<td>testing</td>
<td>2009-01-12 00:00:00</td>
<td>2009-05-03 00:00:00</td>
<td>35946</td>
</tr>

<tr>
<td>5</td>
<td>launch</td>
<td>2005-05-02 00:00:00</td>
<td>2005-10-16 00:00:00</td>
<td>66292</td>
</tr>

<tr>
<td>6</td>
<td>meet</td>
<td>2001-09-09 00:00:00</td>
<td>2002-04-04 00:00:00</td>
<td>71243</td>
</tr>

<tr>
<td>7</td>
<td>payroll</td>
<td>2019-09-25 00:00:00</td>
<td>2020-05-05 00:00:00</td>
<td>97071</td>
</tr>

<tr>
<td>8</td>
<td>admin</td>
<td>2000-07-08 00:00:00</td>
<td>2000-09-10 00:00:00</td>
<td>24000</td>
</tr>

<tr>
<td>9</td>
<td>petronas</td>
<td>2016-07-01 00:00:00</td>
<td>2016-11-28 00:00:00</td>
<td>37088</td>
</tr>

<tr>
<td>10</td>
<td>bel</td>
<td>2005-08-03 00:00:00</td>
<td>2006-04-29 00:00:00</td>
<td>61937</td>
</tr>
</tbody>
</table>
<code>employee_projects</code> table

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

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

<tr>
<td>1</td>
<td>9</td>
</tr>

<tr>
<td>2</td>
<td>6</td>
</tr>

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

<tr>
<td>3</td>
<td>2</td>
</tr>

<tr>
<td>4</td>
<td>5</td>
</tr>

<tr>
<td>5</td>
<td>3</td>
</tr>

<tr>
<td>5</td>
<td>4</td>
</tr>

<tr>
<td>6</td>
<td>8</td>
</tr>

<tr>
<td>8</td>
<td>10</td>
</tr>

<tr>
<td>9</td>
<td>11</td>
</tr>

<tr>
<td>10</td>
<td>12</td>
</tr>

<tr>
<td>5</td>
<td>5</td>
</tr>

<tr>
<td>9</td>
<td>11</td>
</tr>

<tr>
<td>6</td>
<td>8</td>
</tr>

<tr>
<td>4</td>
<td>5</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>title</th>
<th>budget_per_employee</th>
</tr>
</thead>

<tbody>
<tr>
<td>diversity</td>
<td>77867</td>
</tr>

<tr>
<td>meet</td>
<td>71243</td>
</tr>

<tr>
<td>bel</td>
<td>61937</td>
</tr>

<tr>
<td>integration</td>
<td>37993.5</td>
</tr>

<tr>
<td>petronas</td>
<td>37088</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>

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>

Consider a trip from one city to another that may contain many layovers. Given the list of flights out of order, each with a starting city and end city, write a function <code>plan_trip</code> to reconstruct the path of the trip so the trip tickets are in order.

Example:

For a trip from Bombay to Beijing:

Input:

<pre tabindex="0" class="chroma"><code>flights = [
 [&#39;Chennai&#39;, &#39;Bangalore&#39;], 
 [&#39;Bombay&#39;, &#39;Delhi&#39;], 
 [&#39;Goa&#39;, &#39;Chennai&#39;], 
 [&#39;Delhi&#39;, &#39;Goa&#39;], 
 [&#39;Bangalore&#39;, &#39;Beijing&#39;]
]
output = [
 [&#39;Bombay&#39;, &#39;Delhi&#39;], 
 [&#39;Delhi&#39;, &#39;Goa&#39;], 
 [&#39;Goa&#39;, &#39;Chennai&#39;], 
 [&#39;Chennai&#39;, &#39;Bangalore&#39;], 
 [&#39;Bangalore&#39;, &#39;Beijing&#39;],
]
</code></pre>

Reconstruct the path of a trip so that the trip tickets are in order.

Scrambled Tickets

We’re given two tables. One is named <code>projects</code> and the other maps employees to the projects they’re working on.

Write a query to get the top five most expensive projects by budget to employee count ratio.

Note: Exclude projects with 0 employees. Assume each employee works on only one project.

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

Let’s say we’re comparing two machine learning algorithms. In which case would you use a bagging algorithm versus a boosting algorithm? 

Give an example of the tradeoffs between the two.

In machine learning, when would you use a bagging algorithm over a boosting algorithm?

In machine learning, when would you use a bagging algorithm over a boosting algorithm?

Bagging vs. Boosting

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

Write a function called <code>find_bigrams</code> that takes a sentence or paragraph of strings and returns a list of all its bigrams in order.

Note: A bigram is a pair of consecutive words.

Example:

Input:

<pre tabindex="0" class="chroma"><code>sentence = &#34;&#34;&#34;
Have free hours and love children? 
Drive kids to school, soccer practice 
and other activities.
&#34;&#34;&#34;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def find_bigrams(sentence) -&gt;

 [(&#39;have&#39;, &#39;free&#39;),
 (&#39;free&#39;, &#39;hours&#39;),
 (&#39;hours&#39;, &#39;and&#39;),
 (&#39;and&#39;, &#39;love&#39;),
 (&#39;love&#39;, &#39;children?&#39;),
 (&#39;children?&#39;, &#39;drive&#39;),
 (&#39;drive&#39;, &#39;kids&#39;),
 (&#39;kids&#39;, &#39;to&#39;),
 (&#39;to&#39;, &#39;school,&#39;),
 (&#39;school,&#39;, &#39;soccer&#39;),
 (&#39;soccer&#39;, &#39;practice&#39;),
 (&#39;practice&#39;, &#39;and&#39;),
 (&#39;and&#39;, &#39;other&#39;),
 (&#39;other&#39;, &#39;activities.&#39;)]
</code></pre>

<h1>Binary Tree Validation</h1>

You are given the root of a binary tree. You need to determine if it is a valid binary search tree (BST).

A valid BST is defined as follows:

<ul>
<li>The left subtree of a node contains only nodes with values less than or equal to the node’s value.</li>
<li>The right subtree of a node contains only nodes with values greater than or equal to the node’s value.</li>
<li>Both the left and right subtrees must also be binary search trees.</li>
</ul>

Given the function <code>def is_valid_bst(root: Node) -&gt; bool:</code>, return True if the binary tree is a valid BST. Otherwise, return False.

<h3>Example:</h3>

Input:

<img src="/s3/questions/9664817c-3e12-4a40-9236-8382b13f55a0.png" alt="image"/>Converted Binary Tree.png

Output:

<pre tabindex="0" class="chroma"><code>def is_valid_bst(Node(3)) -&gt; True
</code></pre>

Given the root node, verify if a binary search tree is valid or not.

Binary Tree Validation

Suppose we have two coins. One is fair and the other biased where the probability of it coming up heads is 3⁄4.

Let’s say we select a coin at random and flip it two times. What is the probability that both flips result in the same side?

Suppose we have two coins. One is fair and the other biased where the probability of it coming up heads is 3/4. You select a coin at random and flip it two times. What is the probability that both flips result in the same side?

Suppose we have two coins. One is fair and the other biased where the probability of it coming up heads is 3/4. You select a coin at random and flip it two times. What is the probability that both flips result in the same side?

Same Side Probability

What is the probability that both flips result in the same side?

You’re given a dataframe of students named <code>students_df</code>:

<code>students_df</code> table

<table>
<thead>
<tr>
<th>name</th>
<th>age</th>
<th>favorite_color</th>
<th>grade</th>
</tr>
</thead>

<tbody>
<tr>
<td>Tim Voss</td>
<td>19</td>
<td>red</td>
<td>91</td>
</tr>

<tr>
<td>Nicole Johnson</td>
<td>20</td>
<td>yellow</td>
<td>95</td>
</tr>

<tr>
<td>Elsa Williams</td>
<td>21</td>
<td>green</td>
<td>82</td>
</tr>

<tr>
<td>John James</td>
<td>20</td>
<td>blue</td>
<td>75</td>
</tr>

<tr>
<td>Catherine Jones</td>
<td>23</td>
<td>green</td>
<td>93</td>
</tr>
</tbody>
</table>
Write a function named <code>grades_colors</code> to select only the rows where the student’s favorite color is green or red and their grade is above 90.

Example:

Input:

<pre tabindex="0" class="chroma"><code>import pandas as pd

students = {&#34;name&#34; : [&#34;Tim Voss&#34;, &#34;Nicole Johnson&#34;, &#34;Elsa Williams&#34;, &#34;John James&#34;, &#34;Catherine Jones&#34;], &#34;age&#34; : [19, 20, 21, 20, 23], &#34;favorite_color&#34; : [&#34;red&#34;, &#34;yellow&#34;, &#34;green&#34;, &#34;blue&#34;, &#34;green&#34;], &#34;grade&#34; : [91, 95, 82, 75, 93]}

students_df = pd.DataFrame(students)
</code></pre>

Output:

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

<table>
<thead>
<tr>
<th>name</th>
<th>age</th>
<th>favorite_color</th>
<th>grade</th>
</tr>
</thead>

<tbody>
<tr>
<td>Tim Voss</td>
<td>19</td>
<td>red</td>
<td>91</td>
</tr>

<tr>
<td>Catherine Jones</td>
<td>23</td>
<td>green</td>
<td>93</td>
</tr>
</tbody>
</table>

You work as a backend engineer at Glassdoor. The company relies on multiple legacy systems to aggregate and process job postings, salary data, and company reviews. To ensure reliable data ingestion and processing, you are tasked with building a monitoring service that tracks the health of these legacy systems via regular heartbeat signals.

The service must expose one endpoint to receive heartbeat signals from each legacy system, and another endpoint to return a list of systems that have not sent a heartbeat in the last five seconds. How would you architect this monitoring system? Write a technical design document describing your approach.

Design a monitoring service for legacy system health via heartbeat endpoints at Glassdoor.

Legacy System Heartbeat Monitor

DevOps

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

Explain what a p-value is to someone who is not technical

P-value to a Layman

Statistics

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

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

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

You work as a data engineer at a global financial services company. The current pipeline ingests millions of daily credit card transactions via nightly batch jobs. The business now requires real-time processing and analysis for each transaction to support instant fraud detection and real-time reporting.

How would you redesign the ingestion and processing architecture to enable reliable, scalable, and consistent real-time streaming of transaction data?

Draft a design proposal outlining your approach.

Write a function <code>get_ngrams</code> to take in a word (string) and return a dictionary of n-grams and their frequency in the given string.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>string = &#39;banana&#39; 
n=2
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>output = {&#39;ba&#39;:1, &#39;an&#39;:2, &#39;na&#39;:2} 
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>string = &#39;banana&#39; 
n=3 
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>output = {&#39;ban&#39;:1, &#39;ana&#39;:2, &#39;nan&#39;:1}
</code></pre>

Write a function get_ngrams to return a dictionary of n-grams and their frequency in a string

N-gram Dictionary

How does random forest generate the forest? Additionally, why would we use it over other algorithms such as logistic regression?

What happens when you average the output on multiple decision trees?

What happens when you average the output on multiple decision trees?

Average Trees

How does random forest generate the forest and why use it over logistic regression

Random Forest Explanation

As a data engineer for Slack, they asked you to design their new product, “Slack for School”. When designing their database, you ponder upon the following questions:

<ol>
<li>What are the critical entities, and how would they interact?</li>

<li>Imagine we want to provide insights to teachers about students’ class participation. How should we design an ETL process to extract data about when and how often each student interacts with the app?</li>

<li>Suppose a teacher wants to see the students’ assignment submission trends over the last six months. How would you write a SQL query to retrieve this data?</li>
</ol>

How would you answer?

You have been given a table <code>tbl_numbers</code> with only one column: <code>int_numbers</code>. It can have one integer number value per row in a sequential manner.

Write a query to return the number repeated by one times its own value.

For example, the integer number 5 would appear five times in the output (1 times 5).

Example:

Input:

<code>tbl_numbers</code> table

<table>
<thead>
<tr>
<th>int_numbers</th>
</tr>
</thead>

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

<tr>
<td><code>2</code></td>
</tr>

<tr>
<td><code>3</code></td>
</tr>

<tr>
<td><code>4</code></td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>seq_numbers</th>
</tr>
</thead>

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

<tr>
<td><code>2</code></td>
</tr>

<tr>
<td><code>2</code></td>
</tr>

<tr>
<td><code>3</code></td>
</tr>

<tr>
<td><code>3</code></td>
</tr>

<tr>
<td><code>3</code></td>
</tr>

<tr>
<td><code>4</code></td>
</tr>

<tr>
<td><code>4</code></td>
</tr>

<tr>
<td><code>4</code></td>
</tr>

<tr>
<td><code>4</code></td>
</tr>
</tbody>
</table>

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

Catalyte Interview Questions

Catalyte Interview Guides

Catalyte Interview Questions

Challenge

Catalyte Salaries by Position

Discussion & Interview Experiences

Discussion & Interview Experiences