CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-05-02 06:21:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

seo: fix page has links to redirect (#708)

Browse Source 
Co-authored-by: Yangshun Tay <tay.yang.shun@gmail.com>
This commit is contained in:
Zhou Yuhang
2025-07-09 11:20:10 +08:00
committed by GitHub
parent ea9d14a658
commit 5cba1c5550
36 changed files with 183 additions and 184 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
apps/website/contents/algorithms/array.md
View File

@@ -102,7 +102,7 @@ Can you sort the array? Sometimes sorting the array first may significantly simp
### Precomputation
For questions where summation or multiplication of a subarray is involved, pre-computation using hashing or a prefix/suffix sum/product might be useful. Examples: [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/), [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/), [LeetCode questions tagged "prefix-sum"](https://leetcode.com/tag/prefix-sum/)
For questions where summation or multiplication of a subarray is involved, pre-computation using hashing or a prefix/suffix sum/product might be useful. Examples: [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/), [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/), [LeetCode questions tagged "prefix-sum"](https://leetcode.com/problem-list/prefix-sum/)
### Index as a hash key