-
# Troubleshooting: clangd
## Version
- LSP: 1.27.0
- Sublime Text: 4169
## Server Test Run
- exit code: 0
- output
```
I[16:43:03.915] Apple clangd version 15.0.0 (clang-1500.1.0.2.5)
I[1…
-
| | |
| --- | --- |
| Bugzilla Link | [31017](https://llvm.org/bz31017) |
| Version | 3.9 |
| OS | Linux |
| CC | @devincoughlin,@ppenzin,@rnk,@frobtech |
## Extended Description
mkdir scan-build
…
-
When press ctrl+shift+p, select `LeetCode Debugger: Start Debugging` and run, no reaction. It does not generate any files in current directory, I have set `delete temporay files` to false.
-
# 要求
每周至少完成给定题目中的两道算法题
围绕每周重点学习的算法知识点，撰写一篇有观点和思考的技术文章（字数不限）
# 注意事项
下面列出的题目中，按照知识点进行了简单分类，但并不意味着使用相应的数据结构或算法一定是解决该题目的最优解，这样分类只是为了方便大家有针对性的练习；
有的题目可能需要结合多个算法或数据结构进行求解。
# 第四周题目
## Trie树
…
-
Question:
Problem see here : https://leetcode.com/explore/learn/card/queue-stack/231/practical-application-queue/1375
**leave the hole:**
use the BFS, initial ideas:
1. initial state '0000'，as roo…
-
## DP（分治 + 最优子结构）
本质上来说，是找最近最简方法，利用数学归纳法的思维，将问题拆解为可重复解决的子问题，寻找其最优子结构。
### 1. 格外需要注意的技巧
- 利用缓存（状态的存储数组）剪枝
- 淘汰次优解
### 2. 实现方式
- 自顶向下：递归 + 记忆化搜索
- 自底向上：循环递推
### 3. DP关键点
- 最优子结构 `…
-
Hey, awesome package!
I wanted to ask how one could use this for on-device realtime description with microphone audio, similar to the [objc example](https://github.com/ggerganov/whisper.cpp/tree/c3…
-
Add competitive programming questions and solutions in Task 1 folder here: https://github.com/chandrikadeb7/Hacktoberfest_2020/tree/main/Task%201
Platforms can be HackerEarth, Codechef, Hackerrank,…
-
Given a positive integer _n_ and you can do operations as follow:
1. If _n_ is even, replace _n_ with ` _n_ /2`.
2. If _n_ is odd, you can replace _n_ with either ` _n_ + 1` or `…
-
- Add a Competitive Programming Algorithm other than the mentioned in the repository.
- Please do not copy from the internet and paste it here.
- Please try to implement on your own.
- Try to ad…