-
- [x] Binary Search
- [x] Quicksort
- [x] Merge Sort
- [ ] Suffix Array
- [ ] Knuth-Morris-Pratt Algorithm (KMP)
- [ ] Rabin-Karp Algorithm
- [ ] Tries
- [ ] Depth First Traversal of a graph
- […
-
**Edit distance**
-------------
This algorithm finds the minimum number of edits that are required to convert string1 to string2.
Edit here means either insert, remove or replace.
The algorith…
-
Hi,
If I understand the tree_search algorithm right, the dynamic programming process should be able to find the optimal number of generated tokens according to the acceptance-rate-vector. Also, giv…
-
* To learn about LCS, refer this [link](https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/)
* You are allowed to implement the algorithm in any language.
* Multiple submissions from a si…
-
Once we switch over to myst-nb / jupyter-book, the glue functionality will be idea for cross-lecture numerical comparisons involving solution methods for dynamic programming.
https://myst-nb.read…
jstac updated
3 years ago
-
https://10kshuaizhang.github.io/post/887-egg-drop/
问题
我们有k个鸡蛋,有n层楼需要测试,鸡蛋会刚好在某一层楼扔下摔碎。需要设计一个算法,用有限的鸡蛋找到测试n层楼至少需要的实验次数。鸡蛋在实验过程中没摔碎就可以继续用,碎了就碎了,总可用的鸡蛋数量减少一个。
解析
首先声明,这道题没想明白...
-
The Floyd-Warshall Algorithm is a dynamic programming algorithm used to find the shortest paths between all pairs of vertices in a weighted graph. It works by iteratively considering each vertex as an…
-
# Complete Java + DSA Bootcamp Syllabus
## NOTE
- All topics will contain problems from LeetCode Easy to Hard, explained in an easy-to-understand manner.
- Complete custom implementation of all D…
-
## Description:
Kadane's Algorithm is used to solve the maximum subarray problem, which aims to find the contiguous subarray within a one-dimensional array of numbers that has the largest sum. It's a…
-
### How to do this 👇
1. Go to CONTRIBUTING.md and read how to contribute on a repository if you are a new to Github. Also read the README.md.
2. Comment below this Issue, to assign you as assignee…