Prepare for and practice interview questions from Youtube across topics like SQL, Product Metrics, Takehome and more.

Youtube Interview Questions

Youtube Interview Guides

Data Structures & Algorithms

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

Merge Sorted Lists

Find Bigrams

Write a function to create a single dataframe with complete addresses in the format of street, city, state, zip code.

Complete Addresses

Write a function friendship_timeline to generate an output that lists the pairs of friends with their corresponding timestamps of the friendship beginning and then the timestamp of the friendship ending. 

Friendship Timeline

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

Write a query to select the top 3 departments with at least ten employees and rank them according to the percentage of their employees making over 100K in salary.

Employee Salaries

Select the 2nd highest salary in the engineering department

2nd Highest Salary

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 that returns all neighborhoods that have 0 users.

Empty Neighborhoods

Subscription Overlap

Product Sense & Metrics

How would you investigate a decline in the average number of comments per user?

Decreasing Comments

Promoting Instagram

Threaded Comments

How do we measure the success of acquiring new users through a free trial

Netflix Retention

Group Success

Machine Learning

Booking Regression

How do we give each rejected applicant a reason why they got rejected?

Rejection Reason

Job Recommendation

RMS Error

Bank Fraud Model

Analytics

Write a query to create a metric that can validate and rank the queries by their search result precision.

Search Ratings

Write a query to get the distribution of the number of conversations created by each user by day in the year 2020.

Conversations Distribution

We're interested in determining if a data scientist who switches jobs more often ends up getting promoted to a manager role faster than a data scientist that stays at one job for longer. 

Career Jumping

What metrics would you use to determine the value of each marketing channel?

Marketing Channel Metrics

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

Activity Conversion

<p>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.</p>

<p>Write a query that returns all neighborhoods that have 0 users. </p>

<p><strong>Example:</strong></p>

<p><strong>Input:</strong></p>

<p><code>users</code> table</p>

<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>
<p><code>neighborhoods</code> table</p>

<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>
<p><strong>Output:</strong></p>

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

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


<p>Given the <code>employees</code> and <code>departments</code> table, write a query to get the top 3 highest employee salaries by department. If the department contains less that 3 employees, the top 2 or the top 1 highest salaries should be listed (assume that each department has at least 1 employee). </p>

<p><em>Note: The output should include the full name of the employee in one column, the department name, and the salary. The output should be sorted by department name in ascending order and salary in descending order.</em> </p>

<p><strong>Example:</strong></p>

<p><strong>Input:</strong></p>

<p><code>employees</code> table</p>

<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>
<p><code>departments</code> table</p>

<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>
<p><strong>Output</strong>:</p>

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

<tbody>
<tr>
<td><code>employee_nam</code>e</td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>department_name</code></td>
<td>VARCHAR</td>
</tr>

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


Get the top 3 highest employee salaries by department

Top Three Salaries

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

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


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

Success Measurement

<p>Blizzard Entertainment operates a global network of games and services, each generating massive volumes of real-time gameplay and infrastructure events, everything from player actions in Overwatch to server status updates for World of Warcraft. You are tasked with building a centralized system to reliably ingest, process, and distribute these events across the company for analytics, live operations, and player-facing features.</p>

<p>How would you architect the data ingestion and processing pipeline for this event system?</p>


Design a scalable event data pipeline for real-time, multi-application ingestion and processing.

Centralized Event Ingestion

Data Pipelines

<p>Meta’s trust and safety team has been running an ML model that detects accounts posting prohibited content (adult content, illegal goods, scam ads, policy-restricted ads) and bans them. Currently, approximately 5% of all content on the platform is prohibited.</p>

<p>The ML team has developed a new model intended to replace the existing one. You don’t yet know whether the new model performs better or worse.</p>

<p>How would you determine if the new system is working? Walk through the stakeholders affected, the key metrics you’d track, and how you’d distinguish a well-performing model from a poorly-performing one.</p>


Designing an ML system for unsafe content detection

Unsafe Content ML Design

Responsible AI & Security

<p>Given a table called <code>user_experiences</code>, write a query to determine the percentage of users that held the title of <code>&#34;Data Analyst&#34;</code> immediately before holding the title <code>&#34;Data Scientist&#34;</code>.</p>

<p>Immediate is defined as the user holding no other titles between the <code>&#34;Data Analyst&#34;</code> and <code>&#34;Data Scientist&#34;</code> roles.</p>

<p><strong>Example:</strong></p>

<p><strong>Input:</strong></p>

<p><code>user_experiences</code> table</p>

<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>position_name</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>user_id</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<p><strong>Output:</strong></p>

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

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


User Experience Percentage

<p>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.</p>

<p>Write a query to randomly sample a row from this table.</p>

<p><strong>Input:</strong></p>

<p><code>big_table</code> table</p>

<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

<p>Given a table of bank transactions with columns <code>id</code>, <code>transaction_value</code>, and <code>created_at</code> representing the date and time for each transaction, write a query to get the last transaction for each day.</p>

<p>The output should include the id of the transaction, datetime of the transaction, and the transaction amount. Order the transactions by datetime.</p>

<p><strong>Example:</strong></p>

<p><strong>Input:</strong></p>

<p><code>bank_transactions</code> table</p>

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

<tr>
<td><code>transaction_value</code></td>
<td>FLOAT</td>
</tr>
</tbody>
</table>
<p><strong>Output:</strong></p>

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

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

<tr>
<td><code>transaction_value</code></td>
<td>FLOAT</td>
</tr>

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


Last Transaction

<p>Let’s say we want to build a naive recommender. We’re given two tables, one table called <code>friends</code> with a <code>user_id</code> and <code>friend_id</code> columns representing each user’s friends, and another table called <code>page_likes</code> with a <code>user_id</code> and a <code>page_id</code> representing the page each user liked.</p>

<p>Write an SQL query to create a metric to recommend pages for each user based on recommendations from their friend’s liked pages. </p>

<p><em>Note: It shouldn’t recommend pages that the user already likes.</em></p>

<p><strong>Example:</strong></p>

<p><strong>Input:</strong></p>

<p><code>friends</code> table</p>

<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>friend_id</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<p><code>page_likes</code> table</p>

<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>page_id</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<p><strong>Output:</strong></p>

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

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


Write a query to get the number of friends of a user that like a specific page

Liked Pages

<p>You’re a data scientist at Meta working on a feature that helps users discover trending books and understand borrowing behavior across the platform’s digital library.</p>

<p>Every time a user borrows a book, the system logs a <code>borrowed_at</code> timestamp and a <code>returned_at</code> timestamp. The team wants to measure how long books are typically kept, while also flagging which books have large inventories.</p>

<p>Write a SQL query to compute the following metrics for each book:</p>

<ol>
<li><strong><code>avg_borrow_duration_days</code>:</strong> average borrowing duration in days (rounded to 2 decimals)</li>
<li><strong><code>has_over_10_copies</code>:</strong> <code>&#39;Yes&#39;</code> if the book has more than 10 copies available, otherwise <code>&#39;No&#39;</code></li>
</ol>

<p>Only include completed borrows where <code>returned_at</code> is not NULL.</p>

<p>Sort results by <code>avg_borrow_duration_days</code> DESC, then by <code>book_id</code> ASC.</p>

<p><strong><em>Note:</em></strong> <em>Every book that has at least one completed borrow should appear in the output.</em></p>

<h3><strong>Schema</strong></h3>

<p><strong>Input</strong></p>

<p><strong><code>books</code> Table</strong></p>

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

<tbody>
<tr>
<td>book_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>title</td>
<td>VARCHAR</td>
</tr>

<tr>
<td>copies_available</td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<p><strong><code>borrows</code> Table</strong></p>

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

<tbody>
<tr>
<td>borrow_id</td>
<td>INTEGER</td>
</tr>

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

<tr>
<td>book_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>borrowed_at</td>
<td>DATETIME</td>
</tr>

<tr>
<td>returned_at</td>
<td>DATETIME</td>
</tr>
</tbody>
</table>
<p><strong>Output</strong></p>

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

<tbody>
<tr>
<td>book_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>avg_borrow_duration_days</td>
<td>DECIMAL</td>
</tr>

<tr>
<td>has_over_10_copies</td>
<td>VARCHAR</td>
</tr>
</tbody>
</table>

<h3><strong>Example</strong></h3>

<p><strong>Input</strong></p>

<p><strong><code>books</code> Table</strong></p>

<table>
<thead>
<tr>
<th>book_id</th>
<th>title</th>
<th>copies_available</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>Dune</td>
<td>12</td>
</tr>

<tr>
<td>2</td>
<td>Sapiens</td>
<td>8</td>
</tr>

<tr>
<td>3</td>
<td>Clean Code</td>
<td>15</td>
</tr>
</tbody>
</table>
<p><strong><code>borrows</code> Table</strong></p>

<table>
<thead>
<tr>
<th>borrow_id</th>
<th>user_id</th>
<th>book_id</th>
<th>borrowed_at</th>
<th>returned_at</th>
</tr>
</thead>

<tbody>
<tr>
<td>101</td>
<td>10</td>
<td>1</td>
<td>2026-01-01 09:00:00</td>
<td>2026-01-06 09:00:00</td>
</tr>

<tr>
<td>102</td>
<td>11</td>
<td>1</td>
<td>2026-01-10 10:00:00</td>
<td>2026-01-13 22:00:00</td>
</tr>

<tr>
<td>103</td>
<td>12</td>
<td>2</td>
<td>2026-01-02 12:00:00</td>
<td>2026-01-04 12:00:00</td>
</tr>

<tr>
<td>104</td>
<td>13</td>
<td>2</td>
<td>2026-01-05 09:00:00</td>
<td>NULL</td>
</tr>

<tr>
<td>105</td>
<td>14</td>
<td>3</td>
<td>2026-01-03 08:00:00</td>
<td>2026-01-10 08:00:00</td>
</tr>
</tbody>
</table>
<p><strong>Output</strong></p>

<table>
<thead>
<tr>
<th>book_id</th>
<th>avg_borrow_duration_days</th>
<th>has_over_10_copies</th>
</tr>
</thead>

<tbody>
<tr>
<td>3</td>
<td>7.00</td>
<td>Yes</td>
</tr>

<tr>
<td>1</td>
<td>4.25</td>
<td>Yes</td>
</tr>

<tr>
<td>2</td>
<td>2.00</td>
<td>No</td>
</tr>
</tbody>
</table>
<p><strong>Explanation</strong></p>

<p>For book 1, there are two completed borrows. The durations are 5.00 days (Jan 1 → Jan 6) and 3.50 days (Jan 10 10:00 → Jan 13 22:00). The average borrowing duration is (5.00 + 3.50) / 2 = 4.25 days. Since <code>copies_available = 12</code>, the book is flagged as <code>&#39;Yes&#39;</code>.</p>

<p>For book 2, only one borrow is completed (the other has <code>returned_at = NULL</code> and is excluded). The completed duration is 2.00 days. Since <code>copies_available = 8</code>, it is flagged as <code>&#39;No&#39;</code>.</p>

<p>For book 3, there is one completed borrow lasting 7.00 days, and <code>copies_available = 15</code>, so it is flagged as <code>&#39;Yes&#39;</code>.</p>


Write a SQL query to compute the average borrowing duration and identify books with over 10 copies.

Digital Library Borrowing Metrics

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

<p>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.</p>

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

<h3>Schema</h3>

<p><strong>Input:</strong></p>

<p><code>projects</code> table</p>

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

<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>
<p><strong>Output:</strong></p>

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

<p><strong>Input:</strong></p>

<p><strong><code>projects</code> table</strong></p>

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

<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>
<p><strong>Output:</strong></p>

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


Project Budget Error

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

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

<p>Write a SQL query to identify every valid tachycardia run and return:</p>

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

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

<p><strong>Definition of a Tachycardia Run</strong></p>

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

<p><strong><em>Note:</em></strong> <em>A patient may have multiple separate runs.</em></p>

<p><strong>Schema</strong></p>

<p><strong>Input</strong></p>

<p><strong><code>ecg_readings</code> table</strong></p>

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

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

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

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

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

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

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

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

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

<p><strong>Input</strong></p>

<p><strong><code>ecg_readings</code> table</strong></p>

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

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

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

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

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

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

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

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

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

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

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

<h3><strong>Explanation</strong></h3>

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


Write a SQL query to identify every valid tachycardia run.

Detecting ECG Tachycardia Runs

<p>Given a string, write a function <code>recurring_char</code> to find its first recurring character. Return <code>None</code> if there is no recurring character.</p>

<p>Treat upper and lower case letters as distinct characters.</p>

<p>You may assume the input string includes no spaces.</p>

<p><strong>Example 1:</strong></p>

<p><strong>Input:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="nb">input</span> <span class="o">=</span> <span class="s2">&#34;interviewquery&#34;</span>
</span></span></code></pre>

<p><strong>Output:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">output</span> <span class="o">=</span> <span class="s2">&#34;i&#34;</span>
</span></span></code></pre>

<p><strong>Example 2:</strong></p>

<p><strong>Input:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="nb">input</span> <span class="o">=</span> <span class="s2">&#34;interv&#34;</span>
</span></span></code></pre>

<p><strong>Output:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">output</span> <span class="o">=</span> <span class="kc">None</span>
</span></span></code></pre>


Given a string, write a function to find its first recurring character.

Recurring Character

<p>You’re a data scientist working for a smart grocery platform that helps families automatically plan their Christmas dinner based on their dietary preferences and pantry availability.</p>

<p>Each Christmas recipe consists of several ingredients, and each ingredient has different brands with different prices. Families want the cheapest possible ingredient combination but only using brands they have marked as acceptable and only those ingredients they do not already have in their pantry.</p>

<p>Write a SQL query to determine the cheapest valid shopping cost for each recipe for family_id = 1, while also identifying whether the recipe is feasible to make.</p>

<p>For each recipe, compute:</p>

<ol>
<li><strong><code>missing_ingredients</code>:</strong> number of ingredients the family does not already have in their pantry</li>
<li><strong><code>min_total_cost</code>:</strong> total minimum cost required to buy missing ingredients</li>
<li>feasible:

<ul>
<li><code>&#39;Yes&#39;</code> if every missing ingredient has at least one acceptable brand available</li>
<li><code>&#39;No&#39;</code> otherwise (and <code>min_total_cost</code> should be <code>NULL</code>)</li>
</ul></li>
</ol>

<p><strong><em>Note:</em></strong> <em>Sort results by <code>missing_ingredients</code> ASC and <code>min_total_cost</code> ASC (NULLS LAST)</em></p>

<p><strong>Schema</strong></p>

<p><strong>Input</strong></p>

<p><strong><code>recipes</code> Table</strong></p>

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

<tbody>
<tr>
<td>recipe_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>ingredient_id</td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<p><strong><code>ingredient_brands</code> Table</strong></p>

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

<tbody>
<tr>
<td>ingredient_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>brand_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>price</td>
<td>DECIMAL</td>
</tr>
</tbody>
</table>
<p><strong><code>pantry</code> Table</strong></p>

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

<tbody>
<tr>
<td>family_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>ingredient_id</td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<p><strong><code>acceptable_brands</code> Table</strong></p>

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

<tbody>
<tr>
<td>family_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>brand_id</td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<p><strong>Output</strong></p>

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

<tbody>
<tr>
<td>recipe_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>missing_ingredients</td>
<td>INTEGER</td>
</tr>

<tr>
<td>min_total_cost</td>
<td>DECIMAL</td>
</tr>

<tr>
<td>feasible</td>
<td>VARCHAR</td>
</tr>
</tbody>
</table>
<p><strong>Example</strong></p>

<p><strong>Input</strong></p>

<p><strong><code>recipes</code> Table</strong></p>

<table>
<thead>
<tr>
<th>recipe_id</th>
<th>ingredient_id</th>
</tr>
</thead>

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

<tr>
<td>1</td>
<td>200</td>
</tr>

<tr>
<td>1</td>
<td>300</td>
</tr>

<tr>
<td>2</td>
<td>200</td>
</tr>

<tr>
<td>2</td>
<td>400</td>
</tr>
</tbody>
</table>
<p><strong><code>pantry</code> Table</strong></p>

<table>
<thead>
<tr>
<th>family_id</th>
<th>ingredient_id</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>100</td>
</tr>
</tbody>
</table>
<p><strong><code>ingredient_brands</code> Table</strong></p>

<table>
<thead>
<tr>
<th>ingredient_id</th>
<th>brand_id</th>
<th>price</th>
</tr>
</thead>

<tbody>
<tr>
<td>200</td>
<td>10</td>
<td>3.50</td>
</tr>

<tr>
<td>200</td>
<td>11</td>
<td>2.99</td>
</tr>

<tr>
<td>300</td>
<td>20</td>
<td>8.50</td>
</tr>

<tr>
<td>400</td>
<td>30</td>
<td>6.75</td>
</tr>
</tbody>
</table>
<p><strong><code>acceptable_brands</code> Table</strong></p>

<table>
<thead>
<tr>
<th>family_id</th>
<th>brand_id</th>
</tr>
</thead>

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

<tr>
<td>1</td>
<td>20</td>
</tr>

<tr>
<td>1</td>
<td>30</td>
</tr>
</tbody>
</table>
<p><strong>Output</strong></p>

<table>
<thead>
<tr>
<th>recipe_id</th>
<th>missing_ingredients</th>
<th>min_total_cost</th>
<th>feasible</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>2</td>
<td>12.00</td>
<td>Yes</td>
</tr>

<tr>
<td>2</td>
<td>2</td>
<td>10.25</td>
<td>Yes</td>
</tr>
</tbody>
</table>

<h3><strong>Explanation</strong></h3>

<p>For Recipe 1, the required ingredients are 100, 200, and 300. The pantry already contains ingredient 100, so only 200 and 300 are missing. The cheapest acceptable option for ingredient 200 is brand 10 at $3.50, since brand 11 is not allowed. For ingredient 300, the cheapest acceptable option is brand 20 at $8.50. This makes the total cost $12.00, and the recipe is feasible.</p>

<p>For Recipe 2, the required ingredients are 200 and 400. The cheapest acceptable choice for ingredient 200 is again $3.50, and for ingredient 400 it is $6.75. The total comes to $10.25, and this recipe is also feasible.</p>


Write a SQL query to determine the cheapest valid shopping cost for each recipe for family_id = 1, while also identifying whether the recipe is feasible to make.

Christmas Dinner Ingredient Optimization

<p>Given a sorted list of positive integers with some entries being <code>None</code>, write a function to return a new list where all <code>None</code> values are replaced with the most recent non-<code>None</code> value in the list.</p>

<p><em>Note: If the first entry in the list is <code>None</code>, assume the previous entry was <code>0</code>.</em></p>

<p><strong>Example:</strong></p>

<p><strong>Input:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">input_list</span> <span class="o">=</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="kc">None</span><span class="p">,</span><span class="kc">None</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="kc">None</span><span class="p">]</span>
</span></span></code></pre>

<p><strong>Output:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="k">def</span> <span class="nf">fill_none</span><span class="p">(</span><span class="n">input_list</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">5</span><span class="p">]</span> 
</span></span></code></pre>


Write a function to return a new list where all empty values are replaced with the most recent non-empty value in the list.

Fill None Values

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

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

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

<p><strong>Example:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">is_balanced</span><span class="p">(</span><span class="s1">&#39;(())[]</span><span class="si">{}</span><span class="s1">&#39;</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="kc">True</span>
</span></span></code></pre>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">is_balanced</span><span class="p">(</span><span class="s1">&#39;{([()</span><span class="si">{}</span><span class="s1">])()}&#39;</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="kc">True</span>
</span></span></code></pre>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">is_balanced</span><span class="p">(</span><span class="s1">&#39;</span><span class="si">{}</span><span class="s1">[]())&#39;</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="kc">False</span>
</span></span></code></pre>

<hr/>


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

The Brackets Problem

<p>Let’s say that you’re the PM on Google Maps.</p>

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

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


Google Maps Improvement

<p>Let’s say you’re given all the different marketing channels along with their respective marketing costs at a company called Mode, that sells B2B analytics dashboards.</p>

<p>What metrics would you use to determine the value of each marketing channel?</p>


<p>When determining the value of each marketing channel for the company Mode, which metric is considered the key metric?</p>

When determining the value of each marketing channel for the company Mode, which metric is considered the key metric?

<p>Write a query to create a new table, named flight routes, that displays unique pairs of two locations.</p>

<p><em>Note: Duplicate pairs from the <code>flights</code> table, such as Dallas to Seattle and Seattle to Dallas, should have one entry in the flight routes table.</em></p>

<h3>Schema</h3>

<p><code>flights</code> table</p>

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

<tr>
<td><code>destination_location</code></td>
<td>VARCHAR</td>
</tr>
</tbody>
</table>
<p><strong>Output:</strong></p>

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

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

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

<h3>Example</h3>

<p><strong>Input:</strong></p>

<p><strong><code>flights</code> table</strong></p>

<table>
<thead>
<tr>
<th>id</th>
<th>source_location</th>
<th>destination_location</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>Seattle, WA</td>
<td>Dallas, TX</td>
</tr>

<tr>
<td>2</td>
<td>Dallas, TX</td>
<td>Seattle, WA</td>
</tr>

<tr>
<td>3</td>
<td>Seattle, WA</td>
<td>San Francisco, CA</td>
</tr>

<tr>
<td>4</td>
<td>San Francisco, CA</td>
<td>Dallas, TX</td>
</tr>

<tr>
<td>5</td>
<td>San Francisco, CA</td>
<td>Portland, OR</td>
</tr>

<tr>
<td>6</td>
<td>Seattle, WA</td>
<td>Dallas, TX</td>
</tr>

<tr>
<td>7</td>
<td>Portland, OR</td>
<td>San Francisco, CA</td>
</tr>

<tr>
<td>8</td>
<td>San Francisco, CA</td>
<td>Los Angeles, CA</td>
</tr>
</tbody>
</table>
<p><strong>Output:</strong></p>

<table>
<thead>
<tr>
<th>destination_one</th>
<th>destination_two</th>
</tr>
</thead>

<tbody>
<tr>
<td>Dallas, TX</td>
<td>Seattle, WA</td>
</tr>

<tr>
<td>Portland, OR</td>
<td>San Francisco, CA</td>
</tr>

<tr>
<td>San Francisco, CA</td>
<td>Seattle, WA</td>
</tr>

<tr>
<td>Dallas, TX</td>
<td>San Francisco, CA</td>
</tr>

<tr>
<td>Los Angeles, CA</td>
<td>San Francisco, CA</td>
</tr>
</tbody>
</table>


Flight Records

<p>Let’s say at Netflix we offer a subscription where customers can enroll for a 30-day free trial. After 30 days, customers will be automatically charged based on the package selected.</p>

<p>Let’s say we want to measure the success of acquiring new users through the free trial.</p>

<p>How can we measure acquisition success and what metrics can we use to measure the success of the free trial?</p>


<p>Let’s say we want to measure the effectiveness of Netflix’s 30-day free trial plan.</p>

<p>What is NOT a metric we would use?</p>


Let's say we want to measure the effectiveness of Netflix's 30-day free trial plan.

What is NOT a metric we would use?

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

<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><span class="line"><span class="cl"><span class="n">node</span> <span class="o">=</span> <span class="p">{</span>
</span></span><span class="line"><span class="cl">    <span class="s2">&#34;data&#34;</span><span class="p">:</span> <span class="mi">6</span><span class="p">,</span>
</span></span><span class="line"><span class="cl">    <span class="s2">&#34;left&#34;</span><span class="p">:</span> <span class="p">{</span>
</span></span><span class="line"><span class="cl">        <span class="s2">&#34;data&#34;</span><span class="p">:</span> <span class="mi">3</span><span class="p">,</span>
</span></span><span class="line"><span class="cl">        <span class="s2">&#34;left&#34;</span><span class="p">:</span> <span class="p">{</span><span class="o">...</span><span class="p">},</span>
</span></span><span class="line"><span class="cl">        <span class="s2">&#34;right&#34;</span><span class="p">:</span> <span class="p">{</span><span class="o">...</span><span class="p">}</span>
</span></span><span class="line"><span class="cl">    <span class="p">},</span>
</span></span><span class="line"><span class="cl">    <span class="s2">&#34;right&#34;</span><span class="p">:</span> <span class="p">{</span>
</span></span><span class="line"><span class="cl">        <span class="s2">&#34;data&#34;</span><span class="p">:</span> <span class="mi">9</span><span class="p">,</span>
</span></span><span class="line"><span class="cl">        <span class="s2">&#34;left&#34;</span><span class="p">:</span> <span class="p">{</span><span class="o">...</span><span class="p">},</span>
</span></span><span class="line"><span class="cl">        <span class="s2">&#34;right&#34;</span><span class="p">:</span> <span class="p">{</span><span class="o">...</span><span class="p">}</span>
</span></span><span class="line"><span class="cl">    <span class="p">}</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span></code></pre>

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

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

<p><strong>Example:</strong></p>

<p><strong>Input:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="c1"># Diagram of the binary tree</span>
</span></span><span class="line"><span class="cl"><span class="s1">&#39;&#39;&#39;
</span></span></span><span class="line"><span class="cl"><span class="s1">      6        
</span></span></span><span class="line"><span class="cl"><span class="s1">     / \        
</span></span></span><span class="line"><span class="cl"><span class="s1">    3   9     
</span></span></span><span class="line"><span class="cl"><span class="s1">   / </span><span class="se">\
</span></span></span><span class="line"><span class="cl"><span class="se"></span><span class="s1">  2   11
</span></span></span><span class="line"><span class="cl"><span class="s1">     / </span><span class="se">\
</span></span></span><span class="line"><span class="cl"><span class="se"></span><span class="s1">    5   8
</span></span></span><span class="line"><span class="cl"><span class="s1">&#39;&#39;&#39;</span>
</span></span><span class="line"><span class="cl"><span class="n">value1</span> <span class="o">=</span> <span class="mi">8</span>
</span></span><span class="line"><span class="cl"><span class="n">value2</span> <span class="o">=</span> <span class="mi">2</span>
</span></span></code></pre>

<p><strong>Output</strong>:</p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">common_ancestor</span><span class="p">(</span><span class="n">root</span><span class="p">,</span><span class="n">value1</span><span class="p">,</span><span class="n">value2</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="mi">3</span>
</span></span></code></pre>

<p><strong>Explanation</strong>:</p>

<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

<p>Suppose we have a binary classification model that classifies whether or not an applicant should be qualified to get a loan.</p>

<p>Because we are a financial company, we have to provide each rejected applicant with a reason why.</p>

<p>Given we don’t have access to the feature weights, how would we give each rejected applicant a reason why they got rejected?</p>


<p>In the context of a loan eligibility model, what does a partial dependence plot represent?</p>

In the context of a loan eligibility model, what does a partial dependence plot represent?

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

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


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

Real-Time Hashtag Partitioning

Concurrent & Distributed Systems

<p>You are asked to implement a simple regex parser which supports two operations: <code>&#39;.&#39;</code> and <code>&#39;*&#39;</code>. The <code>&#39;.&#39;</code> operation matches any single character, while the <code>&#39;*&#39;</code> operation matches zero or more of the preceding element. The matching should cover the entire input string (not partial).</p>

<p>Write a function <code>isMatch(s,p)</code> which takes in two parameters, the string and the regex pattern. It should return a Boolean output indicating a ‘match success’ or a ‘match failure’.</p>

<p><strong>Example 1:</strong></p>

<p><strong>Input:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">s</span> <span class="o">=</span> <span class="s1">&#39;aa&#39;</span>
</span></span><span class="line"><span class="cl"><span class="n">p</span> <span class="o">=</span> <span class="s1">&#39;a&#39;</span>
</span></span></code></pre>

<p><strong>Output:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">isMatch</span><span class="p">(</span><span class="n">s</span><span class="p">,</span> <span class="n">p</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="kc">False</span>
</span></span></code></pre>

<p>Explanation: ‘a’ does not match the entire string ‘aa’.</p>

<p><strong>Example 2:</strong></p>

<p><strong>Input:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">s</span> <span class="o">=</span> <span class="s1">&#39;aa&#39;</span>
</span></span><span class="line"><span class="cl"><span class="n">p</span> <span class="o">=</span> <span class="s1">&#39;a*&#39;</span>
</span></span></code></pre>

<p><strong>Output:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="n">isMatch</span><span class="p">(</span><span class="n">s</span><span class="p">,</span> <span class="n">p</span><span class="p">)</span> <span class="o">-&gt;</span> <span class="kc">True</span>
</span></span></code></pre>

<p>Explanation: ‘*’ means zero or more of the preceding element, ‘a’. Therefore, by repeating ‘a’ once, it becomes ‘aa’.</p>

<p><strong>Note: There is no need to consider the delimiting of characters ‘.’ and ‘*’</strong></p>


Implement a simple regex parser with operator support for '.' and '*'.

Basic Regex

<p>Suppose there are one million users and we want to expose 1000 users per day to a test. The same user can be selected twice for the test.</p>

<ol>
<li><p>What’s the expected value of how long someone will have to wait before they receive the test?</p></li>

<li><p>What is the likelihood they get selected after the first day? Is that closer to 0 or 1?</p></li>
</ol>


<p>Suppose there are one million users and we want to expose 1000 users per day to a test. The same user can be selected twice for the test.What's the expected value of how long someone will have to wait before they receive the test?</p>

Suppose there are one million users and we want to expose 1000 users per day to a test. The same user can be selected twice for the test.What's the expected value of how long someone will have to wait before they receive the test?

Expected Tests

Probability

<p>Let’s say we use people to rate ads.</p>

<p>There are two types of raters. Random and independent from our point of view:</p>

<ul>
<li>80% of raters are careful and they rate an ad as good (60% chance) or bad (40% chance). </li>
<li>20% of raters are lazy and they rate every ad as good (100% chance).</li>
</ul>

<ol>
<li>Suppose a rater rates just three ads, and rates them all as good. What’s the probability the rater was lazy?</li>
</ol>

<p>2. Suppose a rater sees $N$ ads and rates all of them as good. What happens to the probability the rater was lazy as $N$ tends to infinity?</p>

<p>3. Suppose we want to exclude lazy raters. Can you devise a rule to classify raters as careful or lazy for a given significance level $\alpha$?</p>


Ad raters are careful or lazy with some probability.

Ad Raters: Part 2

<p>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.</p>

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


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

Fair Coin

<p>Let’s say that you work for an online media company. The media company is starting to monetize its web traffic and wants to experiment with adding web banners into the middle of its reading content to see if it can monetize effectively.</p>

<p>How would you measure the success of the banner ad strategy?</p>


How would you measure the success of a banner ad strategy?

Banner Ad Strategy Success

A/B Testing

<p>Given a sorted list, create a function <strong><code>convert_to_bst</code></strong> that converts the list into a binary tree. <strong><code>convert_to_bst</code></strong> returns a <strong><code>TreeNode</code></strong> holding the root of the binary tree. A <strong><code>TreeNode</code></strong> is defined as the following:</p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="kn">from</span> <span class="nn">dataclasses</span> <span class="kn">import</span> <span class="n">dataclass</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
</span></span><span class="line"><span class="cl">    <span class="k">pass</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="nd">@dataclass</span>
</span></span><span class="line"><span class="cl"><span class="k">class</span> <span class="nc">TreeNode</span><span class="p">:</span>
</span></span><span class="line"><span class="cl">    <span class="n">value</span><span class="p">:</span> <span class="nb">int</span>
</span></span><span class="line"><span class="cl">    <span class="n">left</span><span class="p">:</span> <span class="n">TreeNode</span> <span class="o">=</span> <span class="kc">None</span>
</span></span><span class="line"><span class="cl">    <span class="n">right</span><span class="p">:</span> <span class="n">TreeNode</span> <span class="o">=</span> <span class="kc">None</span>
</span></span></code></pre>

<p>The output binary tree should be balanced, meaning the height difference between the left and right subtree of all the nodes should be at most one.</p>

<p><strong>Example:</strong></p>

<p><strong>Input:</strong></p>

<pre tabindex="0" class="chroma"><code><span class="line"><span class="cl"><span class="p">[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">,</span> <span class="mi">4</span><span class="p">,</span> <span class="mi">5</span><span class="p">]</span>
</span></span></code></pre>

<p><strong>Output:</strong></p>

<p><img src="/s3/questions/46a1a245-47bf-4b7e-8356-6019ef9af27b.png" alt="image"/>Converted Binary Tree.png</p>

<p><strong>Note:</strong> The output in the test cases will return an in-order traversal of your tree.</p>


Binary Tree Conversion

<p>Let’s say we’re given a biased coin that comes up heads 30% of the time when tossed.</p>

<p>What is the probability of the coin landing as heads exactly 5 times out of 6 tosses?</p>


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

Youtube Interview Questions

Youtube Interview Guides

Youtube Interview Questions

Challenge

Discussion & Interview Experiences

Discussion & Interview Experiences