I have conducted hundreds of interviews. I noticed very often, the candidate could successfully identify the problem by using a graph approach, but failed to implement the algorithm. In this post, I will discuss the common types of graph algorithms, along with their sample code. Standard DFS (pre-order and post-order) …

Binary Search is a very common algorithm to find a target value in a sorted list. The concept is easy to understand. However, the implementation can be confusing, especially with all the different scenarios: Binary search in a unique sorted list. Binary search in a sorted list with duplicates, and…

I have noticed that my followers and reading stats have been increasing rapidly since I started writing leetcode posts. I really appreciate the support and the interests from you guys! As a current senior software engineer without a degree in computer science, I have spent a lot of time learning…

Coding question asked in Google Interviews

Coding question asked in Google Interviews. ''' If the grid[i][j] == 1, then: horizontal: dp[i][j] = dp[i][j-1] + 1 vertical: dp[i][j] = dp[i-1][j] + 1 diag: dp[i][j] = dp[i-1][j-1] + 1 anti-diag: dp[i][j] = dp[i-1][j+1] + 1 ''' class Solution: def longestLine(self, mat: List[List[int]]) -> int…

Coding question asked in Google interviews.

Coding question asked in Amazon interviews.

Coding question asked in Meta and Amazon interviews.

Coding question asked in Meta and Amazon interviews.