Prepare for and practice interview questions from cādence across topics like Algorithms, Python, Presentation and more.

cādence Interview Questions

cādence 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

Find Bigrams

Write a function n_frequent_words that returns the top N frequent words and their frequencies, and state its run-time

Get Top N Frequent Words

Minimum Change

Machine Learning

Lasso vs Ridge

Rebalancing outcome probabilities for a classifier on imbalanced data.

Rebalance Probabilities

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

Same Algorithm Different Success

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

Bagging vs Boosting

What are some machine learning methods for building this system

FAQ Matching

Select the 2nd highest salary in the engineering department

2nd Highest Salary

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

7 Day Streak

Project Budget Error

Product Sense & Metrics

What’s the expected churn rate in March for all customers that bought the product since January 1st?

Expected Churn

Google Maps Improvement

What are the top five metrics you would start tracking to understand the health of Google Docs

Docs Metrics

How would you quantify the influence of a Twitter user

Influencer Metrics

What are the most important metrics for WhatsApp

WhatsApp Metrics

Behavioral

Describing a data project and its challenges

Hurdles In Data Projects

Strategically resolving misaligned expectations with stakeholders for a successful project outcome

Stakeholder Communication

Prioritized debt reduction, process improvement, and a focus on maintainability for fintech efficiency

Decreasing Tech Debt

How would you negotiate and resolve disagreements when a client rejects your proposed solution?

Client Solution Pushback

What challenges might you face when deploying a new model to production and how would you address them?

Production Rollout Challenges

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

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

Example:

Input:

<code>employees</code> table

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

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

<tr>
<td><code>first_name</code></td>
<td>VARCHAR</td>
</tr>

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

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

<tr>
<td><code>department_id</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<code>departments</code> table

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

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

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

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

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

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

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

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?

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>

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

Lowest Paid

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

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

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

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>

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

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

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

Example:

Input:

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

Output:

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

Let’s say 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>

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>

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

Employee Project Budgets

Given the integer list nums with length n, create a function that converts each integer in the list into its corresponding Roman numeral representation. The Roman numeral symbols and corresponding values are provided in the table below. The function must be able to handle integers up to 1000.

<table>
<thead>
<tr>
<th>Symbols</th>
<th>Values</th>
</tr>
</thead>

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

<tr>
<td>IV</td>
<td>4</td>
</tr>

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

<tr>
<td>IX</td>
<td>9</td>
</tr>

<tr>
<td>X</td>
<td>10</td>
</tr>

<tr>
<td>XL</td>
<td>40</td>
</tr>

<tr>
<td>L</td>
<td>50</td>
</tr>

<tr>
<td>XC</td>
<td>90</td>
</tr>

<tr>
<td>C</td>
<td>100</td>
</tr>

<tr>
<td>CD</td>
<td>400</td>
</tr>

<tr>
<td>D</td>
<td>500</td>
</tr>

<tr>
<td>CM</td>
<td>900</td>
</tr>

<tr>
<td>M</td>
<td>1000</td>
</tr>
</tbody>
</table>

<h3>Examples:</h3>

Input:

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

Output:

<pre tabindex="0" class="chroma"><code>[&#34;I&#34;, &#34;IV&#34;, &#34;CLXXIX&#34;]
</code></pre>

Convert a list of integers into their Roman numeral representations

Integer to Roman

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

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

Network Experiment Design

A/B Testing

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

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>

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?

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

<pre tabindex="0" class="chroma"><code>from dataclasses import dataclass

class TreeNode:
 pass

@dataclass
class TreeNode:
 value: int
 left: TreeNode = None
 right: TreeNode = None
</code></pre>

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.

Example:

Input:

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

Output:

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

Note: The output in the test cases will return an in-order traversal of your tree.

Binary Tree Conversion

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>

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

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

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

Example:

Input:

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

Output:

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

Lime’s consumer app team wants to measure the number of users who return to the app after their initial login. Given a user_logins table that records each user’s login by date, write a query to produce a daily summary with retention and engagement metrics.

For each date that appears in the user_logins table, calculate daily retention metrics including cohort size, 7-day retention, retention rate, and rolling 7-day active users. (A cohort for a given date consists of all users who logged in on that specific date (regardless of whether it was their first login or a subsequent login).

Notes:

<ul>
<li>A user is considered retained if they log in again within the next 7 days after their cohort date (days 2-8), excluding the cohort day itself.</li>
<li>The rolling 7-day users includes all distinct users who logged in during the 7-day window ending on the current date (from login_date - 6 days to login_date, inclusive).</li>
<li>Each (user_id, login_date) pair is unique - users can only log in once per day.
The output should be ordered by login_date ascending.</li>
<li>Retention rate should be calculated as: (retained_within_7d / cohort_users) * 100, rounded to 1 decimal place.</li>
</ul>

<h3>Schema:</h3>

Input:

<code>user_logins</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>login_date</code></td>
<td>DATE</td>
</tr>
</tbody>
</table>
Output:

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

<tbody>
<tr>
<td><code>login_date</code></td>
<td>DATE</td>
</tr>

<tr>
<td><code>cohort_users</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>retained_within_7d</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>retention_rate</code></td>
<td>DECIMAL(3, 2)</td>
</tr>

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

<h3>Example:</h3>

Input:

<table>
<thead>
<tr>
<th>user_id</th>
<th>login_date</th>
</tr>
</thead>

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

<tr>
<td>2</td>
<td>2024-06-01</td>
</tr>

<tr>
<td>1</td>
<td>2024-06-02</td>
</tr>

<tr>
<td>2</td>
<td>2024-06-08</td>
</tr>

<tr>
<td>3</td>
<td>2024-06-08</td>
</tr>

<tr>
<td>1</td>
<td>2024-06-09</td>
</tr>

<tr>
<td>3</td>
<td>2024-06-10</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>login_date</th>
<th>cohort_users</th>
<th>retained_within_7d</th>
<th>retention_rate</th>
<th>rolling_7d_users</th>
</tr>
</thead>

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

<tr>
<td>2024-06-02</td>
<td>1</td>
<td>1</td>
<td>100.0</td>
<td>2</td>
</tr>

<tr>
<td>2024-06-08</td>
<td>2</td>
<td>1</td>
<td>50.0</td>
<td>2</td>
</tr>

<tr>
<td>2024-06-09</td>
<td>1</td>
<td>0</td>
<td>0.0</td>
<td>2</td>
</tr>

<tr>
<td>2024-06-10</td>
<td>1</td>
<td>0</td>
<td>0.0</td>
<td>2</td>
</tr>
</tbody>
</table>
Explanation:

Retention is calculated for users who return within 7 days after their first login on a given day. Rolling 7-day user counts unique users over the current and previous 6 days.*

Suppose the current <code>login_date</code> is October 10, 2027.

<ul>
<li>The cohort for this date includes all users who logged in on 2027-10-10.</li>
<li>A user is considered retained if they log in again between 2027-10-11 and 2027-10-17 (inclusive).</li>
<li>The cohort day itself (2027-10-10) is excluded from this retention window.</li>
</ul>

How would you calculate daily user retention and rolling activity for Lime's app using login data?

Daily Retention Summary

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

Let’s say we work at a SaaS company, and last month we had 10,000 users sign up for a free trial. For each user, we have data on company size, industry, number of logins in the first week, and whether they invited teammates.

How would you approach segmenting these trial users for a nurture campaign? How many segments would you create, and what data points would drive your choices?

How would you design user segments for a SaaS trial nurture campaign and decide how many to create?

Trial User Segmentation

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>

Write a query to repeat each int_numbers value by its own value in the output

Sequentially Fill in Integers

Given a list of integers, write a function <code>gcd</code> to find the greatest common denominator between them.

Example:

Input:

<pre tabindex="0" class="chroma"><code>int_list = [8, 16, 24]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def gcd(int_list) -&gt; 8
</code></pre>

Which of the following is true about the greatest common division (gcd) between three integers a, b, and c?

Which of the following is true about the greatest common division (gcd) between three integers a, b, and c?

Greatest Common Denominator Properties

Write a function gcd to find the greatest common denominator of a list of integers

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

cādence Interview Questions

cādence Interview Guides

cādence Interview Questions

Challenge

cādence Salaries by Position

Discussion & Interview Experiences

Discussion & Interview Experiences