What roadmap is this issue about?

• Frontend Roadmap
• Backend Roadmap
• DevOps Roadmap
• All Roadmaps

What is this issue about?

• D

https://github.com/trekhleb/javascript-algorithms/blob/master/src/algorithms/sets/cartesian-product/cartesianProduct.js#L8

I think it makes more sense to return an empty array

// invalid input return null or throw an error
if (!setA || !setB) {
    return null;
}
if (!setA.length || !setB.length) {
    return []; 
}
// or do nothing since the for loop will not trigger anyway

Problem:
OSSU:CS requires far more math than our curricular guidelines suggest.

Duration:
Feb 29, 2020

Proposer:
Waciuma Wanjohi

Background:
OSSU refers to two curricular guidelines. These guidelines are created by professional and non-governmental organizations: ABET, ACM and IEEE. More information about these can be found here: https://github.com/ossu/computer-scienc

假如有一排房子，共 n 个，每个房子可以被粉刷成红色、蓝色或者绿色这三种颜色中的一种，你需要粉刷所有的房子并且使其相邻的两个房子颜色不能相同。

当然，因为市场上不同颜色油漆的价格不同，所以房子粉刷成不同颜色的花费成本也是不同的。每个房子粉刷成不同颜色的花费是以一个 n x 3 的矩阵来表示的。

例如，costs[0][0] 表示第 0 号房子粉刷成红色的成本花费；costs[1][2] 表示第 1 号房子粉刷成绿色的花费，以此类推。请你计算出粉刷完所有房子最少的花费成本。

注意：

所有花费均为正整数。

示例：

输入: [[17,2,17],[16,16,5],[14,3,19]]
输出: 10
解释: 将 0 号房子粉刷成蓝色，1 号房子粉刷成绿色，2 号房子粉刷成蓝色。
  最少花费: 2 + 5 + 3 = 10。

题目地址： ht

The UI of book cards is not that great currently. Lot of improvements can be made in terms of how they look. For example how the category is displayed currently in the card is not pleasant and can be improved. Feel free to make any changes that you think improve the design of cards.

See https://github.com/hackerkid/Mind-Expanding-Books/tree/master/app for details on setting up the development

Add resources for R language - books, blogs, video lessons, etc.

https://github.com/benoitvallon/computer-science-in-javascript/blob/master/data-structures-in-javascript/tree.es6.js#L33

Splice in the for loop shifts the elements in the array and skips the sibling of the node that was removed.

Fix PR:

You can test with:

const tree = new Tree();
tree.add('ceo');
tree.add('cto1', 'ceo');
tree.add('cto2', 'ceo');
tree.add('cto3', 'ceo');
tree