Skip to content

Instantly share code, notes, and snippets.

function travel(temp, level) {
if (count.every(element => element == 0) ) {
result.push(temp.join(''));
return;
}
for (let i = 0; i < count.length; i++) {
if (count[i] > 0) {
@pinkmomo027
pinkmomo027 / backtrack.js
Created June 29, 2018 00:17
subsets of array
let names = ["fifi", "vampire", "lena", "wheels"];
let finalResult = [];
function sublist(array) {
let chosen = [];
sublistHelper(array, chosen);
}
function sublistHelper(array, chosen) {
if (array.length == 0) {
@pinkmomo027
pinkmomo027 / binary.js
Created June 29, 2018 00:25
print binary
let finalResult = [];
function printBinary(number) {
let chosen = [];
printBinaryHelper(number, chosen);
}
function printBinaryHelper(count, chosen) {
if (count == 0) {
// base case
@pinkmomo027
pinkmomo027 / pq.js
Created June 29, 2018 23:55
trying out PQ
class QElement {
constructor (value, priority) {
this.value = value;
this.priority = priority
}
}
class PQ {
constructor () {
this.elements = ['root'];
@pinkmomo027
pinkmomo027 / dijkstra.js
Last active August 9, 2018 17:09
dijkstra.js
let G = [
[0, 2, 5, Infinity],
[2, 0, Infinity, 7 ],
[5, Infinity, 0, Infinity],
[Infinity, 7, Infinity, 0 ]];
let N = G.length;
let target = 3; // target is to visit 3rd
let distance = new Array(N).fill(Infinity);
let visited = new Array(N).fill(false);