fix(guide): Remove repl.it links from challenge related guide articles (English) (#36204)
* fix: remove repl.it links english * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com> * fix: add extra line Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
@@ -85,7 +85,6 @@ In the event of *odd number of sets* the symmetric difference will include ident
|
||||
}
|
||||
```
|
||||
|
||||
 <a href="https://repl.it/C4II/0" target="_blank" rel="nofollow">Run Code</a>
|
||||
|
||||
### Code Explanation: ###
|
||||
|
||||
@@ -140,7 +139,6 @@ In the event of *odd number of sets* the symmetric difference will include ident
|
||||
sym([1, 2, 3], [5, 2, 1, 4]);
|
||||
```
|
||||
|
||||
 <a href="https://repl.it/CLoc/0" target="_blank" rel="nofollow">Run Code</a>
|
||||
|
||||
### Code Explanation: ###
|
||||
|
||||
@@ -175,7 +173,6 @@ In the event of *odd number of sets* the symmetric difference will include ident
|
||||
sym([1, 2, 3], [5, 2, 1, 4]);
|
||||
```
|
||||
|
||||
 <a href="https://repl.it/@ashenm/Symmetric-Difference" target="_blank" rel="nofollow">Run Code</a>
|
||||
|
||||
### Code Explanation: ###
|
||||
|
||||
|
@@ -41,8 +41,7 @@ function bubbleSort(array) {
|
||||
return array;
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Bubble-Sort)
|
||||
|
||||
|
||||
### References:
|
||||
- [GeeksForGeeks](https://www.geeksforgeeks.org/bubble-sort/)
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Bubble_sort)
|
||||
|
@@ -26,7 +26,6 @@ function insertionSort(array) {
|
||||
return array;
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Insertion-Sort)
|
||||
|
||||
### References:
|
||||
|
||||
|
@@ -44,7 +44,7 @@ function mergeSort(array) {
|
||||
return merger(left, right);
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Merge-Sort)
|
||||
|
||||
### References:
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Merge_sort)
|
||||
- Video by [Hackerrank](https://www.youtube.com/watch?v=KF2j-9iSf4Q)
|
||||
|
@@ -44,7 +44,7 @@ function quickSort(array, left = 0, right = array.length-1) {
|
||||
return array;
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Quick-Sort)
|
||||
|
||||
### Reference:
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Quicksort)
|
||||
- [Khan Academy](https://www.khanacademy.org/computing/computer-science/algorithms/quick-sort/a/overview-of-quicksort)
|
||||
|
@@ -105,7 +105,6 @@ Return the completed inventory in alphabetical order.
|
||||
updateInventory(curInv, newInv);
|
||||
```
|
||||
|
||||
 <a href='https://repl.it/CLok/0' target='_blank' rel='nofollow'>Run Code</a>
|
||||
|
||||
### Code Explanation:
|
||||
|
||||
@@ -191,7 +190,6 @@ Return the completed inventory in alphabetical order.
|
||||
updateInventory(curInv, newInv);
|
||||
```
|
||||
|
||||
 <a href='https://repl.it/CLol/0' target='_blank' rel='nofollow'>Run Code</a>
|
||||
|
||||
### Code Explanation:
|
||||
|
||||
@@ -267,7 +265,6 @@ Return the completed inventory in alphabetical order.
|
||||
updateInventory(curInv, newInv);
|
||||
```
|
||||
|
||||
 <a href='https://repl.it/MQvv/latest' target='_blank' rel='nofollow'>Run Code</a>
|
||||
|
||||
### Code Explanation:
|
||||
|
||||
|
@@ -141,7 +141,6 @@ A way to visualize this is by considering a tree that starts with the first char
|
||||
// Test here.
|
||||
permAlone('aab');
|
||||
|
||||
 <a href='https://repl.it/CLop/0' target='_blank' rel='nofollow'>Run Code</a>
|
||||
|
||||
### Code Explanation:
|
||||
|
||||
|
@@ -120,6 +120,6 @@ class PriorityQueue {
|
||||
}
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Priority-Queue)
|
||||
|
||||
### References:
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Priority_queue)
|
||||
|
@@ -46,8 +46,6 @@ function checkSet() {
|
||||
checkSet();
|
||||
```
|
||||
|
||||
 <a href='https://repl.it/repls/HighlevelImperfectDiscussion' target='_blank' rel='nofollow'>Run Code</a>
|
||||
|
||||
### Code Explanation:
|
||||
|
||||
* Creating a set object as shown in pre-written code will create the set without duplicate objects.
|
||||
|
@@ -20,7 +20,6 @@ function multiplesOf3and5(number) {
|
||||
return sum;
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-1-Multiples-of-3-and-5)
|
||||
|
||||
|
||||
### Reference:
|
||||
|
@@ -49,7 +49,6 @@ function primeSummation(n) {
|
||||
}
|
||||
```
|
||||
|
||||
- [Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-10-Summation-of-primes)
|
||||
|
||||
### References:
|
||||
- Sieve of Eratosthenes [Wikipedia](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)
|
||||
|
@@ -48,6 +48,6 @@ function fiboEvenSum(n){
|
||||
return sumEven;
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@scissorsneedfoo/Project-Euler-Problem-2-Even-Fibonacci-Numbers)
|
||||
|
||||
### References:
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Fibonacci_number)
|
||||
|
@@ -23,7 +23,7 @@ function largestPrimeFactor(number) {
|
||||
return max;
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Problem-3-Largest-prime-factor)
|
||||
|
||||
### Resources:
|
||||
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Prime_number)
|
||||
|
@@ -45,7 +45,7 @@ function largestPalindromeProduct(n) {
|
||||
return Math.max(...res);
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Problem-4-Largest-palindrome-product)
|
||||
|
||||
### References:
|
||||
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Palindromic_number)
|
||||
|
@@ -33,7 +33,7 @@ function smallestMult(n){
|
||||
return maxLCM;
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Problem-5-Smallest-multiple)
|
||||
|
||||
### References:
|
||||
- [Euclidean algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm)
|
||||
- [LCM](https://en.wikipedia.org/wiki/Least_common_multiple)
|
||||
|
@@ -22,7 +22,7 @@ function sumSquareDifference(n) {
|
||||
return (sumOfN ** 2) - sumOfNSquare;
|
||||
}
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Problem-6-Sum-square-difference)
|
||||
|
||||
### References:
|
||||
|
||||
- [Sum of n numbers - Wikipedia](https://en.wikipedia.org/wiki/1_%2B_2_%2B_3_%2B_4_%2B_%E2%8B%AF)
|
||||
|
@@ -44,6 +44,6 @@ function nthPrime(n) {
|
||||
|
||||
}
|
||||
```
|
||||
-[Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-7-10001st-prime)
|
||||
|
||||
### References:
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Prime_number)
|
||||
|
@@ -36,7 +36,6 @@ function largestProductinaSeries(n) {
|
||||
|
||||
console.log(largestProductinaSeries(13));
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-8-Largest-product-in-a-series)
|
||||
|
||||
### References:
|
||||
|
||||
|
@@ -27,7 +27,6 @@ function specialPythagoreanTriplet(n) {
|
||||
|
||||
specialPythagoreanTriplet(1000);
|
||||
```
|
||||
- [Run Code](https://repl.it/@ezioda004/Project-Euler-Problem-9-Special-Pythagorean-triplet)
|
||||
|
||||
### References:
|
||||
- [Wikipedia](https://en.wikipedia.org/wiki/Pythagorean_triple)
|
||||
|
Reference in New Issue
Block a user