## Truncate to fixed decimal

0 likes • Nov 19, 2022
JavaScript

## More JavaScript Posts

```function Welcome(props) {  return <h1>Hello, {props.name}</h1>;}
function App() {  return (    <div>      <Welcome name="Sara" />      <Welcome name="Cahal" />      <Welcome name="Edite" />    </div>  );}
ReactDOM.render(  <App />,  document.getElementById('root'));```

### array shuffle

CodeCatch
0 likes • Nov 19, 2022
JavaScript
```const shuffle = ([...arr]) => {  let m = arr.length;  while (m) {    const i = Math.floor(Math.random() * m--);    [arr[m], arr[i]] = [arr[i], arr[m]];  }  return arr;};
const foo = [1, 2, 3];shuffle(foo); // [2, 3, 1], foo = [1, 2, 3]```

### Rings and Rods

CodeCatch
0 likes • Nov 19, 2022
JavaScript
```// There are n rings and each ring is either red, green, or blue. The rings are distributed across ten rods labeled from 0 to 9.
// You are given a string rings of length 2n that describes the n rings that are placed onto the rods. Every two characters in rings forms a color-position pair that is used to describe each ring where:
// The first character of the ith pair denotes the ith ring's color ('R', 'G', 'B').// The second character of the ith pair denotes the rod that the ith ring is placed on ('0' to '9').// For example, "R3G2B1" describes n == 3 rings: a red ring placed onto the rod labeled 3, a green ring placed onto the rod labeled 2, and a blue ring placed onto the rod labeled 1.
// Return the number of rods that have all three colors of rings on them.

let rings = "B0B6G0R6R0R6G9";var countPoints = function(rings) {        let sum = 0;    	// Always 10 Rods    for (let i = 0; i < 10; i++) {        if (rings.includes(`B\${i}`) && rings.includes(`G\${i}`) && rings.includes(`R\${i}`)) {            sum+=1;        }    }        return sum;    };
console.log(countPoints(rings));```
```function printHeap(heap, index, level) {    if (index >= heap.length) {        return;    }    console.log("  ".repeat(level) + heap[index]);    printHeap(heap, 2 * index + 1, level + 1);    printHeap(heap, 2 * index + 2, level + 1);}
//You can call this function by passing in the heap array and the index of the root node, which is typically 0, and level = 0.
let heap = [3, 8, 7, 15, 17, 30, 35, 2, 4, 5, 9];printHeap(heap,0,0)```

### JS Test

0 likes • Mar 9, 2021
JavaScript
`alert("bruh")`

CodeCatch
0 likes • Nov 19, 2022
JavaScript
```class LinkedList {  constructor() {    this.nodes = [];  }
get size() {    return this.nodes.length;  }
get head() {    return this.size ? this.nodes[0] : null;  }
get tail() {    return this.size ? this.nodes[this.size - 1] : null;  }
insertAt(index, value) {    const previousNode = this.nodes[index - 1] || null;    const nextNode = this.nodes[index] || null;    const node = { value, next: nextNode };
if (previousNode) previousNode.next = node;    this.nodes.splice(index, 0, node);  }
insertFirst(value) {    this.insertAt(0, value);  }
insertLast(value) {    this.insertAt(this.size, value);  }
getAt(index) {    return this.nodes[index];  }
removeAt(index) {    const previousNode = this.nodes[index - 1];    const nextNode = this.nodes[index + 1] || null;
if (previousNode) previousNode.next = nextNode;
return this.nodes.splice(index, 1);  }
clear() {    this.nodes = [];  }
reverse() {    this.nodes = this.nodes.reduce(      (acc, { value }) => [{ value, next: acc[0] || null }, ...acc],      []    );  }
*[Symbol.iterator]() {    yield* this.nodes;  }}