Recursion interview questions are some of the most common, but also some of the most challenging. Learn to solve the 12 most common recursion interview questions here.
Scared of dynamic programming? It’s because you don’t have a system. Let me show you my step by step system to solve any dynamic programming problem.
When you work on a new coding interview question, you should start with finding a brute force solution. But how do you even do that?
Dynamic programming is hard enough when you know that you need to use it for a problem. But what if you don’t even know a coding interview question is a dynamic programming problem to begin with?
Dynamic programming coding interview questions don’t have to be hard. Using the FAST method gives you a structured way to get the right answer every time.
Coding Interview Question: Given a list of items, find the maximum value you can generate from the items. Click for the solution.
Coding Interview Question: Given a matrix, find the path from top left to bottom right with the greatest product. Click for the solution.
Coding Interview Question: Given a 2D array of 1s and 0s, find the largest square subarray of all 1s. Click for the solution.
Coding Interview Question: Given an integer n, write a function to compute the nth Fibonacci number. Click for the solution.
Coding Interview Question: Given two strings, write a function that returns the longest common substring. Click for the solution.