Prepare for and practice interview questions from Ispace.

Ispace Interview Questions

Ispace Interview Guides

Data Structures & Algorithms

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

Merge Sorted Lists

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

Prime to N

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

Recurring Character

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

Scrambled Tickets

Write a function `sort_lists` to combine sorted integer lists into one sorted list without using libraries or `sort`/`sorted`

Merge N Sorted Lists

Machine Learning

How would we build a model to detect fraud and text customers to approve or deny fraudulent transactions

Bank Fraud Model

Rebalancing outcome probabilities for a classifier on imbalanced data.

Rebalance Probabilities

Lasso vs Ridge

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

Bagging vs Boosting

What kind of model did the co-worker develop, how would you measure the difference between the two credit risk models within a timeframe, and what metrics would you track to measure the success of the new model

Loan Model

Behavioral

Strategically resolving misaligned expectations with stakeholders for a successful project outcome

Stakeholder Communication

How to present complex data insights with clarity and adaptability tailored to a specific audience

Presentations and Insights

Describing a data project and its challenges

Hurdles In Data Projects

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

Client Solution Pushback

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

Why Do You Want to Work With Us

Analytics

How would you present the performance of each subscription to an executive?

Analyzing Churn Behavior

How would you approach improving the quality of airline data?

Addressing Data Quality Issues

Which metric should we use for late orders if the distribution is right-skewed and what does that tell us?

Late Orders

Let's say you work at Facebook and you're analyzing churn on the platform.

Retention Rate Disparity

You’re tasked with analyzing data from multiple sources, such as payment transactions, user behavior, and fraud detection logs. How would you approach solving a data analytics problem involving these diverse datasets? What steps would you take to clean, combine, and extract meaningful insights that could improve the system's performance?

Analyzing Multiple Data Sources

Statistics

Explain the difference between covariance and correlation and provide an example

Covariance vs Correlation

How would you tackle multicollinearity in multiple linear regression

Multicollinearity in Regression

What does it mean to "bootstrap" a data set?

Bootstrapping Samples

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>

Select the 2nd highest salary in the engineering department

2nd Highest Salary

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

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

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

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

Treat upper and lower case letters as distinct characters.

You may assume the input string includes no spaces.

Example 1:

Input:

<pre tabindex="0" class="chroma"><code>input = &#34;interviewquery&#34;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>output = &#34;i&#34;
</code></pre>

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>input = &#34;interv&#34;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>output = None
</code></pre>

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

Example:

For a trip from Bombay to Beijing:

Input:

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

Let’s say that you work at a bank that wants to build a model to detect fraud on the platform.

The bank wants to implement a text messaging service in addition that will text customers when the model detects a fraudulent transaction in order for the customer to approve or deny the transaction with a text response.

How would we build this model?

Let’s say that you work at a bank that wants to build a model to detect fraud on the platform.

The bank wants to implement a text messaging service that will text customers when the model detects a fraudulent transaction in order for the customer to approve or deny the transaction with a text response.

Which statement is true?

Let's say that you work at a bank that wants to build a model to detect fraud on the platform.

The bank wants to implement a text messaging service that will text customers when the model detects a fraudulent transaction in order for the customer to approve or deny the transaction with a text response.

Which statement is true?

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

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

Imagine you have been given an array of integers, and a query number <code>k</code>. Your task is to write a function that finds all the triplets in the array that sum up to the query number <code>k</code>.

Let’s illustrate this with some examples:

Example 1:

Input:

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

Output:

<pre tabindex="0" class="chroma"><code>count_triplets(nums, k) -&gt; 1
</code></pre>

In this case, there is only one triplet that sums up to 6: (1, 2, 3).

Example 2:

Input:

<pre tabindex="0" class="chroma"><code>nums = [10, 10, 20, 30, 40]
k = 60
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>count_triplets(nums, k) -&gt; 3
</code></pre>

In this case, there are three triplets that sum up to 60: (10, 10, 40), (10, 20, 30), and (10, 20, 30).
The value 10 can be retrieved as <code>nums[0]</code> or <code>nums[1]</code>, therefore resulting in two triplets with the same value.

Write a function that returns the number of triplets in the array that sum to `k`.

Triplet Counting

What is the difference between covariance and correlation? Provide an example.

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

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

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

Average Trees

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

Random Forest Explanation

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

Say you are given a text document in the form of a string with the following sentences:

Example:

Input:

<pre tabindex="0" class="chroma"><code>document = &#34;I have a nice car with a nice tires&#34;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>
{
&#34;I&#34;:0.11,
&#34;have&#34;:0.11,
&#34;a&#34;:0.22,
&#34;nice&#34;:0.22,
&#34;car&#34;: 0.11,
&#34;with&#34;:0.11,
&#34;tires&#34;:0.11
}
</code></pre>

Write a program in python to determine the TF (<code>term_frequency</code>) values for each term of this document.

Note: Round the term frequency to 2 decimal points.

Write a program in python to determine the TF values for each term of a document

Term Frequency

Priority queues are an abstract data structure responsible for allowing enqueuing items with an attached priority. While typically implemented with a heap, implement a priority queue using a linked list.

The Priority Queue implementation should support the following operations:

<ul>
<li><code>insert</code>(element, priority): This operation should be able to insert an element into the Priority Queue, along with its corresponding priority.</li>
<li><code>delete()</code>: This operation should remove and return the element with the highest priority. If multiple elements share the same highest priority, the element first enqueued should be returned. In the case that the queue is empty, return None.</li>
<li><code>peek()</code>: This operation should return the element with the highest priority without removing it from the Priority Queue. Again, in the case of equal highest priorities, the element first enqueued should be returned. In the case that the queue is empty, return None.</li>
</ul>

Note: Smaller priority values imply that they have higher priority.

<h3>Input</h3>

<pre tabindex="0" class="chroma"><code>queue.insert(2, 1)
queue.insert(3, 3)
</code></pre>

<h3>Output:</h3>

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

Implementing a priority queue used linked lists.

Priority Queue Using Linked List

What’s the difference between Lasso and Ridge Regression?

Under what circumstances is it recommended to use Lasso regression over Ridge regression?

Under what circumstances is it recommended to use Lasso regression over Ridge regression?

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

Let’s say you work for a bank that gives out personal loans. Your co-worker develops a model that takes in customer inputs and returns if a loan should be given or not.

<ol>
<li>What kind of model did the co-worker develop? 
</li>
<li>Another co-worker thinks they have developed a better model to predict defaults on the loans. Given that personal loans are monthly installments of payments, how would you measure the difference between the two credit risk models within a timeframe? 
</li>
<li>What metrics would you track to measure the success of the new model?</li>
</ol>

Given a list of sorted integer lists, write a function <code>sort_lists</code> to create a combined list while maintaining sorted order without importing any libraries or using the <code>&#39;sort&#39;</code> or <code>&#39;sorted&#39;</code> functions in Python.

Example:

Input:

<pre tabindex="0" class="chroma"><code>lists = [
[1,2,3,4,5,6],
[2,5,7,8],
[3,9,10,12],
[0,1,2,8]
]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def sort_lists(lists) -&gt; [0,1,1,2,2,3,3,4,5,5,6,7,8,8,9,10,12]
</code></pre>

Every night between 7 pm and midnight, two computing jobs from two different sources are randomly started with each one lasting an hour.

Unfortunately, when the jobs simultaneously run, they cause a failure in some of the company’s other nightly jobs, resulting in downtime for the company that costs $1000. 

The CEO, who has enough time today to hear one word, needs a single number representing the annual (365 days) cost of this problem.

Note: Write a function to simulate this problem and output an estimated cost 

Bonus - How would you solve this using probability?

Example:

Input:

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

Output:

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

Find how much overlapping jobs are costing the company

Nightly Job

Probability

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

Explain the key differences between classification models and regression models

Classification and Regression

You are given an array of strings <code>arr</code>, where each string is in the format: <code>&lt;letters&gt;&lt;number&gt;</code>. For example, you might see <code>&#34;a1&#34;</code>, <code>&#34;b32&#34;</code>, or <code>&#34;caba522&#34;</code>.

Write a function called <code>custom_sort(arr)</code>, which sorts the list of strings in two ways: first by the letter, in alphabetical order, and second by the numbers in descending order.

Note: The letters can only be lower case, and have length $≥1$.

Example:

Input:

<pre tabindex="0" class="chroma"><code>arr = [&#34;b12&#34;, &#34;a15&#34;, &#34;b7&#34;, &#34;a3&#34;, &#34;c4&#34;, &#34;c20&#34;]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>custom_sort(arr) -&gt; &#39;[&#34;a15&#34;, &#34;a3&#34;, &#34;b12&#34;, &#34;b7&#34;, &#34;c20&#34;, &#34;c4&#34;]&#39;
</code></pre>

Implement a merge sort on an array of alphanumeric strings, sorting by letters alphabetically and numbers in descending order

Descending Alphanumeric Sorting

Let’s say you’re a data engineer at Fidelity Investments, and you’re running a SQL query on a cloud-based data warehouse. All cluster resources and network health metrics look normal, but the query is still taking over 10 minutes to complete.

How would you go about diagnosing and improving the performance of this query?

How would you diagnose and speed up a slow SQL query when system metrics look healthy?

Slow SQL Query

Query Optimization

Let’s say you’re a senior data analyst and your team is tasked with addressing data quality issues for an airline company. Customer records, booking details, and flight schedules often have missing fields, duplicate entries, or incorrect data.

How would you approach improving the quality of this data and ensuring it remains clean and reliable over time?

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

Let’s say you’re working with a dataset of user-level events for a new product feature, and you notice issues like missing values, duplicate records, inconsistent data types, and some clear outliers. You need to prepare this data for training a machine learning model.

How would you design a data processing pipeline using Pandas and NumPy to clean and validate the data before modeling, and what steps would you take to ensure the pipeline is reusable and reliable for future use?

How would you build a reusable data cleaning pipeline for messy user event data?

User Event Data Pipeline

Data Pipelines

You work as a software engineer at Credit Karma. The team is tasked with building a backend API that retrieves and serves relevant financial product offers, such as credit cards, personal loans, and auto loans, based on user profiles.

When a user logs in, the API must fetch all available offers from multiple partner services, filter them using factors like credit score, and return only the most relevant auto loan offers if the user expresses interest.

How would you architect the API endpoints and backend logic to support this functionality?

Design a backend API for serving filtered, relevant financial offers based on user profiles.

Offer Matching API Design

Web Engineering

Let’s say we’ve built a neural network for image classification using NumPy, and we’re training it in a distributed environment with several workers. We notice that, even when using the same random seed, the loss curve looks erratic across different training runs, model weights diverge between workers, and training results aren’t consistent between single-node and distributed setups.

How would you go about diagnosing and resolving these distributed training inconsistencies to ensure stable and reproducible results?

How would you debug and fix inconsistencies in distributed NumPy neural network training?

Distributed Training Instability

Concurrent & Distributed Systems

Imagine you are asked to build a machine learning model to decide new loan approvals for a
financial firm. You ask the data department in the company for a subset of data to get started
working on the problem. The data includes different features about applicants such as age,
occupation, zip code, height, number of children, favorite color, etc. You decide to build
multiple machine learning models to test out different ideas before settling on the best one.

How would you explain the bias-variance tradeoff with regards to
building and choosing a model to use?

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

Ispace Interview Questions

Ispace Interview Guides

Ispace Interview Questions

Challenge

Ispace Salaries by Position

Discussion & Interview Experiences

Discussion & Interview Experiences