Prepare for and practice interview questions from Argonne National Laboratory across topics like Algorithms, Python, Statistics and more.

Argonne National Laboratory Interview Questions

Argonne National Laboratory 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

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

One Element Removed

Transform a dataframe containing a list of user IDs and their full names into one that contains only the user ids and the first name of each user.

First Names Only

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

A/B Testing

Button AB Test

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

Network Experiment Design

How would you analyze the effectiveness of this new feature?

Green Dot

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

Testing Price Increase

Precisely ascertain whether the outcomes of an A/B test, executed to assess the impact of a landing page redesign, exhibit statistical significance.

Statistically Significant Test

Machine Learning

What are the logistic and softmax functions? What is the difference between the two?

Softmax vs Logistic

How would you build a model to detect if a post on a marketplace is talking about selling a gun?

Detecting Firearm Sales

Explain the key differences between classification models and regression models

Classification and Regression

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

Generating Discover Weekly

Implement the k-means clustering algorithm in python from scratch

k-Means from Scratch

Business Case

How would you decide whether Google should build a game feature for Google Home

Game Feature Home

How to boost presence in high-demand city areas

Incentive Scheme

How would you create a policy for refunds with regards to balancing customer sentiment and goodwill versus revenue tradeoffs?

Food Delivery Refund Policy

What kind of model would be best to allocate the correct number of agents, and what metrics would you check?

Call Center Resource Management

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

How would you answer when an Interviewer asks why you applied to their company?

Why Do You Want to Work With Us

What do you tell an interviewer when they ask you what your strengths and weaknesses are?

Your Strengths and Weaknesses

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

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

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

How would you set up this test?

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

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

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

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

A/B Test Variants

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

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

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

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

Example:

Input:

<code>employees</code> table

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Over-Budget Projects

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>

Say you are tasked with designing a data mart or data warehouse for a new online retailer.

How would you design the system?

Note: Sketch a star schema to explain your design.

Design a data warehouse for a new online retailer

Retailer Data Warehouse

Data Modeling

Let’s say you work in air traffic control. You are given the table below containing information on flights between two cities.

Write a query to find out how much time, in minutes (rounded down), each plane spent in the air each day.

Note: Both cities are in the same time zone, so you do not need to worry about converting time zones.

<code>flights</code> table

Example:

Input:

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

<tr>
<td><code>source_location</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>plane_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>flight_start</code></td>
<td>DATETIME</td>
</tr>

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

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

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

<tr>
<td><code>calendar_day</code></td>
<td>VARCHAR</td>
</tr>

<tr>
<td><code>time_in_min</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
Please give <code>calendar_day</code> in the format <code>YYYY-MM-DD</code>

Write a query to find how much time each plane spent in the air each day in minutes rounded down

Total Time in Flight

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

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

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

Example:

Input:

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

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

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

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

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

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

Efficiently Identifying Missing Integer

Let’s say you are designing a marketplace for your website.

Selling firearms is prohibited by your website’s Terms of Service Agreement (not to mention the laws of your country). To this end, you want to create a system that can automatically detect if a listing on the marketplace is selling a gun.

How would you go about doing this?

While designing a system to detect firearms listings on a marketplace website, what metrics could be used to minimize both false positives and false negatives?

While designing a system to detect firearms listings on a marketplace website, what metrics could be used to minimize both false positives and false negatives?

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

You work at a ride-sharing company and are given a table containing information about the rides of users.

Write a query to get the duration (in minutes) of each ride longer than two hours. Sort the results by duration in descending order.

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

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

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

<tr>
<td><code>distance</code></td>
<td>FLOAT</td>
</tr>

<tr>
<td><code>ride_region</code></td>
<td>VARCHAR</td>
</tr>

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

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

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

Write a query to get the duration in minutes of each ride longer than two hours, sorted descending

Time Difference

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

<ul>
<li><code>data</code>: integer value stored in the node</li>
<li><code>left</code>: reference to the left child (or <code>None</code>)</li>
<li><code>right</code>: reference to the right child (or <code>None</code>)</li>
</ul>

<pre tabindex="0" class="chroma"><code>node = {
 &#34;data&#34;: 6,
 &#34;left&#34;: {
 &#34;data&#34;: 3,
 &#34;left&#34;: {...},
 &#34;right&#34;: {...}
 },
 &#34;right&#34;: {
 &#34;data&#34;: 9,
 &#34;left&#34;: {...},
 &#34;right&#34;: {...}
 }
}
</code></pre>

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

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

Example:

Input:

<pre tabindex="0" class="chroma"><code># Diagram of the binary tree
&#39;&#39;&#39;
 6 
 / \ 
 3 9 
 / \
 2 11
 / \
 5 8
&#39;&#39;&#39;
value1 = 8
value2 = 2
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>common_ancestor(root,value1,value2) -&gt; 3
</code></pre>

Explanation:

<ul>
<li>Ancestors of <code>8</code>: <code>11 → 3 → 6</code></li>
<li>Ancestors of <code>2</code>: <code>3 → 6</code></li>
<li>Common ancestors: <code>3</code> and <code>6</code></li>
<li>The nearest common ancestor is <code>3</code>.</li>
</ul>

Write a function to return the value of the nearest node that is a parent to both nodes.

Nearest Common Ancestor

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

Example 1:

Input:

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

Output:

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

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

Example 2:

Input:

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

Output:

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

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

Example 3:

Input:

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

Output:

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

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

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

Find Duplicate Numbers in a List

Suppose there exists a new airline named Jetco that flies domestically across North America. Jetco recently had a study commissioned that tested the boarding time of every airline, and it came out that Jetco had the fastest average boarding times of any airline.

What factors could have biased this result, and what would you look into?

What could potentially bias the average boarding time in favor of an airline that only flies domestically?

What could potentially bias the average boarding time in favor of an airline that only flies domestically?

Boarding Times Bias

A new airline came out as the fastest average boarding times compared to other airlines.  What factors could have biased this result and what would you look into?

Statistics

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 a table of <code>cars</code> with columns <code>id</code> and <code>make</code>, write a query that outputs a random manufacturer’s name with an equal probability of selecting any name.

Input:

<code>cars</code> table

<table>
<thead>
<tr>
<th><code>id</code></th>
<th><code>make</code></th>
</tr>
</thead>

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

<tr>
<td>2</td>
<td>Toyota</td>
</tr>

<tr>
<td>3</td>
<td>Toyota</td>
</tr>

<tr>
<td>4</td>
<td>Honda</td>
</tr>

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

<tr>
<td>6</td>
<td>Honda</td>
</tr>
</tbody>
</table>
Output:

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

<tbody>
<tr>
<td><code>make</code></td>
<td>Text</td>
</tr>
</tbody>
</table>

Write a query that outputs a random manufacturer's name with an equal probability of selecting any name.

Uniform Car Maker

Let’s say you’re a data scientist at LinkedIn where you’re working on a product that sends qualified job candidates to companies. The team has launched a new feature that allows candidates to message hiring managers at companies directly during the interview process to get updates on their status.

Due to engineering constraints, the company can’t AB test the feature before launching it.

How would you analyze how the feature is performing?

How would you analyze the performance of a new LinkedIn feature that lets candidates message hiring managers during the interview process

Recruiting Leads

Analytics

You are required to extract a specific word <code>target_word</code> from an encrypted document. Fortunately, you have the basic information needed to decrypt that document.

The equation used to encrypt the document is as follows:

\[E_n(x) = (I(\mathsf{s}) + n) \mod 26 \]

Where:

<ul>
<li>\(\mathsf{s}\) is a letter</li>
<li>\(I(x) \) is the number representing the position of the letter in the alphabet (1 for <code>A</code>, 2 for <code>B</code>, etc.)</li>
<li>\(n \) is an arbitrary integer.</li>
<li>\(E_n(x) \) is the encrypted letter.</li>
</ul>

Return the number of occurrences of <code>target_word</code> in the document after decryption.

Note: The document only has upper case letters and spaces.

Example:

Input:

<pre tabindex="0" class="chroma"><code>encrypted_document = &#39;WKH TXLFN EURZQ IRA MXPSV RYHU WKH ODCB GRJ&#39;
n = 3
target_word = &#39;BROWN&#39;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>extract_word(encrypted_document,n,target_word) -&gt; 1
</code></pre>

Explanation:

After decrypting the document, you will have :

<pre tabindex="0" class="chroma"><code>THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG
</code></pre>

In which the <code>target_word</code> (BROWN) appears only once.

Return the number of occurrences of `target_word` in the decrypted document

Words in Encrypted String

Design a database to represent a Tinder style dating app. 

What does the schema look like and what are some optimizations that you think we might need?

Let’s say you are making a swiping app, similar to Tinder.

What would be the most efficient way (in terms of retrieval time) to store which users have swiped on each other on a database backend?

Let's say you are making a swiping app, similar to Tinder.

What would be the most efficient way (in terms of retrieval time) to store which users have swiped on each other on a database backend?

Swipes Database Design

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

Swiping App Design

Let’s say that you work at a B2B SAAS company that’s interested in testing the pricing of different levels of subscriptions.

Your project manager comes to you and asks you to run a two-week-long A/B test to test an increase in pricing.

How would you approach designing this test? How would you determine whether the increase in pricing is a good business decision?

You are given a <code>string</code> that represents some floating-point number. Write a function, <code>digit_accumulator</code>, that returns the sum of every digit in the <code>string</code>.

Example:

Input:

<pre tabindex="0" class="chroma"><code>s = &#34;123.0045&#34;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def digit_accumulator(s) -&gt; 15

Since 
1 + 2 + 3 + 0 + 0 + 4 + 5 = 15
</code></pre>

Write a function digit_accumulator that returns the sum of every digit in a string

Digit Accumulator

What are the key differences between classification models and regression models?

What is the MOST important difference between regression and classification models?

What is the MOST important difference between regression and classification models?

Classification vs Regression

You’re a data analyst at a global CPG distributor that tracks daily stock availability across ~80 countries for the brands in its portfolio. The operations team wants to triage which brands are exposed to systemic supply-chain risk, which have only localized issues, and which are running clean so they know where to spend investigative cycles.

You have access to a daily inventory table:

<code>inventory_status</code>

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

<tbody>
<tr>
<td><code>date</code></td>
<td>DATE</td>
<td>The day the snapshot was taken</td>
</tr>

<tr>
<td><code>country</code></td>
<td>VARCHAR</td>
<td>ISO country code where stock is held</td>
</tr>

<tr>
<td><code>company</code></td>
<td>VARCHAR</td>
<td>Brand in the portfolio</td>
</tr>

<tr>
<td><code>product</code></td>
<td>VARCHAR</td>
<td>SKU identifier</td>
</tr>

<tr>
<td><code>is_out_of_stock</code></td>
<td>BOOLEAN</td>
<td><code>TRUE</code> if the SKU was out of stock at any point that day in that country</td>
</tr>
</tbody>
</table>
Over the trailing 30 days, every company in the portfolio falls into one of three buckets:

<ol>
<li>Resilient — no stock-outs anywhere.</li>
<li>Localized risk — stock-outs occurred, but only ever within a single country.</li>
<li>Systemic risk — stock-outs occurred across multiple countries.</li>
</ol>

Given this bucket distribution, propose three business hypotheses the operations team should investigate to act on these results. For each hypothesis:

<ul>
<li>State the mechanism you think is driving the pattern.</li>
<li>Describe the follow-up analysis that would confirm or kill it.</li>
</ul>

Classify companies as resilient, localized, or systemic stock-out risk, then propose three falsifiable hypotheses explaining the distribution

Out of Stock Inventory

Product Sense & Metrics

What are the logistic and softmax functions? What is the difference between the two?

What makes them useful for use in logistic regression?

In logistic regression, how is the predicted class determined based on the logistic function?

In logistic regression, how is the predicted class determined based on the logistic function?

Softmax vs Logistic II

What is the key characteristic of the logistic function that makes it useful for mapping continuous values to a probability?

What is the key characteristic of the logistic function that makes it useful for mapping continuous values to a probability?

Softmax vs Logistic I

A robot has been designed to navigate a two-dimensional 4x4 matrix by only moving forward or turning right when blocked by a wall of the matrix. Its starting position is in the top left corner of the matrix, denoted by (0,0), and the robot’s final destination is the bottom right corner.

Determine the full path of the robot before it hits the final destination or starts repeating the path.

The ‘walls’ of the matrix are either one of the four borders of the map or any block found within.

A ‘Block’ is donated by having 1 in the cell corresponding to it where an empty cell is having ‘0’.

Example 1:

<pre tabindex="0" class="chroma"><code>#Input
robot_map = [
 [0,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,0]]

#Output
robot_path(robot_map) -&gt; [(0,0),(0,1),(0,2),(0,3),(1,3),(2,3),(3,3)]
</code></pre>

As seen in these diagrams, the robot’s path starts with this sequence of steps:

<ol>
<li>Goes forward three times and hits the wall. Turns right.</li>
<li>Goes forward three times (orientation has changed), 3. Reaches the final destination, and stops.</li>
</ol>

<img src="/s3/questions/a251a8da-2906-40de-9fe8-7f15f367fa34.png" alt="image"/>

Example 2:

<pre tabindex="0" class="chroma"><code>#Input
robot_map = [
 [0,0,1,0],[0,0,0,0],[0,1,0,0],[0,0,0,0]]

#Output
robot_path(robot_map) -&gt; [(0,0),(0,1),(1,1),(1,0)]

</code></pre>

Here, the robot moves forward one space, but hits the wall. After turning right, another wall is hit, starting a loop.

<img src="/s3/questions/34e81379-4514-472c-84a0-f31a4721f5b5.png" alt="image"/>

Determine the full path of the robot before it hits the final destination or starts repeating the path.

Walking Robot

The Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1. It is often used in algorithm examples, and is defined by the following formula: F(n) = F(n-1) + F(n-2), with F(0) = 0 and F(1) = 1.

Your task is to implement the Fibonacci algorithm in three different methods:
1. Recursively
2. Iteratively
3. Using Memoization

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>n = 5
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>fibonacci(n) -&gt; 5
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>n = 10
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>fibonacci(n) -&gt; 55
</code></pre>

The Fibonacci sequence starts as follows: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55…

This question requires the implementation of the Fibonacci sequence using three different methods: recursively, iteratively, and using memoization.

Implementing the Fibonacci Sequence in Three Different Methods

You’re given a dataframe containing a list of user IDs and their full names (e.g. ‘James Emerson’).

Transform this dataframe into a dataframe that contains the user ids and only the first name of each user.

Example:

Input:

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

<tbody>
<tr>
<td>1034</td>
<td>James Emerson</td>
</tr>

<tr>
<td>9430</td>
<td>Fiona Woodward</td>
</tr>

<tr>
<td>7281</td>
<td>Alvin Gross</td>
</tr>

<tr>
<td>5264</td>
<td>Deborah Handler</td>
</tr>

<tr>
<td>8995</td>
<td>Leah Xue</td>
</tr>
</tbody>
</table>
Output:

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

<tbody>
<tr>
<td>1034</td>
<td>James</td>
</tr>

<tr>
<td>9430</td>
<td>Fiona</td>
</tr>

<tr>
<td>7281</td>
<td>Alvin</td>
</tr>

<tr>
<td>5264</td>
<td>Deborah</td>
</tr>

<tr>
<td>8995</td>
<td>Leah</td>
</tr>
</tbody>
</table>

How would you handle the data preparation for building a machine learning model using imbalanced data?

Addressing imbalanced data in machine learning through carefully prepared techniques.

Data Preparation for Imbalanced Data

Given a list of integers, write a function that returns the maximum number in the list. If the list is empty, return <code>None</code>.

Example 1:

Input:

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

Output:

<pre tabindex="0" class="chroma"><code>find_max(nums) -&gt; 7
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>nums = []
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>find_max(nums) -&gt; None
</code></pre>

The task is to write a function that takes a list of integers as input and returns the maximum number in the list. If the list is empty, the function should return `None`.

Question	Topic	Difficulty
Merge Sorted Lists	Data Structures & Algorithms	Easy
Given two sorted lists, write a function to merge them into one sorted list. Bonus: What’s the time complexity? Example: Input: `list1 = [1,2,5] list2 = [2,4,6]` Output: `def merge_list(list1,list2) -> [1,2,2,4,5,6]` View Question Show Solution
Button AB Test	A/B Testing	Easy
Over-Budget Projects	SQL	Medium

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

Argonne National Laboratory Interview Questions

Argonne National Laboratory Interview Guides

Argonne National Laboratory Interview Questions

Challenge

Discussion & Interview Experiences

Discussion & Interview Experiences