Leetcode 38: Count and SayLet’s solve a medium problem together on Leetcode.com: Count and SayMar 20, 2021Mar 20, 2021
How to flatten a binary tree to a linked list: recursion approachData structures such as binary trees, linked lists are frequently asked in a technical interview. Sometimes, interviewees are asked to…Mar 14, 2021Mar 14, 2021
Merge Sort a linked listSorting algorithms are frequently asked during a technical interview. Several common sorting algorithms such as quicksort, selection sort…Mar 4, 2021Mar 4, 2021
Max area of the island: dfs and bfs approachFor the given island that’s represented in a matrix of 0's and 1's, we usually use a depth-first search or a breadth-first search…Feb 19, 2021Feb 19, 2021
Solve the sliding window maximum problemThe sliding window algorithm is often used to find the target number in a string/list. Today, I’ll introduce how to solve this leetcode…Feb 12, 2021Feb 12, 2021
Implement a Trie in PythonWe know tree well, a binary search tree performs well in searching. Today, I’ll introduce another tree-like data structure, which is…Feb 5, 2021Feb 5, 2021
Crack the house robber problemMy previous post introduced the Knapsack problem. It states how to solve using the dynamic programming algorithm. Besides Knapsack…Jan 30, 2021Jan 30, 2021
Intro to dynamic programming knapsack problemsDynamic programming problems are frequently asked in a tech interview. For me, dynamic programming problems are challenging to understand…Jan 24, 2021Jan 24, 2021
Deal with subset, permutation, combination problems using backtracking algorithmIt’s often asked during a technical interview: write a function to get the subsets/combinations/permutations for a given set. These…Jan 17, 2021Jan 17, 2021
