Single-Pointer DP Problems
Dynamic programming(DP) problems that typically use one pointer. E.g., Integer[] memo
.
Dynamic programming(DP) problems that typically use one pointer. E.g., Integer[] memo
.
Problems like "given an 2D binary grid grid
which represents a map of land and water, return the number of islands, an island is XXXX".
Ref: labuladong 题解
Dynamic programming(DP) problems that typically use two pointers. E.g., Integer[][] memo
.
牙齿健康的常识, 以及常见牙科手术的说明, 包括补牙(Tooth filling), 拔智齿(Wisdom Teeth Extraction), 根管治疗(Root canal therapy).
In this tutorial, we will guide you through the steps required to to install Linux(e.g., Ubuntu, Archlinux, Manjaro,...) on your Laptop or PC.
How to create the installation media, which is used to install Linux on your machine, with corresponding tools.
The demons had captured the princess and imprisoned her in the bottom-right corner of a dungeon
. The dungeon
consists of m x n
rooms laid out in a 2D grid. Our valiant knight was initially positioned in the top-left room and must fight his way through dungeon
to rescue the princess.
Ref: Daniel J. Velleman. (2019). HOW TO PROVE IT (3th ed., pp. 1-6). Cambridge University Press.
Given an integer n
, return the number of trailing zeroes in n!
.
Note that n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1
.
172. Factorial Trailing Zeroes
Ref: labuladong 题解