The cards don't have new lines in the code and it makes it very hard to read them. Any ideas on how a new line can be added.

Perhaps this should be added to the documentation. I shall try to solve it if there is no readily available answer.

I can create a pull request if an answer is provided.

Hey,

I'm new to github and thought this repo would be a good opportunity to get familiar and contribute a simple algorithm. I noticed the sorts folder is lacking a recursive implementation of the insertion sort. Is it OK if I add one?

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

In the Best Practice Questions section under Week 5 – Dynamic Programming, Combination Sum linked to LeetCode Combination Sum IV. Is this intended? All other questions have the correct numbering (e.g. Word Search II).

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

你的朋友正在使用键盘输入他的名字 name。偶尔，在键入字符 c 时，按键可能会被长按，而字符可能被输入 1 次或多次。

你将会检查键盘输入的字符 typed。如果它对应的可能是你的朋友的名字（其中一些字符可能被长按），那么就返回 True。

示例 1：

输入：name = "alex", typed = "aaleex"
输出：true
解释：'alex' 中的 'a' 和 'e' 被长按。
示例 2：

输入：name = "saeed", typed = "ssaaedd"
输出：false
解释：'e' 一定需要被键入两次，但在 typed 的输出中不是这样。
示例 3：

输入：name = "leelee", typed = "lleeelee"
输出：true
示例 4：

输入：name = "laiden", typ

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.

Hi, Atsushi, your code really benefits robotics learners. Thank you!

When I study your code in 'graphSLAM_doc.ipynb', I find two questions to be discussed with you as follows.

1. In 'Minimal Example' , I think 'omegas' should be added onto the calculation.
   b[t1] += omegas * measure_constraints[(t1,t2)]
   b[t2] -= omegas * measure_constraints[(t1,t2)]

2. In [6] , 'yaw1

Chapter number or note title: 11.5

Page number: 361

Error description: In the unbulleted list, the new bipartite graph G' is written as H.

Suggested fix (if any): :%s/H/G'/g

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.

Here's a JSFiddle and a sample geojson.

Basically, if I have a LineString of length k, calling lineToPolygon(line) (which returns a "new" polygon) also mutates line to have k + 1 points. Of course, you can set the property autoComplete, but I would never expect lineToPolygon(line) to both return a Polygon

A more consistent and multi-functional global level of verbosity control,
suggest an enhancement that will see print(...) in project be converted to using the python logging. module

import logging
#Then instead of print() use either
logging.info(......)
#or
logging.debug(.....)
#or
logging.warning(....)
#or
#logging.error()

In that way verbosity can be globally

If we traverse through the tree from down, the child of root node will contain 12 and 4, so the summation of both is 16 but you got 20

Some possible suggestions are - sites which teach algorithms, sites which interactively visualize different algorithms. Also, notebooks/question pages of ACM themed contests can be added.