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.
Continue reading “Depth-First-Search(DFS) vs Dynamic Programming(DP)”[Leetcode Problems]240. Search a 2D Matrix II
Write an efficient algorithm that searches for a value in an m x n matrix. 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 =Continue reading “[Leetcode Problems]240. Search a 2D Matrix II”5, returntrue. Given target =20, returnfalse.
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.
Continue reading “Visualized! Intro to 7 Sorting Algorithms and their complexity analysis”Graph Algorithm: Topological Sort
When we are scheduling jobs or tasks, they may have dependencies, i.e., before we finish task a, we have to finish b first. In this case, given a set of tasks and their dependencies, how shall we arrange our schedules? There comes another graph algorithm: Topological Sort.
Continue reading “Graph Algorithm: Topological Sort”[Leetcode for Interviews]DFS, BFS, and Backtracking II – How to backtrack? Detailed Explanations with Examples
Backtracking is a general algorithm … that incrementally builds candidates to the solutions, and abandons a candidate (“backtracks”) as soon as it determines that the candidate cannot possibly be completed to a valid solution.
https://en.wikipedia.org/wiki/Backtracking
Note: This is the second part for BFS, DFS and Backtracking. The first part is here: [Leetcode for Interview]DFS, BFS, and Backtracking I.
What is backtracking?
Continue reading “[Leetcode for Interviews]DFS, BFS, and Backtracking II – How to backtrack? Detailed Explanations with Examples”[Leetcode for Interviews]DFS, BFS, and Backtracking I
After Intro to Graph Algorithms – BFS & DFS, let’s take a look at some popular and most common interview questions. Questions that fall under this category are quite typical and static, so it’s not difficult to master them if you go through the following lists, and then you will find patterns in their solutions.
Continue reading “[Leetcode for Interviews]DFS, BFS, and Backtracking I”Intro to Graph Algorithms – BFS & DFS
Graphs are a pervasive data structure in computer science, and algorithms for working with them are fundamental to the field.
Cormen, Thomas H., et al. Introduction to algorithms. MIT press, 2009.
Given a graph defined as G=(V,E) which is a set of vertices and edges, we’d be curious about how to represent it and how to search it systematically so as to visit the vertices following the edges. This blog will briefly introduce two ways of representations of a graph, and then will dive deep into two graph search algorithms: Breadth-First-Search (BFS) and Depth-First-Search (DFS).
Continue reading “Intro to Graph Algorithms – BFS & DFS”[Leetcode]1008. Construct Binary Search Tree from Preorder Traversal
Question: Given a preorder traversal, reconstruct the binary search tree and return the root. Input:Continue reading “[Leetcode]1008. Construct Binary Search Tree from Preorder Traversal”[8,5,1,7,10,12]Output:[8,5,10,1,7,null,12]Visiualization of the output: