Prepare for and practice interview questions from Wittenberg Weiner Consulting, Llc.

Wittenberg Weiner Consulting, Llc Interview Questions

Wittenberg Weiner Consulting, Llc 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 to return the names and resume IDs for resumes whose IDs have not already been scraped

New Resumes

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

Prime to N

Write a function move_zeros_back that moves all zeros in an array to the end

Move Zeros Back

Probability

What is the probability that each subsequent card is larger than the previous drawn card when picking three cards from a shuffled deck of 500 cards

500 Cards

First to Six

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

Raining in Seattle

What is the probability that item X would be found on Amazon's website?

Found Item

Given three uniform(0,4) random variables, what is the probability that the median of them is greater than 3?

Median Probability

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

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

Client Solution Pushback

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

Your Strengths and Weaknesses

Write a query to get the largest salary of any employee by department

Largest Salary by Department

Find the five employees with the hightest probability of leaving the company

Top 5 Turnover Risk

Write a query to get the cost of all transactions by user ordered by total cost descending

Total Transactions

Display the origin, destination, departure time, aircraft model, and capacity of a flight route.

Flight Routes

Machine Learning

How would you encode a categorical variable with thousands of distinct values

Encoding Categorical Features

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

Missing Housing Data

Explain the relationship between PCA and K-means clustering

PCA and K-Means

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?

Imagine a deck of 500 cards numbered from 1 to 500. If all the cards are shuffled randomly and you are asked to pick three cards, one at a time, what’s the probability of each subsequent card being larger than the previous drawn card?

Imagine a deck of 2000 cards numbered from 1 to 2000. If all the cards are shuffled randomly and you are asked to pick three cards, one at a time, what’s the probability of each subsequent card being larger than the previously drawn card?

Imagine a deck of 2000 cards numbered from 1 to 2000. If all the cards are shuffled randomly and you are asked to pick three cards, one at a time, what's the probability of each subsequent card being larger than the previously drawn card?

2000 cards

Let’s say you’re working in HR at a major tech company, and they ask you to find employees with a high probability of leaving the company. They tell you these employees perform well but have the lowest pay.

Given two tables, <code>employees</code> and <code>projects</code>, find the five lowest-paid employees who have completed at least three projects.

Note: We consider projects to be completed when they have an end date, which is the same as saying their <code>End_dt</code> is not <code>NULL</code>.

Example:

Input:

<code>employees</code> table

<table>
<thead>
<tr>
<th>id</th>
<th>salary</th>
</tr>
</thead>

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

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

<tbody>
<tr>
<td>INTEGER</td>
<td>INTEGER</td>
<td>DATETIME</td>
<td>DATETIME</td>
</tr>
</tbody>
</table>
Output:

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

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

Given an integer <code>N</code>, write a function that returns a list of all of the prime numbers up to <code>N</code>.

Note: Return an empty list there are no prime numbers less than or equal to <code>N</code>.

Example:

Input:

<pre tabindex="0" class="chroma"><code>N = 3
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def prime_numbers(N) -&gt; [2,3]
</code></pre>

Given a table called <code>employees</code>, get the largest salary of any employee by department

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

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

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

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

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

You have an array of integers, <code>nums</code> of length <code>n</code> spanning <code>0</code> to <code>n</code> with one missing. Write a function <code>missing_number</code> that returns the missing number in the array.

Note: Complexity of $O(n)$ required.

Example:

Input:

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

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

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

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

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

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

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

Impression Reach

Let’s say you have a categorical variable with thousands of distinct values, how would you encode it?

Which method can be used to extract communities from large networks, that does not require a pre-determined number of clusters like K-means?

Which method can be used to extract communities from large networks, that does not require a pre-determined number of clusters like K-means?

Netflix has hired people to rate movies.

Out of all of the raters, 80% of the raters carefully rate movies and rate 60% of the movies as good and 40% as bad. The other 20% are lazy raters and rate 100% of the movies as good.

Assuming all raters rate the same amount of movies, what is the probability that a movie is rated good?

There are two categories of movie raters: careful and lazy. Careful raters make up 80% of the total. They rate 60% of the movies as good and 40% as bad. Lazy raters, constitute 20% of the raters and 100% of the movies as good. Given these parameters, calculate the overall probability of a movie being rated good.

There are two categories of movie raters: careful and lazy. Careful raters make up 80% of the total. They rate 60% of the movies as good and 40% as bad. Lazy raters, constitute 20% of the raters and 100% of the movies as good. Given these parameters, calculate the overall probability of a movie being rated good.

Lazy Raters

What is the probability that a movie is rated good

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

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

Say we have a list of <code>existing_ids</code> that we have already scraped. Let’s say we also have two lists, one of <code>names</code> and another of <code>urls</code> that correspond to <code>names</code> with the id of the names in the <code>url</code>.

Write a function <code>new_resumes</code> to return the names and ids for ids that we haven’t scraped yet.

Example:

Input:

<pre tabindex="0" class="chroma"><code>existing_ids = [15234, 20485, 34536, 95342, 94857]

names = [&#39;Calvin&#39;, &#39;Jason&#39;, &#39;Cindy&#39;, &#39;Kevin&#39;]
urls = [
 &#39;domain.com/resume/15234&#39;, 
 &#39;domain.com/resume/23645&#39;, 
 &#39;domain.com/resume/64337&#39;, 
 &#39;domain.com/resume/34536&#39;,
]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def new_resumes(existing_ids,names,urls) -&gt;
output = [(&#39;Jason&#39;, 23645), (&#39;Cindy&#39;, 64337)]
</code></pre>

Write a query to get the cost of all transactions by user ordered by total cost descending.

Example:

Input:

<code>transactions</code> table

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

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

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

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

<tr>
<td><code>product_id</code></td>
<td>INTEGER</td>
</tr>

<tr>
<td><code>quantity</code></td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
<code>products</code> table

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

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

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

<tr>
<td><code>price</code></td>
<td>FLOAT</td>
</tr>
</tbody>
</table>
<code>users</code> table

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

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

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

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

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

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

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

<tr>
<td><code>total_cost</code></td>
<td>FLOAT</td>
</tr>
</tbody>
</table>
Note: Round the total cost to 2 decimal places.

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

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

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

Fair Coin

Amazon has a warehouse system where items on the website are located at different distribution centers across a city. Let’s say in one example city, the probability that a specific item X is available at warehouse A or warehouse B are 0.6 and 0.8 respectively.

Given that you’re a customer in this example city and the items are only found on the website if they exist in the distribution centers, what is the probability that the item X would be found on Amazon’s website?

Given a <code>ListNode</code> representing the head of a linked list, write a function <code>is_cyclic</code> which returns <code>True</code> if a linked list is cyclic and <code>False</code> if it is not. A linked list is cyclic when there is no tail to the linked list, and the supposed tail is attached to another node inside the list itself, creating a cycle.

A <code>ListNode</code> is defined as:

<pre tabindex="0" class="chroma"><code>class ListNode:
	value: ListNode = None
 next: ListNode = None
</code></pre>

Example:

Input:

<img src="/s3/questions/1a65651d-a483-4481-b073-2738d65ab9d7.png" alt="image"/>

Output:

<pre tabindex="0" class="chroma"><code>def is_cyclic(head) -&gt; True
</code></pre>

Cyclic Detection

<ol>
<li>A ride-sharing app has probability $p$ of dispensing a $5 coupon to a rider. The app services $N$ riders. How much should we budget for the coupon initiative in total?</li>
<li>A driver using the app picks up two passengers.</li>
</ol>

<ul>
<li>What is the probability of both riders getting the coupon?</li>
<li>What is the probability that only one of them will get the coupon?</li>
</ul>

Compute the total coupon budget for N riders and the probabilities that both or only one of two riders get the coupon

Ride Coupon

You’re working as a data analyst at Delta Airlines, and you’re provided with two tables: <code>flights</code> and <code>aircrafts</code>.

Write a SQL query to list all flights scheduled between Mumbai (<code>&#39;BOM&#39;</code>) and Delhi (<code>&#39;DEL&#39;</code>) that use an aircraft whose capacity is greater than the average capacity of all aircrafts in the database.

<h2>Schema:</h2>

Input Tables:

<h3><code>flights</code></h3>

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

<tbody>
<tr>
<td>flight_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>origin</td>
<td>VARCHAR</td>
</tr>

<tr>
<td>destination</td>
<td>VARCHAR</td>
</tr>

<tr>
<td>departure_time</td>
<td>DATETIME</td>
</tr>

<tr>
<td>arrival_time</td>
<td>DATETIME</td>
</tr>

<tr>
<td>aircraft_id</td>
<td>INTEGER</td>
</tr>
</tbody>
</table>

<h3><code>aircrafts</code></h3>

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

<tbody>
<tr>
<td>aircraft_id</td>
<td>INTEGER</td>
</tr>

<tr>
<td>model</td>
<td>VARCHAR</td>
</tr>

<tr>
<td>capacity</td>
<td>INTEGER</td>
</tr>
</tbody>
</table>
Output:

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

<tbody>
<tr>
<td>origin</td>
<td>VARCHAR</td>
</tr>

<tr>
<td>destination</td>
<td>VARCHAR</td>
</tr>

<tr>
<td>departure_time</td>
<td>DATETIME</td>
</tr>

<tr>
<td>aircraft_model</td>
<td>VARCHAR</td>
</tr>

<tr>
<td>capacity</td>
<td>INTEGER</td>
</tr>
</tbody>
</table>

<h2>Example:</h2>

Input Tables:

<h3><code>flights</code></h3>

<table>
<thead>
<tr>
<th>flight_id</th>
<th>origin</th>
<th>destination</th>
<th>departure_time</th>
<th>arrival_time</th>
<th>aircraft_id</th>
</tr>
</thead>

<tbody>
<tr>
<td>1</td>
<td>BOM</td>
<td>DEL</td>
<td>2025-11-19 08:00</td>
<td>2025-11-19 10:00</td>
<td>201</td>
</tr>

<tr>
<td>2</td>
<td>DEL</td>
<td>BLR</td>
<td>2025-11-19 11:00</td>
<td>2025-11-19 13:00</td>
<td>202</td>
</tr>
</tbody>
</table>

<h3><code>aircrafts</code></h3>

<table>
<thead>
<tr>
<th>aircraft_id</th>
<th>model</th>
<th>capacity</th>
</tr>
</thead>

<tbody>
<tr>
<td>201</td>
<td>A320</td>
<td>180</td>
</tr>

<tr>
<td>202</td>
<td>B737</td>
<td>160</td>
</tr>
</tbody>
</table>
Output:

<table>
<thead>
<tr>
<th>origin</th>
<th>destination</th>
<th>departure_time</th>
<th>aircraft_model</th>
<th>capacity</th>
</tr>
</thead>

<tbody>
<tr>
<td>BOM</td>
<td>DEL</td>
<td>2025-11-19 08:00</td>
<td>A320</td>
<td>180</td>
</tr>
</tbody>
</table>
Explanation:

The flight from BOM → DEL uses aircraft 201 with capacity 180, which is greater than the average capacity of all aircrafts. Hence, it is included in the output.

Let’s say that there are six people trying to divide up into two equally separate teams. Because they want to pick random teams, on each round, each person shows their hand in either a face-up or face-down position. If there are three of each position, then they’ll split into teams. 

What’s the expected number of rounds that everyone will have to pick a hand side before they split into teams?

What’s the expected number of rounds until three people show face-up and three show face-down?

Estimated Rounds

Given two strings, <code>string1</code> and <code>string2</code>, write a function <code>str_map</code> to determine if there exists a one-to-one correspondence (bijection) between the characters of <code>string1</code> and <code>string2</code>.

For the two strings, our correspondence must be between characters in the same position/index.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;qwe&#39;
string2 = &#39;asd&#39;

string_map(string1, string2) == True

# q = a, w = s, and e = d
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;donut&#39;
string2 = &#39;fatty&#39;

string_map(string1, string2) == False
# cannot map two distinct characters to two equal characters
</code></pre>

Example 3:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;enemy&#39;
string2 = &#39;enemy&#39;

string_map(string1, string2) == True
# there exists a one-to-one correspondence between equivalent strings
</code></pre>

Example 4:

Input:

<pre tabindex="0" class="chroma"><code>string1 = &#39;enemy&#39;
string2 = &#39;ymene&#39;

string_map(string1, string2) == False
# since our correspondence must be between characters of the same index, this case returns &#39;False&#39; as we must map e = y AND e = e
</code></pre>

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

String Mapping

You are given a dictionary with two keys <code>a</code> and <code>b</code> that hold integers as their values.

Without declaring any other variable, swap the value of <code>a</code> with the value of <code>b</code> and vice versa.

Note: Return the dictionary after editing it.

Example:

Input:

<pre tabindex="0" class="chroma"><code>numbers = {
 &#39;a&#39;:3,
 &#39;b&#39;:4
}
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def swap_values(numbers) -&gt; {&#39;a&#39;:4,&#39;b&#39;:3}
</code></pre>

Swap the values of `a` and `b` in the dictionary without declaring any other variable

Swap Variables

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.

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

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

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?

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

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?

Given two strings, write a function to return <code>True</code> if the strings are anagrams of each other and <code>False</code> if they are not.

Note: A word is not an anagram of itself.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>string_1 = &#34;listen&#34;
string_2 = &#34;silent&#34;
</code></pre>

Output:

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

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>string_1 = &#34;banana&#34;
string_2 = &#34;bandana&#34;
</code></pre>

Output:

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

Write a function to return True if two strings are anagrams of each other and False if they are not

Valid Anagram

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

Given a <code>JSON</code> string with nested objects, write a function <code>flatten_json</code> that flattens all the objects to a single key-value dictionary. Do not use the library that actually performs this function.

Example:

Input:

<pre tabindex="0" class="chroma"><code>import json
json_str = json.dumps({&#39;a&#39;:{&#39;b&#39;:&#39;c&#39;, &#39;d&#39;:&#39;e&#39;}})
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def flatten_json(json_str) -&gt; json.dumps({&#39;a_b&#39;:&#39;c&#39;, &#39;a_d&#39;:&#39;e&#39;})
</code></pre>

Note: Input and output are in <code>string</code> format : use <code>json.dumps()</code> to convert python dictionary to string.

Given a json string with nested objects, write a function that flattens all the objects to a single key-value dictionary.

Flatten JSON

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

We want to build a model to predict housing prices in the city of Seattle. We’ve scraped 100K sold listings over the past three years but found that around 20% of the listings are missing square footage data.

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

We want to build a model to predict housing prices in the city of Seattle. We’ve scraped 100K sold listings over the past three years, but have discovered that around 20% of the listings are missing square footage data.

How would you approach dealing with this missing data, in order to construct the most useful predictive model possible?

We want to build a model to predict housing prices in the city of Seattle. We’ve scraped 100K sold listings over the past three years, but have discovered that around 20% of the listings are missing square footage data.

How would you approach dealing with this missing data, in order to construct the most useful predictive model possible?



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

Wittenberg Weiner Consulting, Llc Interview Questions

Wittenberg Weiner Consulting, Llc Interview Guides

Wittenberg Weiner Consulting, Llc Interview Questions

Challenge

Discussion & Interview Experiences

Discussion & Interview Experiences