Prepare for and practice interview questions from CoreLogic across topics like SQL, Python, Algorithms and more.

CoreLogic Interview Questions

CoreLogic Interview Guides

Data Structures & Algorithms

Given a list of strings, write a Python program to check whether each string has all the same characters or not.

Same Characters

Valid Anagram

Closest Key

Tower of Hanoi

Brainteasers

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

Your Strengths and Weaknesses

Statistics

What are the assumptions of linear regression?

Assumptions of Linear Regression

Machine Learning

Type-ahead Search

Data Modeling

Music Database

When an interviewer asks a question along the lines of:

<ul>
<li>What would your current manager say about you? What constructive criticisms might he give?</li>
<li>What are your three biggest strengths and weaknesses you have identified in yourself?</li>
</ul>

How would you respond?

When asked about your strengths in an interview, what is an effective way to respond?

When asked about your strengths in an interview, what is an effective way to respond?

Your Strengths and Weaknesses I

Which of the following is an acceptable strategy when discussing weaknesses in an interview?

Which of the following is an acceptable strategy when discussing weaknesses in an interview?

Your Strengths and Weaknesses II

What are the assumptions of linear regression?

Which assumption of the residuals of the standard linear regression model can not be overcome by increasing the sample size?

Regression assumptions

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>

How would you build the recommendation algorithm for type-ahead search for Netflix?

Let’s say you work at Spotify.

We want to design a relational database for storing metadata about songs.

We want to include metadata like song title, song length, the date the song was added to the platform, artist, album, track number (on the album), the song’s release year, and its genre.

How would you go about designing this database?

Given a list of strings, write a Python program to check whether each string has all the same characters or not. What is the complexity of this program?

<h3>Example</h3>

Input:

<pre tabindex="0" class="chroma"><code>string_list = [&#39;bbbbb&#39;, &#39;abc&#39;, &#39;aaaaaaaab&#39;]
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>def same_characters(input_list) -&gt; False
</code></pre>

Explanation:

<ul>
<li><code>string bbbbb</code> has all the same characters 
</li>
<li><code>string abc</code> does not have all the same characters 
</li>
<li><code>string aaaaaaaab</code> does not have all the same characters</li>
</ul>

Tower of Hanoi is a fun puzzle game that consists of a set of <code>3</code> pegs (<code>A</code>, <code>B</code>, <code>C</code>) and <code>n</code> number of disks. You are required to move all disks from the source peg <code>A</code> to destination peg <code>C</code>, under the following conditions:

<ul>
<li>You can only move one disk for each action.</li>
<li>You can only move the disk onto the top of another peg; you cannot place it off to the side or under existing disks.</li>
<li>You cannot place a larger disk onto a smaller disk.</li>
</ul>

Initially, all disks are on the source <code>A</code> peg and sorted by decreasing width from bottom to the top (widest on the bottom, smallest on the top).

You must develop an algorithm to move all disks from <code>A</code> to the destination peg <code>C</code> with the optimal solution. Also, return every step made from the starting state to the final state.

<img src="https://i.ibb.co/my0Vm13/initail.png" alt="alt"/>

<img src="https://i.ibb.co/0Ftzs7D/final.png" alt="alt"/>

Example

Input:

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

Output:

<pre tabindex="0" class="chroma"><code>#return list of {&#34;A&#34;:[],&#34;B&#34;:[],&#34;C&#34;:[]} 
tower_of_hanoi_solver(n) -&gt; [
 {&#34;A&#34;: [1, 2, 3], &#34;B&#34;: [], &#34;C&#34;: []},
 {&#34;A&#34;: [2, 3], &#34;B&#34;: [], &#34;C&#34;: [1]},
 {&#34;A&#34;: [3], &#34;B&#34;: [2], &#34;C&#34;: [1]},
 {&#34;A&#34;: [3], &#34;B&#34;: [1, 2], &#34;C&#34;: []},
 {&#34;A&#34;: [], &#34;B&#34;: [1, 2], &#34;C&#34;: [3]},
 {&#34;A&#34;: [1], &#34;B&#34;: [2], &#34;C&#34;: [3]},
 {&#34;A&#34;: [1], &#34;B&#34;: [], &#34;C&#34;: [2, 3]},
 {&#34;A&#34;: [], &#34;B&#34;: [], &#34;C&#34;: [1, 2, 3]}
 ]
</code></pre>

What is the minimal number of steps needed to solve the Tower of Hanoi problem with n disks?

What is the minimal number of steps needed to solve the Tower of Hanoi problem with *n* disks?

Linear Data Structures

Given a dictionary with keys of letters and values of a list of letters, write a function <code>closest_key</code> to find the key with the input value closest to the beginning of the list.

Example:

Input:

<pre tabindex="0" class="chroma"><code>dictionary = {
 &#39;a&#39; : [&#39;b&#39;,&#39;c&#39;,&#39;e&#39;],
 &#39;m&#39; : [&#39;c&#39;,&#39;e&#39;],
}
input = &#39;c&#39;
</code></pre>

Output:

<pre tabindex="0" class="chroma"><code>closest_key(dictionary, input) -&gt; &#39;m&#39;
</code></pre>

\(c\) is at distance 1 from \(a\) and 0 from \(m\). Hence closest key for \(c\) is \(m\).

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

CoreLogic Interview Questions

CoreLogic Interview Guides

CoreLogic Interview Questions

Challenge

CoreLogic Salaries by Position

Discussion & Interview Experiences

Discussion & Interview Experiences