Add: forumTopicId for rosetta code (#38855)
This commit is contained in:
@ -3,6 +3,7 @@ id: 5e4ce2b6ac708cc68c1df25e
|
||||
title: Last letter-first letter
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385256
|
||||
---
|
||||
|
||||
## Description
|
||||
@ -119,7 +120,7 @@ function findLongestChain(items) {
|
||||
|
||||
var longest_path_len = longest_path_refs_len;
|
||||
var longest_path = new Array(longest_path_len);
|
||||
|
||||
|
||||
for (var i = 0; i < longest_path_len; i++)
|
||||
longest_path[i] = items[longest_path_refs[i].index];
|
||||
|
||||
|
@ -3,6 +3,7 @@ id: 5e4ce2bbac708cc68c1df25f
|
||||
title: Letter frequency
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385263
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e4ce2eaac708cc68c1df260
|
||||
title: Levenshtein distance
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385264
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e4ce2f5ac708cc68c1df261
|
||||
title: Linear congruential generator
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385266
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e4ce2a1ac708cc68c1df25d
|
||||
title: Long multiplication
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385269
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e6dd1278e6ca105cde40ea9
|
||||
title: Longest common subsequence
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385271
|
||||
---
|
||||
|
||||
## Description
|
||||
@ -52,7 +53,7 @@ tests:
|
||||
|
||||
```js
|
||||
function lcs(a, b) {
|
||||
|
||||
|
||||
}
|
||||
```
|
||||
|
||||
|
@ -3,6 +3,7 @@ id: 5e6dd139859c290b6ab80292
|
||||
title: Longest increasing subsequence
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385272
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e6dd14192286d95fc43046e
|
||||
title: Longest string challenge
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385275
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e6dd14797f5ce267c2f19d0
|
||||
title: Look-and-say sequence
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385277
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e6dd15004c88cf00d2a78b3
|
||||
title: Loop over multiple arrays simultaneously
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385279
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e6decd8ec8d7db960950d1c
|
||||
title: LU decomposition
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385280
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5e6dee7749a0b85a3f1fc7d5
|
||||
title: Lucas-Lehmer test
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385281
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5ea281203167d2b0bdefca00
|
||||
title: Ludic numbers
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385282
|
||||
---
|
||||
|
||||
## Description
|
||||
@ -80,7 +81,7 @@ tests:
|
||||
|
||||
```js
|
||||
function ludic(n) {
|
||||
|
||||
|
||||
}
|
||||
```
|
||||
|
||||
|
@ -3,6 +3,7 @@ id: 5ea28156e79528a9ab248f27
|
||||
title: Luhn test of credit card numbers
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385284
|
||||
---
|
||||
|
||||
## Description
|
||||
@ -15,7 +16,7 @@ Those companies using credit card numbers that can be validated by the Luhn test
|
||||
<li> Take the first, third, ... and every other odd digit in the reversed digits and sum them to form the partial sum s1</li>
|
||||
<li> Taking the second, fourth ... and every other even digit in the reversed digits:</li>
|
||||
<ol>
|
||||
<li>Multiply each digit by two and sum the digits if the answer is greater than nine to form partial sums for the even digits.</li>
|
||||
<li>Multiply each digit by two and sum the digits if the answer is greater than nine to form partial sums for the even digits.</li>
|
||||
<li>Sum the partial sums of the even digits to form s2.</li>
|
||||
</ol>
|
||||
<li>If s1 + s2 ends in zero then the original number is in the form of a valid credit card number as verified by the Luhn test.</li>
|
||||
@ -82,7 +83,7 @@ tests:
|
||||
|
||||
```js
|
||||
function luhnTest(str) {
|
||||
|
||||
|
||||
}
|
||||
```
|
||||
|
||||
|
@ -3,6 +3,7 @@ id: 5ea2815a8640bcc6cb7dab3c
|
||||
title: Lychrel numbers
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385287
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -3,6 +3,7 @@ id: 5ea2815e364d9a2222ea55f8
|
||||
title: LZW compression
|
||||
challengeType: 5
|
||||
isHidden: false
|
||||
forumTopicId: 385288
|
||||
---
|
||||
|
||||
## Description
|
||||
|
@ -2,6 +2,7 @@
|
||||
title: Self Describing Numbers
|
||||
id: 5eaf48389ee512d4d103684b
|
||||
challengeType: 5
|
||||
forumTopicId: 385289
|
||||
isHidden: false
|
||||
---
|
||||
|
||||
|
Reference in New Issue
Block a user