There are some interesting algorithms in simulation from Physics, Chemistry, and Engineering especially regarding Monte Carlo simulation: Heat Bath algorithm, Metro-Police algorithm, Markov Chain Monte Carlo, etc.

https://github.com/trekhleb/javascript-algorithms/blob/dc1047df725117c411959692a1ab538f65342b2e/src/algorithms/math/fibonacci/fibonacci.js#L13

This condition is redundant, the while condition covers the case where n equals 1.

p.s- I will exploit this opportunity to say thank you for this repository.

There is a better solution for the TwoSum problem than the hashmap solution. Sure hashmap is fine and meets the desired output. however it can be completely eliminated as such. The techinque employs a pointers to track the argument array i.e. one from the begining aka head and the other one from the end aka tail. A single sweep on the array and adjusting the two pointers does the job rath

Selection Sort, for example, makes the algorithm look extremely (impossibly) good at first glance - O(n) - because it's not showing the majority of the steps.

Instead of

    for (var j = i + 1; j < D.length; j++) {
        if (D[j] < D[minJ]) {
            tracer._select(j);
            minJ = j;
            tracer._deselect(j);
        }
    }

it has to be more like

    for (var j

给定两个由小写字母构成的字符串 A 和 B ，只要我们可以通过交换 A 中的两个字母得到与 B 相等的结果，就返回 true ；否则返回 false 。

示例 1：

输入： A = "ab", B = "ba"
输出： true
示例 2：

输入： A = "ab", B = "ab"
输出： false
示例 3:

输入： A = "aa", B = "aa"
输出： true
示例 4：

输入： A = "aaaaaaabc", B = "aaaaaaacb"
输出： true
示例 5：

输入： A = "", B = "aa"
输出： false
 

提示：

0 <= A.length <= 20000
0 <= B.length <= 20000
A 和 B 仅由小写字母构成。

来源：力扣（L

Which version do you use?

Latest

expected outcome

This documentation will be available on multiple languages. For the beginning English will be good in addition to Chinese

actual results

It is available on Chinese only

Steps to reproduce the results

Walk through the text

Other related information

None

https://mybinder.org/ Should I make a binder ? :) Or if there is a binder link, it's well hidden.

I just noticed that links in README are relative. They don't work in PyPI site repo page. (And the cool algorithms logo don't show up). Should we make them absolute links, or is there a better way?
Also, how do we update this current version to PyPI?
@danghai @keon What's our progress with Sphinx?

It may be good to provide pure Python implementation of Gradient Descent (instead of SciPy one) for Logistic Regression just for the learning purposes.

there is data_structures/src/list/singly_linked_list, but there is also a code for same problem in data_structures/linked_list/
One of them ought to be removed.

Chapter 12, Section 11, Hamiltonian Cycle

Page number: 400

"doubly-linked list of 2k vertices (i, 0),(i, 1),...,(i, 2k)" should have no "(i, 0)".

Hey @mgechev,
I noticed that you have a README.md file in src/sorting, which has the Big O complexity for all algorithms. It also has the "When to use" column, which is blank. Basecs already has many algorithms' explanations, and can be used to fill in this.column. The explanations are valid for most languages and are concise.

Also, a README.md for all src/* folders would be helpful. (I would

🚀 Feature Proposal

Adding leading zero in the question number will be an awesome feature for file explorer to sort files by the name.

A short (3 point) closed linestring (rare, but does happen) throws an exception in clean-coords due to the code assuming it's a polygon.

Problem occurs due to https://github.com/Turfjs/turf/blob/master/packages/turf-clean-coords/index.ts#L118 assuming the first and last points matching means it's a polygon.

This can also happen with a linestring that is cleaned to < 4 points. Discovered thi

New popular data sets, techniques, research paper links are some of the suggested ways you can contribute.