DFS is a searching algorithm that would go as far as possible before backtracking, and Dynamic Programming, referring to *GeeksforGeeks*, is an algorithmic paradigm that solves a given complex problem by breaking it into subproblems and stores the results of subproblems to avoid computing the same results again. What are connections do they share? Let me uncover this by a Leetcode problem: 494. Target Sum.

## [Leetcode Problems]240. Search a 2D Matrix II

Write an efficient algorithm that searches for a value in anContinue reading “[Leetcode Problems]240. Search a 2D Matrix II”mxnmatrix. This matrix has the following properties: Integers in each row are sorted in ascending from left to right. Integers in each column are sorted in ascending from top to bottom.Example:Consider the following matrix: [ [1, 4, 7, 11, 15], [2, 5, 8, 12, 19], [3, 6, 9, 16, 22], [10, 13, 14, 17, 24], [18, 21, 23, 26, 30] ] Given target =`5`

, return`true`

. Given target =`20`

, return`false`

.

## Visualized! Intro to 7 Sorting Algorithms and their complexity analysis

After we introduced Graph Algorithm: Topological Sort, let’s now take a time to learn some more general and commonly used sorting algorithms! Actually, if you take a look at *Introduction to Algorithms*, you will find that sorting is the first algorithm you will learn! Time complexities of them will be appended at the end.