Skip to content

Instantly share code, notes, and snippets.

View Stefanacef's full-sized avatar

Stefana Stefanacef

14 followers · 6 following
View GitHub Profile
@Stefanacef
Stefanacef / gist:8c29874da9e2e7309eee12de687df80c
Created January 20, 2022 08:05
Find Intersection
Input: ["1, 3, 4, 7, 13", "1, 2, 4, 13, 15"]
Output: 1,4,13
function FindIntersection(strArr) {
// code goes here
const [leftSide,rightSide]=strArr
const right=rightSide.split(',').map(el=>el.trim())
const left=leftSide.split(',').map(el=>el.trim())
@Stefanacef
Stefanacef / Filter two arrays.js
Created November 1, 2021 14:07
How to filter an array and an array of objects | how to filter two arrays
const arr=['one','two','three','four']
const verif=[
{id:'one'},
{id:'aaaa'},
{id:'two'},
{id:'bbbb'},
{id:'three'},
{id:'four'},
]
verif.filter((el)=>{
@Stefanacef
Stefanacef / Forming a Magic Square | Solution |JavaScript.js
Created October 19, 2021 11:29
Solution for "Forming a Magic Square" in Hackerrank
const magic = [
[8, 1, 6, 3, 5, 7, 4, 9, 2],
[6, 1, 8, 7, 5, 3, 2, 9, 4],
[4, 3, 8, 9, 5, 1, 2, 7, 6],
[2, 7, 6, 9, 5, 1, 4, 3, 8],
[2, 9, 4, 7, 5, 3, 6, 1, 8],
[4, 9, 2, 3, 5, 7, 8, 1, 6],
[6, 7, 2, 1, 5, 9, 8, 3, 4],
[8, 3, 4, 1, 5, 9, 6, 7, 2],
];
@Stefanacef
Stefanacef / Electronics Shop | Solution | JavaScript.js
Created October 16, 2021 11:40
Solution for "Electronics Shop" in Hackerrank
const b= 10;
const keyboards=[3, 1];
const drives=[5, 2, 8]
function getMoneySpent(keyboards, drives, b) {
let arr=[];
for(let i=0;i<keyboards.length;i++){
for(let j=0;j<drives.length;j++){
if(keyboards[i]+drives[j]<=b)
arr.push(keyboards[i]+drives[j])
}
@Stefanacef
Stefanacef / Counting Valleys | Solution | JavaScript.js
Created October 16, 2021 10:51
Solution for "Counting Valleys" in Hackerrank
let path = [
'DDUDUDDUDDUDDUUUUDUDDDUUDDUUDDDUUDDUUUUUUDUDDDDUDDUUDUUDUDUUUDUUUUUDDUDDDDUDDUDDDDUUUUDUUDUUDUUDUDDD']
const cat = [1, 2, 3];
const steps = 8;
function countingValleys(steps, path) {
let count = 0;
let val = 0;
let distance = steps;
const arr = path[0]
@Stefanacef
Stefanacef / Sales by Match |JavaScript | Solution.js
Created October 13, 2021 11:37
Solution for "Sales by Match" in Hackerrank
const ar = [10, 20, 20, 10, 10, 30, 50, 10, 20];
const n = 9;
function sockMerchant(n, ar) {
let count = 0;
ar.sort((a, b) => a - b);
for (let i = 0; i < ar.length; i++) {
if (ar[i] === ar[i + 1]) {
i++
count++;
@Stefanacef
Stefanacef / Bill Division | JavaScript | Solution.js
Last active October 13, 2021 11:11
Solution for "Bill Division" in Hackerrank
const bill = [3, 10, 2, 9];
const k = 1;
const b = 12;
function bonAppetit(bill, k, b) {
const result = bill.reduce((acc, el) => acc + el, 0);
if((result-bill[k])/2===b)console.log('bun')
else{console.log(b-(result-bill[k])/2)}
///////////OR//////////////
if (k === 0) {
bill.shift();
@Stefanacef
Stefanacef / Migratory Birds | Solution | JavaScript.js
Last active May 26, 2023 12:12
Solution for "Migratory Birds" in Hackerrank
const arr=[1, 2, 3, 4,5, 4, 3, 2, 1, 3, 4]
function migratoryBirds(arr) {
let objectArr=arr.reduce((obj, b)=> {
obj[b] = ++obj[b] || 1;
return obj;
}, {});
// console.log(objectArr)
const maxVal=Math.max(...Object.values(objectArr))
const num=Object.keys(objectArr).find(key => objectArr[key] === maxVal)
@Stefanacef
Stefanacef / Divisible Sum Pairs | Solution | JavaScript.js
Last active October 12, 2021 09:52
Solution for "Divisible Sum Pairs" in Hackerrank
const ar = [1, 3, 2, 6, 1, 2];
const n = 6;
const k = 3;
function divisibleSumPairs(n, k, ar) {
let count=0;
for(let i= 0;i<n;i++){
for(let j=i+1;j<n;j++){
let sum =ar[i]+ar[j];
if(sum%k===0){
count++
@Stefanacef
Stefanacef / Subarray Division | Solution | JavaScript.js
Created October 11, 2021 11:31
Solution for "Subarray Division" in Hackerrank
let num = s;
let nums = [];
let count = 0;
const s = [4];
const d = 4;
const m = 1;
function birthday(s, d, m) {
let num = s;
let nums = [];