From 5bca3c6a1e4159fe049b5a4a95bcf608caf08be9 Mon Sep 17 00:00:00 2001 From: Louiscarloo Date: Sat, 3 May 2025 22:07:41 +0700 Subject: [PATCH] Push Quiz Week 3 --- quiz/part1/soal1.js | 39 +++++++++++++ quiz/part1/soal2.js | 27 +++++++++ quiz/part1/soal3.js | 29 ++++++++++ quiz/part1/soal4.js | 44 +++++++++++++++ quiz/part1/soal5.js | 23 ++++++++ quiz/part2/soal1.js | 47 ++++++++++++++++ quiz/part2/soal2.js | 39 +++++++++++++ quiz/part2/soal3.js | 32 +++++++++++ quiz/part2/soal4.js | 43 +++++++++++++++ quiz/part3/soal1.js | 41 ++++++++++++++ quiz/part3/soal2.js | 108 ++++++++++++++++++++++++++++++++++++ quiz/part3/soal3.js | 118 +++++++++++++++++++++++++++++++++++++++ quiz/ujian/soal1.js | 76 +++++++++++++++++++++++++ quiz/ujian/soal2.js | 66 ++++++++++++++++++++++ quiz/ujian/soal3.js | 101 ++++++++++++++++++++++++++++++++++ quiz/ujian/soal4.js | 131 ++++++++++++++++++++++++++++++++++++++++++++ 16 files changed, 964 insertions(+) create mode 100644 quiz/part1/soal1.js create mode 100644 quiz/part1/soal2.js create mode 100644 quiz/part1/soal3.js create mode 100644 quiz/part1/soal4.js create mode 100644 quiz/part1/soal5.js create mode 100644 quiz/part2/soal1.js create mode 100644 quiz/part2/soal2.js create mode 100644 quiz/part2/soal3.js create mode 100644 quiz/part2/soal4.js create mode 100644 quiz/part3/soal1.js create mode 100644 quiz/part3/soal2.js create mode 100644 quiz/part3/soal3.js create mode 100644 quiz/ujian/soal1.js create mode 100644 quiz/ujian/soal2.js create mode 100644 quiz/ujian/soal3.js create mode 100644 quiz/ujian/soal4.js diff --git a/quiz/part1/soal1.js b/quiz/part1/soal1.js new file mode 100644 index 0000000..09c2ecb --- /dev/null +++ b/quiz/part1/soal1.js @@ -0,0 +1,39 @@ +// Soal 1 +// js +//cek apakah angka yang dikirim adalah angka prima atau bukan? +//cek google bagi yang ga tau apa itu angka prima +function angkaPrima(angka) +{ + // you can only write your code here! + let cek = true; + + if (angka < 2) + { + cek = false; + } + else + { + for (let i = 1; i <= angka; i++) + { + if (i === 1 || i === angka) + { + continue; + } + + if (angka % i === 0) + { + cek = false; + break; + } + } + } + + return cek; +} + +// TEST CASES +console.log(angkaPrima(3)); // true +console.log(angkaPrima(7)); // true +console.log(angkaPrima(6)); // false +console.log(angkaPrima(23)); // true +console.log(angkaPrima(33)); // false \ No newline at end of file diff --git a/quiz/part1/soal2.js b/quiz/part1/soal2.js new file mode 100644 index 0000000..c0b6b0b --- /dev/null +++ b/quiz/part1/soal2.js @@ -0,0 +1,27 @@ +// Soal 2 +// js +//cari faktor persekutuan terbesar +function fpb(angka1, angka2) +{ + // you can only write your code here! + let hasilFPB = Math.min(angka1, angka2); + + while (hasilFPB > 0) + { + if (angka1 % hasilFPB === 0 && angka2 % hasilFPB === 0) + { + break; + } + + hasilFPB--; + } + + return hasilFPB; +} + +// TEST CASES +console.log(fpb(12, 16)); // 4 +console.log(fpb(50, 40)); // 10 +console.log(fpb(22, 99)); // 11 +console.log(fpb(24, 36)); // 12 +console.log(fpb(17, 23)); // 1 \ No newline at end of file diff --git a/quiz/part1/soal3.js b/quiz/part1/soal3.js new file mode 100644 index 0000000..f03701c --- /dev/null +++ b/quiz/part1/soal3.js @@ -0,0 +1,29 @@ +// Soal 3 +// js +function cariMedian(arr) +{ + // you can only write your code here! + arr.sort(function(angka1, angka2){return angka1 - angka2}); + let hasilMedian; + + if (arr.length > 0) + { + if ((arr.length % 2) === 0) + { + hasilMedian = (arr[(arr.length / 2) - 1] + arr[arr.length / 2]) / 2; + } + else + { + hasilMedian = arr[Math.floor(arr.length / 2)]; + } + } + + return hasilMedian; +} + +// TEST CASES +console.log(cariMedian([1, 2, 3, 4, 5])); // 3 +console.log(cariMedian([1, 3, 4, 10, 12, 13])); // 7 +console.log(cariMedian([3, 4, 7, 6, 10])); // 6 +console.log(cariMedian([1, 3, 3])); // 3 +console.log(cariMedian([7, 7, 8, 8])); // 7.5 \ No newline at end of file diff --git a/quiz/part1/soal4.js b/quiz/part1/soal4.js new file mode 100644 index 0000000..cded1ae --- /dev/null +++ b/quiz/part1/soal4.js @@ -0,0 +1,44 @@ +// Soal 4 +// js +/* +Diberikan sebuah function cariModus(arr) yang menerima sebuah array angka. Function akan me-return modus dari array atau deret angka tersebut. Modus adalah angka dari sebuah deret yang paling banyak atau paling sering muncul. Contoh, modus dari [10, 4, 5, 2, 4] adalah 4. Jika modus tidak ditemukan, function akan me-return -1. Apabila ditemukan lebih dari dua nilai modus, tampilkan nilai modus yang paling pertama muncul (dihitung dari kiri ke kanan). Dan apabila dialam modus hanya ada 1 nilai yang sama maka function akan me-return -1, Contohnya [1, 1, 1] adalah -1. +*/ +function cariModus(arr) +{ + // you can only write your code here! + let hasilModus = [-1, -1]; + + for (let i = 0; i < arr.length; i++) + { + let jumlahButir = 0; + for (let j = 0; j < arr.length; j++) + { + if (arr[i] === arr[j]) + { + jumlahButir++; + } + } + + if (jumlahButir > 1) + { + if (jumlahButir > hasilModus[1]) + { + hasilModus.splice(0, 2, arr[i], jumlahButir); + } + } + } + + if (hasilModus[1] === arr.length) + { + hasilModus[0] = -1; + } + + return hasilModus[0]; +} + +// TEST CASES +console.log(cariModus([10, 4, 5, 2, 4])); // 4 +console.log(cariModus([5, 10, 10, 6, 5])); // 5 +console.log(cariModus([10, 3, 1, 2, 5])); // -1 +console.log(cariModus([1, 2, 3, 3, 4, 5])); // 3 +console.log(cariModus([7, 7, 7, 7, 7])); // -1 \ No newline at end of file diff --git a/quiz/part1/soal5.js b/quiz/part1/soal5.js new file mode 100644 index 0000000..ee5c98c --- /dev/null +++ b/quiz/part1/soal5.js @@ -0,0 +1,23 @@ +// Soal 5 +// js +//sistem ubah hurufnya misal huruf a diubah menjadi b, c menjadi d, b menjadi c, z menjadi a +//intinya ubah huruf menjadi huruf setelahnya +function ubahHuruf(kata) +{ + // you can only write your code here! + let ubahKata = ''; + + for (let i = 0; i < kata.length; i++) + { + ubahKata += String.fromCharCode(kata.charCodeAt(i) + 1); + } + + return ubahKata; +} + +// TEST CASES +console.log(ubahHuruf('wow')); // xpx +console.log(ubahHuruf('developer')); // efwfmpqfs +console.log(ubahHuruf('javascript')); // kbwbtdsjqu +console.log(ubahHuruf('keren')); // lfsfo +console.log(ubahHuruf('semangat')); // tfnbohbu \ No newline at end of file diff --git a/quiz/part2/soal1.js b/quiz/part2/soal1.js new file mode 100644 index 0000000..fc50b2c --- /dev/null +++ b/quiz/part2/soal1.js @@ -0,0 +1,47 @@ +// Soal 1 +// js +/* +Diberikan sebuah function digitPerkalianMinimum(angka) yang menerima satu parameter angka. Function akan mengembalikan jumlah digit minimal dari angka yang merupakan faktor angka parameter tersebut, Contoh, jika angka adalah 24, maka faktornya adalah 1 * 24, 2 * 12, 3 * 8, dan 4 * 6. Dari antara faktor tersebut, yang digit nya paling sedikit adalah 3 * 8 atau 4 * 6, sehingga function akan me-return 2. + +1 * 24 = 3 digit (124) +3 * 8 = 2 digit (38) +4 * 6 = 2 digit (46) + +karena dibawah ini 2 digit dan terkecil +3 * 8 = 2 digit (38) +4 * 6 = 2 digit (46) + +ya jadikan dia minimum + +misal faktronya angka 1 hanyalah +1*1 = 2 digit (11) + +Return 2 +*/ +function digitPerkalianMinimum(angka) +{ + // you can only write your code here! + let jumlahDigit = -1; + for (let i = 1; i <= angka; i++) + { + if (angka % i === 0) + { + let stringAngka1 = i.toString().split(''); + let stringAngka2 = (angka / i).toString().split(''); + + if (jumlahDigit > (stringAngka1.length + stringAngka2.length) || jumlahDigit === -1) + { + jumlahDigit = (stringAngka1.length + stringAngka2.length); + } + } + } + + return jumlahDigit; +} + +// TEST CASES +console.log(digitPerkalianMinimum(24)); // 2 +console.log(digitPerkalianMinimum(90)); // 3 +console.log(digitPerkalianMinimum(20)); // 2 +console.log(digitPerkalianMinimum(179)); // 4 +console.log(digitPerkalianMinimum(1)); // 2 \ No newline at end of file diff --git a/quiz/part2/soal2.js b/quiz/part2/soal2.js new file mode 100644 index 0000000..b4c1d99 --- /dev/null +++ b/quiz/part2/soal2.js @@ -0,0 +1,39 @@ +// Soal 2 +// js +//DILARANG MENGGUNAKAN METHOD SORT, PELAJARI ALGORITMA SORTING YANG ADA DI GOOGLE +//saran sih pake bubblesort walau tidak efisien tapi bagus buat belajar sorting +function urutkanAbjad(str) +{ + // you can only write your code here! + str = str.split(''); + for (let i = 0; i < str.length - 1; i++) + { + let swapped = false; + + for (let j = 0; j < str.length - i - 1; j++) + { + if (str[j].charCodeAt(0) > str[j + 1].charCodeAt(0)) + { + let temp = str[j]; + str.splice(j, 1, str[j + 1]); + str.splice((j + 1), 1, temp); + swapped = true; + } + } + + if (swapped === false) + { + break; + } + } + + str = str.join(''); + return str; +} + +// TEST CASES +console.log(urutkanAbjad('hello')); // 'ehllo' +console.log(urutkanAbjad('truncate')); // 'acenrttu' +console.log(urutkanAbjad('developer')); // 'deeeloprv' +console.log(urutkanAbjad('software')); // 'aeforstw' +console.log(urutkanAbjad('aegis')); // 'aegis' \ No newline at end of file diff --git a/quiz/part2/soal3.js b/quiz/part2/soal3.js new file mode 100644 index 0000000..24a1f40 --- /dev/null +++ b/quiz/part2/soal3.js @@ -0,0 +1,32 @@ +// Soal 3 +// js +//TIPS: gunakan method toUpperCase() dan toLowerCase() +function tukarBesarKecil(kalimat) +{ + // you can only write your code here! + kalimat = kalimat.split(''); + for (let i = 0; i < kalimat.length; i++) + { + if (kalimat[i].charCodeAt(0) > 64 && kalimat[i].charCodeAt(0) < 91) + { + kalimat[i] = kalimat[i].toLowerCase(); + } + else + { + if (kalimat[i].charCodeAt(0) > 96 && kalimat[i].charCodeAt(0) < 123) + { + kalimat[i] = kalimat[i].toUpperCase(); + } + } + } + + kalimat = kalimat.join(''); + return kalimat; +} + +// TEST CASES +console.log(tukarBesarKecil('Hello World')); // "hELLO wORLD" +console.log(tukarBesarKecil('I aM aLAY')); // "i Am Alay" +console.log(tukarBesarKecil('My Name is Bond!!')); // "mY nAME IS bOND!!" +console.log(tukarBesarKecil('IT sHOULD bE me')); // "it Should Be ME" +console.log(tukarBesarKecil('001-A-3-5TrdYW')); // "001-a-3-5tRDyw" \ No newline at end of file diff --git a/quiz/part2/soal4.js b/quiz/part2/soal4.js new file mode 100644 index 0000000..8b56b6f --- /dev/null +++ b/quiz/part2/soal4.js @@ -0,0 +1,43 @@ +// Soal 4 +// js +/* +Diberikan sebuah function checkAB(str) yang menerima satu parameter berupa string. function tersebut mengembalikan nilai true jika di dalam string tersebut terdapat karakter a dan b yang memiliki jarak 3 karakter lain minimal satu kali. Jika tidak ditemukan sama sekali, kembalikan nilai false. Jarak bisa dari a ke b, atau b ke a. + +contoh: +barbarian kenapa bisa true? +karena di bagian 'barian' terdapat b dipisah 3 karakter ari(totalnya 3) dan ketemu a + +Spasi juga dianggap sebagai karakter +*/ + +function checkAB(num) +{ + // you can only write your code here! + let cek = false; + + for (let i = 0; i < num.length; i++) + { + if (num.charAt(i) === 'a') + { + for (let j = 0; j < num.length; j++) + { + if (num.charAt(j) === 'b') + { + if (Math.abs(i - j) === 4) + { + cek = true; + } + } + } + } + } + + return cek; +} + +// TEST CASES +console.log(checkAB('lane borrowed')); // true +console.log(checkAB('i am sick')); // false +console.log(checkAB('you are boring')); // true +console.log(checkAB('barbarian')); // true +console.log(checkAB('bacon and meat')); // false \ No newline at end of file diff --git a/quiz/part3/soal1.js b/quiz/part3/soal1.js new file mode 100644 index 0000000..5f49da2 --- /dev/null +++ b/quiz/part3/soal1.js @@ -0,0 +1,41 @@ +// Soal 1 +// js +function changeMe(arr) +{ + // you can only write your code here! + if (arr.length < 1) + { + console.log(`""`); + return; + } + + let avengers = {}; + + for (let i = 0; i < arr.length; i++) + { + avengers[`${arr[i][0]} ${arr[i][1]}`] = + { + firstName : arr[i][0], + lastName : arr[i][1], + gender : arr[i][2], + age : (arr[i].length > 3 ? 2023 - arr[i][3] : "Invalid Birth Year") + }; + } + + console.log(avengers); +} + +// TEST CASES +changeMe([['Christ', 'Evans', 'Male', 1982], ['Robert', 'Downey', 'Male']]); // 1. Christ Evans: +// Christ Evans: { firstName: 'Christ', +// lastName: 'Evans', +// gender: 'Male', +// age: 41 } 2023 - 1982 = 41 kan yak wkwk +// Robert Downey: { firstName: 'Robert', +// lastName: 'Downey', +// gender: 'Male', +// age: 'Invalid Birth Year' } + +//intinya bagaimana cara kalian bisa menampilkan output diatas, sebebas dan sekreatif kalian. + +changeMe([]); // "" \ No newline at end of file diff --git a/quiz/part3/soal2.js b/quiz/part3/soal2.js new file mode 100644 index 0000000..6c04365 --- /dev/null +++ b/quiz/part3/soal2.js @@ -0,0 +1,108 @@ +// Soal 2 +// js +/* +Diberikan sebuah function shoppingTime(memberId, money) yang menerima dua parameter berupa string dan number. Parameter pertama merupakan memberId dan parameter ke-2 merupakan value uang yang dibawa oleh member tersebut. + +Toko X sedang melakukan SALE untuk beberapa barang, yaitu: + +Sepatu brand Stacattu seharga 1500000 +Baju brand Zoro seharga 500000 +Baju brand H&N seharga 250000 +Sweater brand Uniklooh seharga 175000 +Casing Handphone seharga 50000 +Buatlah function yang akan mengembalikan sebuah object dimana object tersebut berisikan informasi memberId, money, listPurchased dan changeMoney. + +Jika memberId kosong maka tampilkan "Mohon maaf, toko X hanya berlaku untuk member saja" +Jika uang yang dimiliki kurang dari 50000 maka tampilkan "Mohon maaf, uang tidak cukup" +Member yang berbelanja di toko X akan membeli barang yang paling mahal terlebih dahulu dan akan membeli barang-barang yang sedang SALE masing-masing 1 jika uang yang dimilikinya masih cukup. +Contoh jika inputan memberId: '324193hDew2' dan money: 700000 + +maka output: + +{ memberId: '324193hDew2', money: 700000, listPurchased: [ 'Baju Zoro', 'Sweater Uniklooh' ], changeMoney: 25000 } +*/ + +function transaction (memberId, money) +{ + let daftarBarang = [["Sepatu Stacattu", 1500000], ["Baju Zoro", 500000], ["Baju H&N", 250000], ["Sweater Uniklooh", 175000], ["Casing Handphone", 50000]]; + + let hasilTransaksi = + { + "memberId" : memberId, + "money" : money + }; + + for (let i = 0; i < daftarBarang.length - 1; i++) + { + let swap = false; + + for (let j = 0; j < daftarBarang.length - i - 1; j++) + { + if (daftarBarang[j][1] > daftarBarang[j + 1][1]) + { + let temp = daftarBarang[j]; + daftarBarang[j] = daftarBarang[j + 1]; + daftarBarang[j + 1] = temp; + } + } + + if (swap === true) + { + break; + } + } + + let daftarBeliBarang = []; + + for (let i = daftarBarang.length - 1; i > -1; i--) + { + if (money >= daftarBarang[i][1]) + { + daftarBeliBarang.push(daftarBarang[i][0]); + money -= daftarBarang[i][1] + } + } + + hasilTransaksi.listPurchased = daftarBeliBarang; + hasilTransaksi.changeMoney = money; + + return hasilTransaksi; +} + +function shoppingTime(memberId = '', money) { + // you can only write your code here! + if (memberId === '') + { + return "Mohon maaf, toko X hanya berlaku untuk member saja"; + } + + if (money < 50000) + { + return "Mohon maaf, uang tidak cukup"; + } + + let barang = transaction(memberId, money); + + return barang; +} + +// TEST CASES +console.log(shoppingTime('1820RzKrnWn08', 2475000)); + //{ memberId: '1820RzKrnWn08', + // money: 2475000, + // listPurchased: + // [ 'Sepatu Stacattu', + // 'Baju Zoro', + // 'Baju H&N', + // 'Sweater Uniklooh', + // 'Casing Handphone' ], + // changeMoney: 0 } +console.log(shoppingTime('82Ku8Ma742', 170000)); +//{ memberId: '82Ku8Ma742', +// money: 170000, +// listPurchased: +// [ 'Casing Handphone' ], +// changeMoney: 120000 } +console.log(shoppingTime('', 2475000)); //Mohon maaf, toko X hanya berlaku untuk member saja +console.log(shoppingTime('234JdhweRxa53', 15000)); //Mohon maaf, uang tidak cukup +console.log(shoppingTime()); ////Mohon maaf, toko X hanya berlaku untuk member saja \ No newline at end of file diff --git a/quiz/part3/soal3.js b/quiz/part3/soal3.js new file mode 100644 index 0000000..ce09f2d --- /dev/null +++ b/quiz/part3/soal3.js @@ -0,0 +1,118 @@ +// Soal 3 +// js +/* +Toko X yang sedang melakukan SALE ingin menghitung jumlah profit untuk setiap jenis barang yang terjual pada hari itu. + +Barang-barang SALE yang akan dihitung penjualannya: + +Sepatu brand Stacattu seharga 1500000 dan stock barang yang tesedia 10 +Baju brand Zoro seharga 500000 dan stock barang yang tesedia 2 +Sweater brand Uniklooh seharga 175000 dan stock barang yang tersedia 1 +Function akan menerima array yang berisikan object pembeli (nama pembeli, barang yang ingin dibeli dan jumlah barang yang dibelinya). Jika stock barang kurang dari jumlah yang ingin dibeli oleh pembeli maka pembeli batal untuk membeli barang tersebut. + +Function countProfit akan mengembalikan/me-return sebuah array of object dimana array tersebut berisi objek-objek barang dari toko X tersebut yang berisikan info nama barang, siapa saja yang membeli, sisa stock barang dan total pemasukan untuk barang tersebut +*/ + +function countProfit(shoppers) +{ + var listBarang = [ ['Sepatu Stacattu', 1500000, 10], + ['Baju Zoro', 500000, 2], + ['Sweater Uniklooh', 175000, 1] + ]; + + // you can only write your code here! + + if (shoppers.length < 1) + { + return []; + } + + let listShopping = []; + for (let i = 0; i < listBarang.length; i++) + { + let tempBarangShoppers = + { + product: listBarang[i][0], + shoppers: [], + leftOver: listBarang[i][2], + harga: listBarang[i][1], + totalProfit: 0 + }; + + listShopping.push(tempBarangShoppers); + } + + // return listShopping; + + for (let i = 0; i < shoppers.length; i++) + { + for (let j = 0; j < listShopping.length; j++) + { + if (shoppers[i].product === listShopping[j].product) + { + if (listShopping[j].leftOver >= shoppers[i].amount) + { + let tempLeftOver = listShopping[j].leftOver - shoppers[i].amount; + listShopping[j].leftOver = tempLeftOver; + + listShopping[j].shoppers.push(shoppers[i].name); + + let tempTotalProfit = listShopping[j].totalProfit; + tempTotalProfit += (shoppers[i].amount * listShopping[j].harga); + listShopping[j].totalProfit = tempTotalProfit; + } + } + + } + } + + for (let i = 0; i < listShopping.length; i++) + { + delete listShopping[i].harga; + } + + return listShopping; +} + +// TEST CASES +console.log(countProfit([{name: 'Windi', product: 'Sepatu Stacattu', amount: 2}, {name: 'Vanessa', product: 'Sepatu Stacattu', amount: 3}, {name: 'Rani', product: 'Sweater Uniklooh', amount: 2}])); +//[ { product: 'Sepatu Stacattu', +// shoppers: [ 'Windi', 'Vanessa' ], +// leftOver: 5, +// totalProfit: 7500000 }, +// { product: 'Baju Zoro', +// shoppers: [], +// leftOver: 2, +// totalProfit: 0 }, +// { product: 'Sweater Uniklooh', +// shoppers: [], +// leftOver: 1, +// totalProfit: 0 } ] + +console.log(countProfit([{name: 'Windi', product: 'Sepatu Stacattu', amount: 8}, {name: 'Vanessa', product: 'Sepatu Stacattu', amount: 10}, {name: 'Rani', product: 'Sweater Uniklooh', amount: 1}, {name: 'Devi', product: 'Baju Zoro', amount: 1}, {name: 'Lisa', product: 'Baju Zoro', amount: 1}])); +// [ { product: 'Sepatu Stacattu', +// shoppers: [ 'Windi' ], +// leftOver: 2, +// totalProfit: 12000000 }, +// { product: 'Baju Zoro', +// shoppers: [ 'Devi', 'Lisa' ], +// leftOver: 0, +// totalProfit: 1000000 }, +// { product: 'Sweater Uniklooh', +// shoppers: [ 'Rani' ], +// leftOver: 0, +// totalProfit: 175000 } ] +console.log(countProfit([{name: 'Windi', product: 'Sepatu Naiki', amount: 5}])); +// [ { product: 'Sepatu Stacattu', +// shoppers: [], +// leftOver: 10, +// totalProfit: 0 }, +// { product: 'Baju Zoro', +// shoppers: [], +// leftOver: 2, +// totalProfit: 0 }, +// { product: 'Sweater Uniklooh', +// shoppers: [], +// leftOver: 1, +// totalProfit: 0 } ] +console.log(countProfit([])); //[] \ No newline at end of file diff --git a/quiz/ujian/soal1.js b/quiz/ujian/soal1.js new file mode 100644 index 0000000..1c2e341 --- /dev/null +++ b/quiz/ujian/soal1.js @@ -0,0 +1,76 @@ +// Soal 1 +// js +/* +Implementasikan function deepSum untuk mendapatkan jumlah pertambahan dari angka-angka yang terdapat di dalam array +*/ + +function deepSum (arr) +{ + // Code disini + if (arr.length < 1) + { + return "No number"; + } + + function sumArrayMultiDimensi (arr) + { + let jumlah = 0; + for (let i = 0; i < arr.length; i++) + { + if (Array.isArray(arr[i])) + { + jumlah += sumArrayMultiDimensi(arr[i]) + } + else if (typeof arr[i] === 'number') + { + jumlah += arr[i]; + } + } + + return jumlah; + } + + return sumArrayMultiDimensi(arr); +} + +//TEST CASE +console.log(deepSum([ + [ + [4, 5, 6], + [9, 1, 2, 10], + [9, 4, 3] + ], + [ + [4, 14, 31], + [9, 10, 18, 12, 20], + [1, 4, 90] + ], + [ + [2, 5, 10], + [3, 4, 5], + [2, 4, 5, 10] + ] +])); // 316 + +console.log(deepSum([ + [ + [20, 10], + [15], + [1, 1] + ], + [ + [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], + [2], + [9, 11] + ], + [ + [3, 5, 1], + [1, 5, 3], + [1] + ], + [ + [2] + ] +])); // 156 + +console.log(deepSum([])); // No number \ No newline at end of file diff --git a/quiz/ujian/soal2.js b/quiz/ujian/soal2.js new file mode 100644 index 0000000..bd8150d --- /dev/null +++ b/quiz/ujian/soal2.js @@ -0,0 +1,66 @@ +// Soal 2 +// js +/* +Diberikan function naikAngkot(listPenumpang) yang akan menerima satu parameter berupa array dua dimensi. Function akan me-return array of object. + +Diberikan sebuah rute, dari A - F. Penumpang diwajibkan membayar Rp2000 setiap melewati satu rute. + +Contoh: input: [['Dimitri', 'B', 'F']] output: [{ penumpang: 'Dimitri', naikDari: 'B', tujuan: 'F', bayar: 8000 }] +*/ + +function naikAngkot(arrPenumpang) +{ + let rute = ['A', 'B', 'C', 'D', 'E', 'F']; + //your code here + + if (arrPenumpang.length < 1) + { + return []; + } + + let listPenumpangBayarRute = []; + for (let i = 0; i < arrPenumpang.length; i++) + { + let tempPenumpangBayarRute = + { + penumpang: arrPenumpang[i][0], + naikDari: arrPenumpang[i][1], + tujuan: arrPenumpang[i][2] + }; + + listPenumpangBayarRute.push(tempPenumpangBayarRute); + } + + for (let i = 0; i < listPenumpangBayarRute.length; i++) + { + let cek = false; + let indeksAwal = -1; + for (let j = 0; j < rute.length; j++) + { + if (cek) + { + if (rute[j] === listPenumpangBayarRute[i].tujuan) + { + listPenumpangBayarRute[i].bayar = (j - indeksAwal) * 2000; + break; + } + } + + if (rute[j] === listPenumpangBayarRute[i].naikDari && cek === false) + { + indeksAwal = j; + cek = true; + } + + } + } + + return listPenumpangBayarRute; +} + +//TEST CASE +console.log(naikAngkot([['Dimitri', 'B', 'F'], ['Icha', 'A', 'B']])); +// [ { penumpang: 'Dimitri', naikDari: 'B', tujuan: 'F', bayar: 8000 }, +// { penumpang: 'Icha', naikDari: 'A', tujuan: 'B', bayar: 2000 } ] + +console.log(naikAngkot([])); //[] \ No newline at end of file diff --git a/quiz/ujian/soal3.js b/quiz/ujian/soal3.js new file mode 100644 index 0000000..415239c --- /dev/null +++ b/quiz/ujian/soal3.js @@ -0,0 +1,101 @@ +// Soal 3 +// js +function highestScore (students) +{ + // Code disini + if (students.length < 1) + { + return {}; + } + + let highScoreStudents = {}; + + for (let i = 0; i < students.length; i++) + { + if (highScoreStudents.hasOwnProperty(students[i].class)) + { + if (students[i].score > highScoreStudents[students[i].class].score) + { + highScoreStudents[students[i].class].name = students[i].name; + highScoreStudents[students[i].class].score = students[i].score; + } + } + else + { + highScoreStudents[students[i].class] = + { + name: students[i].name, + score: students[i].score + }; + } + } + + return highScoreStudents; +} + +// TEST CASE +console.log(highestScore([ + { + name: 'Dimitri', + score: 90, + class: 'foxes' + }, + { + name: 'Alexei', + score: 85, + class: 'wolves' + }, + { + name: 'Sergei', + score: 74, + class: 'foxes' + }, + { + name: 'Anastasia', + score: 78, + class: 'wolves' + } +])); + +// { +// foxes: { name: 'Dimitri', score: 90 }, +// wolves: { name: 'Alexei', score: 85 } +// } + + +console.log(highestScore([ + { + name: 'Alexander', + score: 100, + class: 'foxes' + }, + { + name: 'Alisa', + score: 76, + class: 'wolves' + }, + { + name: 'Vladimir', + score: 92, + class: 'foxes' + }, + { + name: 'Albert', + score: 71, + class: 'wolves' + }, + { + name: 'Viktor', + score: 80, + class: 'tigers' + } +])); + +// { +// foxes: { name: 'Alexander', score: 100 }, +// wolves: { name: 'Alisa', score: 76 }, +// tigers: { name: 'Viktor', score: 80 } +// } + + +console.log(highestScore([])); //{} \ No newline at end of file diff --git a/quiz/ujian/soal4.js b/quiz/ujian/soal4.js new file mode 100644 index 0000000..316df8f --- /dev/null +++ b/quiz/ujian/soal4.js @@ -0,0 +1,131 @@ +// Soal 4 +// js +/* +Implementasikan function graduates untuk mendapatkan daftar student yang lulus dengan aturan: + +Student dapat dinyatakan lulus apabila score lebih besar dari 75. +Masukkan name dan score dari student ke class yang dia ikuti. +Student yang tidak lulus tidak perlu ditampilkan. +Output yang diharapkan berupa Object dengan format sebagai berikut: + +{ + : [ + { name: , score: }, + ... + ], + : [ + { name: , score: }, + ... + ], + : [] //NOTE: Jika tidak ada student yang lulus, class ini akan diisi oleh array kosong +} +*/ + +function graduates (students) { + // Code disini + if (students.length < 1) + { + return {}; + } + + let graduateStudents = {}; + + for (let i = 0; i < students.length; i++) + { + if (graduateStudents.hasOwnProperty(students[i].class)) + { + if (students[i].score > 75) + { + graduateStudents[students[i].class].push({name: students[i].name, score: students[i].score}); + } + } + else + { + graduateStudents[students[i].class] = []; + + if (students[i].score > 75) + { + graduateStudents[students[i].class].push({name: students[i].name, score: students[i].score}); + } + } + } + + return graduateStudents; +} + +console.log(graduates([ + { + name: 'Dimitri', + score: 90, + class: 'foxes' + }, + { + name: 'Alexei', + score: 85, + class: 'wolves' + }, + { + name: 'Sergei', + score: 74, + class: 'foxes' + }, + { + name: 'Anastasia', + score: 78, + class: 'wolves' + } +])); + +// { +// foxes: [ +// { name: 'Dimitri', score: 90 } +// ], +// wolves: [ +// { name: 'Alexei' , score: 85 }, +// { name: 'Anastasia', score: 78 } +// ] +// } + +console.log(graduates([ + { + name: 'Alexander', + score: 100, + class: 'foxes' + }, + { + name: 'Alisa', + score: 76, + class: 'wolves' + }, + { + name: 'Vladimir', + score: 92, + class: 'foxes' + }, + { + name: 'Albert', + score: 71, + class: 'wolves' + }, + { + name: 'Viktor', + score: 80, + class: 'tigers' + } +])); + +// { +// foxes: [ +// { name: 'Alexander', score: 100 }, +// { name: 'Vladimir', score: 92 } +// ], +// wolves: [ +// { name: 'Alisa', score: 76 }, +// ], +// tigers: [ +// { name: 'Viktor', score: 80 } +// ] +// } + + +console.log(graduates([])); //{} \ No newline at end of file