0% found this document useful (0 votes)

183 views112 pages

JS Basic Q's

This document contains code snippets that demonstrate various JavaScript functions and methods for working with dates, strings, numbers, and other data types. Some key functions include: - Getting the current date/time and formatting it - Checking if a year is a leap year - Finding the maximum, minimum, or numbers within a given range of other numbers - Manipulating and checking properties of strings like length, characters, and substrings - Basic math operations and conditional logic The document contains over 40 short code snippets that each test a JavaScript function, many related to validating, manipulating, or comparing different data types through conditionals and returning true/false.

Uploaded by

Aibrahim84

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

183 views112 pages

JS Basic Q's

Uploaded by

Aibrahim84

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

You are on page 1/ 112

const today = new Date();

const day = today.getDay();

const daylist = ["Sunday","Monday","Tuesday","Wednesday ","Thursday","Friday","Saturday"];
console.log(`Today is : ${daylist[day]}.`); // // Today is : Tuesday.

let hour = today.getHours();

const minute = today.getMinutes();
const second = today.getSeconds();
let prepand = (hour >= 12)? " PM ":" AM ";

hour = (hour >= 12)? hour - 12: hour;

if (hour===0 && prepand===' PM ') {
if (minute===0 && second===0){
hour=12;
prepand=' Noon';
} else {
hour=12;
prepand=' PM';
}
}
if (hour===0 && prepand===' AM ') {
if (minute===0 && second===0) {
hour=12;
prepand=' Midnight';
} else {
hour=12;
prepand=' AM';
}
}
console.log(`Current Time : ${hour}${prepand} : ${minute} : ${second}`);
// Current Time : 10 PM : 30 : 38
let today = new Date();
let dd = today.getDate();

let mm = today.getMonth()+1;
const yyyy = today.getFullYear();

if(dd<10) {
dd=`0${dd}`;
}

if(mm<10) {
mm=`0${mm}`;
}
today = `${mm}-${dd}-${yyyy}`;
console.log(today); // 01-09-2018
today = `${mm}/${dd}/${yyyy}`;
console.log(today); // 01/09/2018
today = `${dd}-${mm}-${yyyy}`;
console.log(today); // 09-01-2018
today = `${dd}/${mm}/${yyyy}`;
console.log(today); // 09/01/2018

const side1 = 5;
const side2 = 6;
const side3 = 7;
const perimeter = (side1 + side2 + side3)/2;
const area = Math.sqrt(perimeter*((perimeter-side1)*(perimeter-
side2)*(perimeter-side3)));
console.log(area); // 14.696938456699069
leapyear = (year) => {
return (year % 100 === 0) ? (year % 400 === 0) : (year % 4 === 0);
}

console.log(leapyear(2016)); // true
console.log(leapyear(2000)); // true
console.log(leapyear(1700)); // false
console.log(leapyear(1800)); // false
console.log(leapyear(100)); // false

console.log('--------------------');
for (var year = 2014; year <= 2050; year++) {
var d = new Date(year, 0, 1);
if ( d.getDay() === 0 ) {
console.log("1st January is being a Sunday "+year);
}
}
console.log('--------------------');
Output
--------------------
1st January is being a Sunday 2017
1st January is being a Sunday 2023
1st January is being a Sunday 2034
1st January is being a Sunday 2040
1st January is being a Sunday 2045
--------------------

var num = Math.ceil(Math.random() * 10);

<body>
<form>
1st Number : <input type="text" id="firstNumber" /><br>
2nd Number: <input type="text" id="secondNumber" /><br>
<input type="button" onClick="multiplyBy()" Value="Multiply" />
<input type="button" onClick="divideBy()" Value="Divide" />
</form>
<p>The Result is : <br>
<span id = "result"></span>
</p>
</body>

multiplyBy = () => {
num1 = document.getElementById("firstNumber").value;
num2 = document.getElementById("secondNumber").value;
document.getElementById("result").innerHTML = num1 * num2;
}
divideBy = () => {
num1 = document.getElementById("firstNumber").value;
num2 = document.getElementById("secondNumber").value;
document.getElementById("result").innerHTML = num1 / num2;
}
cToF = (celsius) => {
var cTemp = celsius;
var cToFahr = cTemp * 9 / 5 + 32;
var message = cTemp+'\xB0C is ' + cToFahr + ' \xB0F.';
console.log(message);
}

fToC = (fahrenheit) => {

var fTemp = fahrenheit;
var fToCel = (fTemp - 32) * 5 / 9;
var message = fTemp+'\xB0F is ' + fToCel + '\xB0C.';
console.log(message);
}

cToF(60); // 60°C is 140°F.

fToC(45); // 45°F is 7.222222222222222°C.
const var_name = 'abcd';
const n = 120;
this[var_name] = n;

console.log(this[var_name]) // 120

filename = "system.php"
console.log(filename.split('.').pop()); //php
filename = "abc.js"
console.log(filename.split('.').pop()); //js
difference = (n) => {
if (n <= 13)
return 13 - n;
else
return (n - 13) * 2;
}

console.log(difference(32)) // 32
console.log(difference(11)) // 2

function sumTriple (x, y) {

if (x == y) {
return 3 * (x + y);
} else {
return (x + y);
}
}
console.log(sumTriple(10, 20)); // 30
console.log(sumTriple(10, 10)); // 60

testhundred = (x) => {

return ((Math.abs(100 - x) <= 20) || (Math.abs(400 - x) <= 20));
}

console.log(testhundred(10)); // false
console.log(testhundred(90)); // true
console.log(testhundred(99)); // true
console.log(testhundred(199)); // false
console.log(testhundred(200)); // false
positive_negative = (x, y) => {
if ((x < 0 && y > 0) || x > 0 && y < 0) {
return true;
} else {
return false;
}
}
console.log(positive_negative(2, 2)); // false
console.log(positive_negative(-2, 2)); // true
console.log(positive_negative(2, -2)); // true
console.log(positive_negative(-2, -2)); // false
string_check = (str1) => {
if (str1 === null || str1 === undefined || str1.substring(0, 2) === 'Py') {
return str1;
}

return "Py"+str1;
}
console.log(string_check("Python")); // Python
console.log(string_check("thon")); // Python
remove_character = (str, char_pos) => {
part1 = str.substring(0, char_pos);
part2 = str.substring(char_pos + 1, str.length);
return (part1 + part2);
}
console.log(remove_character("Python",0)); // ython
console.log(remove_character("Python",3)); // Pyton
console.log(remove_character("Python",5)); // Pytho
first_last = (str1) => {
if (str1.length <= 1) {
return str1;
}
mid_char = str1.substring(1, str1.length - 1);
return (str1.charAt(str1.length - 1)) + mid_char + str1.charAt(0);
}
console.log(first_last('a')); // a
console.log(first_last('ab'));// ba
console.log(first_last('abc'));// cba

front_back = (str) => {

first = str.substring(0,1);
return first + str + first;
}
console.log(front_back('a'));//aaa
console.log(front_back('ab'));//aaba
console.log(front_back('abc'));//aabca
test37 = (x) => {
if (x % 3 == 0 || x % 7 == 0) {
return true;
} else {
return false;
}
}
console.log(test37(12)); // true
console.log(test37(14)); // true
console.log(test37(10)); // false
console.log(test37(11)); // false
front_back3 = (str) => {
if (str.length>=3) {
str_len = 3;
back = str.substring(str.length-3);
return back + str + back;
} else {
return false;
}
}
console.log(front_back3("abc")); // abcabcabc
console.log(front_back3("ab")); // false
console.log(front_back3("abcd"));// bcdabcdbcd
start_spec_str = (str) => {
if (str.length < 4) {
return false;
}

front = str.substring(0, 4);

if (front == 'Java') {
return true;
} else {
return false;
}
}
console.log(start_spec_str("JavaScript"));// true
console.log(start_spec_str("Java")); // true
console.log(start_spec_str("Python")); // false
check_numbers = (x, y) => {
if ((x >= 50 && x <= 99) || (y >= 50 && y <= 99)) {
return true;
} else {
return false;
}
}
console.log(check_numbers(12, 101)); // false
console.log(check_numbers(52, 80)); // true
console.log(check_numbers(15, 99)); // true
check_three_nums = (x, y, z) => {
return (x >= 50 && x <= 99)
|| (y >= 50 && y <= 99)
|| (z >= 50 && z <= 99);
}
console.log(check_three_nums(50, 90, 99)); // true
console.log(check_three_nums(5, 9, 199)); // false
console.log(check_three_nums(65, 89, 199)); // true
console.log(check_three_nums(65, 9, 199)); // true
check_script = (str) =>{
if (str.length < 6) {
return str;
}

let result_str = str;

if (str.substring(10, 4) == 'Script') {
result_str = str.substring(0, 4) + str.substring(10,str.length);
}
return result_str;
}
console.log(check_script("JavaScript")); // Java
console.log(check_script("CoffeeScript"));// CoffeeScript
max_of_three = (x, y, z) => {
max_val = 0;
if (x > y) {
max_val = x;
} else {
max_val = y;
}

if (z > max_val) {
max_val = z;
}
return max_val;
}
console.log(max_of_three(1,0,1)); // 1
console.log(max_of_three(0,-10,-20)); // 0
console.log(max_of_three(1000,510,440));// 1000
near_100 = (x, y) => {
if (x != y){
x1 = Math.abs(x - 100);
y1 = Math.abs(y - 100);

if (x1 < y1){

return x;
}
if (y1 < x1){
return y;
}
return 0;
} else {
return false;
}
}

console.log(near_100(90, 89)); // 90
console.log(near_100(-90, -89));//-89
console.log(near_100(90, 90)); //false
numbers_ranges = (x, y) => {
if ((x >= 40 && x <= 60 && y >= 40 && y <= 60) ||
(x >= 70 && x <= 100 && y >= 70 && y <= 100)) {
return true;
} else {
return false;
}
}
console.log(numbers_ranges(44, 56)); // true
console.log(numbers_ranges(70, 95)); // true
console.log(numbers_ranges(50, 89)); // false
max_townums_range = (x, y) => {
if (x >= 40 && y <= 60) {
let max_val =0
if (x > y) {
max_val =x;
} else {
max_val =y;
return max_val;
}
} else {
return false;
}
}
console.log(max_townums_range(45, 60)); // 60
console.log(max_townums_range(25, 60)); // false
console.log(max_townums_range(45, 80)); // false
check_char = (str, char) => {
ctr = 0;
for (let i = 0; i < str.length; i++) {
if (str.charAt(i) == char) {
ctr++;
}
}
return (ctr >= 2 && ctr <= 4);
}
console.log(check_char("Python", "y")); // false
console.log(check_char("JavaScript", "a"));// true
console.log(check_char("Console", "o"));// true
last_digit = (x, y, z) => {
if ((x > 0) && y > 0 && z > 0) {
return (x % 10 == y % 10 && y % 10 == z % 10 && x % 10 == z % 10);
} else {
return false;
}
}
console.log(last_digit(20, 30, 400)); // true
console.log(last_digit(-20, 30, 400)); // false
console.log(last_digit(20, -30, 400)); // false
console.log(last_digit(20, 30, -400)); // false
upper_lower = (str) => {
if (str.length < 3) {
return str.toUpperCase();
}
front_part = (str.substring(0, 3)).toLowerCase();
back_part = str.substring(3, str.length);
return front_part + back_part;
}
console.log(upper_lower("Python")); // python
console.log(upper_lower("Py")); // PY
console.log(upper_lower("JAVAScript"));// javAScript
exam_status = (totmarks,is_exam) => {
if (is_exam) {
return totmarks >= 90;
}
return (totmarks >= 89 && totmarks <= 100);
}
console.log(exam_status("78", " ")); // false
console.log(exam_status("89", "true ")); // false
console.log(exam_status("99", "true ")); // true

sortaSum = (x, y) => {

if (x + y == 8 || Math.abs(x - y) == 8){
return true;
}
return false;
}
console.log(check8(7, 8)); // true
console.log(check8(16, 8)); // true
console.log(check8(24, 32)); // true
console.log(check8(17, 18)); // false
three_numbers = (x, y, z) => {
if (x == y && y == z) {
return 30;
}

if (x == y || y == z || z == x) {
return 40;
}

return 20;
}
console.log(three_numbers(8, 8, 8)); //30
console.log(three_numbers(8, 8, 18));//40
console.log(three_numbers(8, 7, 18));//20

number_order = (x, y, z ) => {

if ( y > x && z > y) {
return "strict mode";
} else if(z > y){
return "Soft mode";
} else {
return "Undefinded";
}
}
console.log(number_order(10,15,31)); // strict mode
console.log(number_order(24,22,31)); // Soft mode
console.log(number_order(50,21,15)); // Undefinded
same_last_digit = (p, q, r) => {
return (p % 10 === q % 10) ||
(p % 10 === r % 10) ||
(q % 10 === r % 10);

}
console.log(same_last_digit(22,32,42)); // true
console.log(same_last_digit(102,302,2)); // true
console.log(same_last_digit(20,22,45)); // false
lessby20_others = (x, y, z) => {
return (x >= 20 && (x < y || x < z)) ||
(y >= 20 && (y < x || y < z)) ||
(z >= 20 && (z < y || z < x));
}
console.log(lessby20_others(23, 45, 10)); // true
console.log(lessby20_others(23, 23, 10)); // false
console.log(lessby20_others(21, 66, 75)); // true
test_nmuber = (x, y) => {
return (x === 15 ||
y === 15 ||
x + y === 15 ||
Math.abs(x - y) === 15);
}

console.log(test_nmuber(15, 9));// true

console.log(test_nmuber(25, 15)); // true
console.log(test_nmuber(7, 8)); // true
console.log(test_nmuber(25, 10)); // true
console.log(test_nmuber(5, 9)); // false
console.log(test_nmuber(7, 9)); // false
console.log(test_nmuber(9, 25)); // false

valCheck = (a, b) => {

if (!((a % 7 == 0 || a % 11 == 0) &&
(b % 7 == 0 || b % 11 == 0))) {
return ((a % 7 == 0 || a % 11 == 0) ||
(b % 7 == 0 || b % 11 == 0));
} else {
return false;
}
}
console.log(valCheck(14, 21)); // false
console.log(valCheck(14, 20)); // true
console.log(valCheck(16, 20)); // false
test_digit = (x, y, n) => {
if (n < 40 || n > 10000){
return false;
} else {
if (n >= x && n <= y){
return true;
}else {
return false;
}
}
}
console.log(test_digit(40, 4000, 45)); // true
console.log(test_digit(80, 320, 79)); // false
console.log(test_digit(89, 4000, 30)); // false
string_reverse = (str) => {
return str.split("").reverse().join("");
}
console.log(string_reverse("w3resource")); // ecruoser3w
console.log(string_reverse("www")); // www
console.log(string_reverse("JavaScript"));// tpircSavaJ
LetterChanges = (text) => {
//https://goo.gl/R8gn7u
var s = text.split('');
for(var i = 0; i < s.length; i++) {
// Caesar cipher
switch(s[i]) {
case ' ':
break;
case 'z':
s[i] = 'a';
break;
case 'Z':
s[i] = 'A';
break;
default:
s[i] = String.fromCharCode(1 + s[i].charCodeAt(0));
}

// Upper-case vowels
switch(s[i]) {
case 'a': case 'e': case 'i': case 'o': case 'u':
s[i] = s[i].toUpperCase();
}
}
return s.join('');
}
console.log(LetterChanges("PYTHON")); // QZUIPO
console.log(LetterChanges("W3R")); // X4S
console.log(LetterChanges("php")); // qIq
capital_letter = (str) => {
str = str.split(" ");
for (var i = 0, x = str.length; i < x; i++) {
str[i] = str[i][0].toUpperCase() + str[i].substr(1);
}
return str.join(" ");
}

console.log(capital_letter("Write a JavaScript program to

capitalize the first letter of each word of a given string."));
// Write A JavaScript Program To Capitalize The First Letter Of
Each Word Of A Given String.

time_convert = (num) => {

const hours = Math.floor(num / 60);
const minutes = num % 60;
return hours + ":" + minutes;
}
console.log(time_convert(71)); // 1:11
console.log(time_convert(450)); // 7:30
console.log(time_convert(1441)); // 24:1
function alphabet_Soup(str) {
return str.split("").sort().join("");
}
console.log(alphabet_Soup("Python")); // Phnoty
console.log(alphabet_Soup("Exercises"));// Eceeirssx
ab_Check = (str) => {
return (/a...b/).test(str) ||
(/b...a/).test(str);
}
console.log(ab_Check("Chainsbreak"));// true
console.log(ab_Check("pane borrowed"));// true
console.log(ab_Check("abCheck"));// false

vowel_Count = (str) => {

return str.replace(/[^aeiou]/g, "").length;
}
console.log(vowel_Count("Python")); // 1
console.log(vowel_Count("w3resource.com")); // 5
equal_pt = (str) => {
const str_p = str.replace(/[^p]/g, "");
const str_t = str.replace(/[^t]/g, "");
const p_num = str_p.length;
const s_num = str_t.length;
return p_num === s_num;
}
console.log(equal_pt("paatpss"));// false
console.log(equal_pt("paatps"));// false

division_string = (n1, n2) => {

n1 = 80;
n2 = 6;
var div = Math.round(n1 / n2).toString(),
result_array = div.split("");

if (div >= 1000){

for (var i = div.length - 3; i > 0; i -= 3) {
result_array.splice(i, 0, ",");
}
result_array;
}
console.log(result_array); // ["1","3"]
string_copies = (str, n) => {
if (n < 0) {
return false;
} else {
return str.repeat(n);
}
}
console.log(string_copies("abc", 5)); // abcabcabcabcabc
console.log(string_copies("abc", 0)); //
console.log(string_copies("abc", -2)); // false
newstring = (str) => {
if (str.length >= 3) {
result_str = str.substring(str.length - 3);
return result_str + result_str + result_str + result_str;
} else {
return false;
}
}
console.log(newstring("Python 3.0")); // 3.03.03.03.0
console.log(newstring("JS")); // false
console.log(newstring("JavaScript")); // iptiptiptipt
first_half = (str) => {
if (str.length % 2 == 0) {
return str.slice(0, str.length / 2);
}
return str;
}
console.log(first_half("Python")); // Pyt
console.log(first_half("JavaScript")); // JavaS
console.log(first_half("PHP")); // PHP
without_first_end = (str) => {
return str.substring(1, str.length - 1);
}
console.log(without_first_end('JavaScript')); // avaScrip
console.log(without_first_end('JS')); //
console.log(without_first_end('PHP')); // H

concatenate = (str1, str2) => {

str1 = str1.substring(1, str1.length);
str2 = str2.substring(1, str2.length);
return str1 + str2;
}

console.log(concatenate("PHP","JS")); // HPS
console.log(concatenate("A","B")); //
console.log(concatenate("AA","BB")); // AB
right_three = (str) => {
if (str.length > 1){
return str.slice(-3) + str.slice(0, -3);
}
return str;
}
console.log(right_three("Python")); // honPyt
console.log(right_three("JavaScript")); // iptJavaScr
console.log(right_three("Hi")); // Hi
middle_three = (str) => {
if (str.length % 2!= 0) {
mid = (str.length + 1)/2;
return str.slice(mid - 2, mid + 1);
}
return str;
}
console.log(middle_three('abcdefg')); // cde
console.log(middle_three('HTML5')); // TML
console.log(middle_three('Python')); // Python
console.log(middle_three('PHP')); // PHP
console.log(middle_three('Exercises')); // rci
str_con_cat = (str1, str2) => {
const m = Math.min(str1.length, str2.length);
return str1.substring(str1.length - m) + str2.substring(str2.length - m);
}
console.log(str_con_cat("Python", "JS")); // onJS
console.log(str_con_cat("ab", "cdef")); // abef
end_script = (str) => {
if (str.substring(str.length - 6, str.length) == 'Script') {
return true;
} else {
return false;
}
}
console.log(end_script("JavaScript"));// true
console.log(end_script("Java Script"));// true
console.log(end_script("Java Scripts"));// false

city_name = (str) => {

if(str.length >= 3 &&
((str.substring(0, 3) == 'Los') ||
(str.substring(0, 3) == 'New'))) {
return str;
}
return '';
}

console.log(city_name("New York"));// New York

console.log(city_name("Los Angeles"));// Los Angeles
console.log(city_name("London"));//
nop = (str) => {
let start_pos = 0;
let end_pos = str.length;
if (str.length > 0 && str.charAt(0) == 'P') {
start_pos = 1;
}
if (str.length > 1 && str.charAt(str.length - 1) == 'P') {
end_pos--;
}
return str.substring(start_pos, end_pos);
}

console.log(nop("PythonP")); // ython
console.log(nop("Python")); // ython
console.log(nop("JavaScript"));// JavaScript
two_string = (str, n) => {
first_part = str.substring(0, n);
last_part = str.substring(str.length - n);
return first_part + last_part;
}
console.log(two_string("JavaScript", 2)); // Japt
console.log(two_string("JavaScript", 3)); // Javipt
sum_three = (nums) => {
return nums[0] + nums[1] + nums[2];
}
console.log(sum_three([10, 32, 20])); // 62
console.log(sum_three([5, 7, 9])); // 21
console.log(sum_three([0, 8, -11])); // -3
rotate_elements_left = (array) => {
return [array[1], array[2], array[0]];
}
console.log(rotate_elements_left([3, 4, 5])); // [4,5,3]
console.log(rotate_elements_left([0, -1, 2])); // [-1,2,0]
console.log(rotate_elements_left([7, 6, 5])); // [6,5,7]

first_last_1 = (nums) => {

middle_elements = (a, b) => {

longest_string = (str_ara) => {

console.log(angle_Type(47)); // Acute angle.

console.log(angle_Type(90)); // Right angle.
console.log(angle_Type(145)); // Obtuse angle.
console.log(angle_Type(180)); // Straight angle.
array_checking = (arra1, arra2) => {
for(let i = 0; i < arra1.length; i++) {
for(let j = i; j < arra1.length; j++) {
let result = true;
const temp = arra1[i];
arra1[i] = arra1[j];
arra1[j] = temp;
for(let k = 0; k < arra1.length; k++) {
if(arra1[k] !== arra2[k]) {
result = false;
break;
}
}
if(result) {
return true;
}
arra1[j] = arra1[i];
arra1[i] = temp;
}
}
return false;
}
console.log(array_checking([10,20,30], [10,20,30])); // true
console.log(array_checking([10,20,30], [30,10,20])); // true
console.log(array_checking([10,20,30,40], [10,30,20,40])); // false
checking_numbers = (x, y, divisor) => {
if(x % divisor === 0 &&
y % divisor === 0 ||
x % divisor !== 0 &&
y % divisor !== 0) {
return true;
}
return false;
}
console.log(checking_numbers(10, 25, 5)); // true
console.log(checking_numbers(10, 20, 5)); // true
console.log(checking_numbers(10, 20, 4)); // false
check_arithmetic_Expression = (x, y, z) => {
return x + y == z ||
x * y == z ||
x / y == z ||
x - y == z;
}
console.log(check_arithmetic_Expression(10, 25, 35)); // true
console.log(check_arithmetic_Expression(10, 25, 250)); // true
console.log(check_arithmetic_Expression(30, 25, 5)); // true
console.log(check_arithmetic_Expression(100, 25, 4.0)); // true
console.log(check_arithmetic_Expression(100, 25, 25)); // false
Kth_greatest_in_array = (arr, k) => {
for(let i = 0; i < k; i++) {
let max_index = i;
const tmp = arr[i];
for(let j = i + 1; j < arr.length; j++) {
if (arr[j] > arr[max_index]) {
max_index = j;
}
}
arr[i] = arr[max_index];
arr[max_index] = tmp;
}
return arr[k - 1];
}
console.log(Kth_greatest_in_array([1,2,3,4,5], 3)); // 3
console.log(Kth_greatest_in_array([-10,-25,-47,-36,0], 1)); // 0
array_max_consecutive_sum = (nums, k) => {
let result = 0;
let temp_sum = 0;
for (var i = 0; i < k - 1; i++) {
temp_sum += nums[i];
}
for (var i = k - 1; i < nums.length; i++) {
temp_sum += nums[i];
if (temp_sum > result) {
result = temp_sum;
}
temp_sum -= nums[i - k + 1];
}
return result;
}
console.log(array_max_consecutive_sum([1, 2, 3, 14, 5], 2)); // 19
console.log(array_max_consecutive_sum([2, 3, 5, 1, 6], 3)); // 12
console.log(array_max_consecutive_sum([9, 3, 5, 1, 7], 2)); // 12
function max_difference(arr) {
let max = -1;
let temp;
for(let i = 0; i < arr.length - 1; i++) {
temp = Math.abs(arr[i] - arr[i + 1]);
max = Math.max(max, temp);
}
return max;
}
console.log(max_difference([1, 2, 3, 8, 9])); // 5
console.log(max_difference([1, 2, 3, 18, 9])); // 15
console.log(max_difference([13, 2, 3, 8, 9])); // 11

array_max_diff = (arr) => {

console.log(sum_adjacent_difference([1, 2, 3, 2, -5])); // 10
function build_Palindrome(new_str) {
let flag;
for (let i = new_str.length;; i++) {
flag = true;
for (var j = 0; j < i - j - 1; j++) {
if (i - j - 1 < new_str.length && new_str[j] != new_str[i - j - 1]) {
flag = false;
break;
}
}
if (flag) {
for (var j = new_str.length; j < i; j++) {
new_str += new_str[i - j - 1];
}
return new_str;
}
}
}

console.log(build_Palindrome("abcddc")); // abcddcba
console.log(build_Palindrome("122")); // 1221

change_case = (new_str) => {

for(let i = 0; i < Math.max(first_set.length, second_set.length); i++) {

if (first_set[i] !== second_set[i]) {
result = false;
}
}
return result;
}
console.log(rearrangement_characters("xyz", "zyx")); // true
console.log(rearrangement_characters("xyz", "zyp")); // false

check_common_element = (arra1, arra2) => {

for (var i = 0; i < arra1.length; i++) {
if (arra2.indexOf(arra1[i]) != -1) {
return true;
}
}
return false;
}
console.log(check_common_element([1,2,3], [3,4,5])); // true
console.log(check_common_element([1,2,3], [5,6,7])); // false
test_string = (input_str) => {
const is_lower_case = symbol => {
if ('a' <= symbol && symbol <= 'z') {
return true;
}
return false;
};

const is_upper_case = symbol => {

if ('A' <= symbol && symbol <= 'Z') {
return true;
}
return false;
};

const is_first_char_lower = is_lower_case(input_str[0]);

const is_first_char_upper = is_upper_case(input_str[0]);
if (!(is_first_char_lower || is_first_char_upper)) {
return false;
}

for (let i = 1; i < input_str.length; i++) {

if (i % 2) {
if (is_lower_case(input_str[i]) === is_first_char_lower || is_upper_case(input_str[i]) === is_first_char_upper) {
return false;
}
} else {
if (is_lower_case(input_str[i]) !== is_first_char_lower || is_upper_case(input_str[i]) !== is_first_char_upper) {
return false;
}
}
}
return true;
}
console.log(test_string('xYr')); // true
console.log(test_string('XXyx')); // false
number_of_InversionsNaive = (arr) => {
let ctr = 0;
for (let i = 0; i < arr.length; i++) {
for (let j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
ctr++;
}
}
}
return ctr;
}

console.log(number_of_InversionsNaive([0, 3, 2, 5, 9])); // 1
console.log(number_of_InversionsNaive([1, 5, 4, 3])); // 3
console.log(number_of_InversionsNaive([10, 30, 20, -10])); // 4
digit_delete = (num) => {
let result = 0;
const num_digits = [];
while (num) {
num_digits.push(num % 10);
num = Math.floor(num / 10);
}
for (let index_num = 0; index_num < num_digits.length; index_num++) {
let n = 0;
for (let i = num_digits.length - 1; i >= 0; i--) {
if (i !== index_num) {
n = n * 10 + num_digits[i];
}
}
result = Math.max(n, result);
}
return result;
}

console.log(digit_delete(100));
console.log(digit_delete(10));
console.log(digit_delete(1245));

different_values = (ara, n) => {

let result = 0;
while (num >= 10) {
result += 1;
num = digitSum(num);
}
return result;
}

console.log(digit_to_one(123)); // 1
console.log(digit_to_one(156)); // 2
divide_digit = (num, d) => {
if (d==1){
return num;
} else {
while (num % d === 0) {
num /= d;
}
}
return num;
}
}
console.log(divide_digit(-12, 2)); // -3
console.log(divide_digit(13, 2)); // 13
console.log(divide_digit(13, 1)); // 13

arr_pairs = (arr) => {

sort_prime = (num) => {

console.log(sort_prime(5)); // [2,3,5]
console.log(sort_prime(11)); // [2,3,5,7,11]
console.log(sort_prime(19)); // [2,3,5,7,11,13,17,19]
find_numbers = (arr_num, num) => {
let result = 0;
for(let i = 0; i < arr_num.length; i++) {
if(arr_num[i] % 2 === 0 && arr_num[i] !== num) {
result++;
}
if(arr_num[i] === num) {
return result;
}
}
return -1;
}

console.log(find_numbers([1,2,3,4,5,6,7,8], 5)); // 2
console.log(find_numbers([1,3,5,6,7,8], 6)); // 0
find_third_number = (x, y, z) => {
if((x!==y) && (x!==z) && (y!==z)) {
return "Three numbers are unequal.";
}
if(x==y) {
return z;
}
if(x==z) {
return y;
}
return x;
}

console.log(find_third_number(1,2,2)); // 1
console.log(find_third_number(1,1,2)); // 2
console.log(find_third_number(1,2,3)); // Three numbers are unequal.

trailing_zeros_factorial = (n) => {

let result = 0;
for (let i = 5; i <= n; i += 5) {
let num = i;
while (num % 5 === 0) {
num /= 5;
result++;
}
}
return result;
}

console.log(trailing_zeros_factorial(8)); // 1
console.log(trailing_zeros_factorial(9)); // 1
console.log(trailing_zeros_factorial(10)); // 2
int_sum = (num) => {
let s_sum = 0;
while (num > 0) {
s_sum += num;
num = Math.floor(num / 2);
}
return s_sum;
}
console.log(int_sum(8)); // 15
console.log(int_sum(9)); // 16
console.log(int_sum(26)); // 49
function is_correct_Sentence(input_str) {
var first_char = input_str[0];
var last_char = input_str[input_str.length - 1];
return /[A-Z]/.test(first_char) && last_char == "."
}

console.log(is_correct_Sentence("This tool will help you write

better English and efficiently corrects texts.")); // false
console.log(is_correct_Sentence("This tool will help you write
better English and efficiently corrects texts")); // false
console.log(is_correct_Sentence("this tool will help you write
better English and efficiently corrects texts.")); // true

is_diagonal_matrix = (user_matrix) => {

for (let i = 0; i < user_matrix.length; i++) {
for (let j = 0; j < user_matrix.length; j++) {
if (i !== j && user_matrix[i][j] !== 0) {
return false;
}
}
}
return true;
}

console.log(is_diagonal_matrix([[1, 0, 0], [0, 2, 0], [0, 0, 3] ])); // true

console.log(is_diagonal_matrix([[1, 0, 0], [0, 2, 3], [0, 0, 3] ])); // false
is_divisible_by3 = (mask_str) => {
let digitSum = 0;
const left = '0'.charCodeAt();
const right = '9'.charCodeAt();
const result = [];
const mask_data = mask_str.split('');
let hash_pos = -1;

for(var i = 0; i < mask_data.length; i++) {

if (left <= mask_data[i].charCodeAt() &&
mask_data[i].charCodeAt() <= right) {
digitSum += mask_data[i].charCodeAt() - left;
} else {
hash_pos = i;
}
}

for (var i = 0; i < 10; i++) {

if ((digitSum + i) % 3 === 0) {
mask_data[hash_pos] = String.fromCharCode(left + i);
result.push(mask_data.join(''));
}
}
return result;
}

console.log(is_divisible_by3("2#0"));// ["210","240","270"]
console.log(is_divisible_by3("4#2"));// ["402","432","462","492"]
is_identity_Matrix = (matrix_data) => {
for(let i = 0; i < matrix_data.length; i++) {
for(let j = 0; j < matrix_data.length; j++) {
if(matrix_data[i][j] !== 1 && i === j ||
matrix_data[i][j] && i !== j) {
return false;
}
}
}
return true;
}

console.log(is_identity_Matrix([[1, 0, 0],[0, 1, 0],[0, 0, 1]])); // true

console.log(is_identity_Matrix([[1, 0, 1],[0, 1, 0],[0, 0, 1]])); // false
is_inrange = (x, y, z) => {
return y >= x && y <= z;
}

console.log(is_inrange(1,2,3)); // true
console.log(is_inrange(1,2,-3)); // false
console.log(is_inrange(1.1,1.2,1.3)); // true
is_increasing_digits_Sequence = (num) => {
var arr_num = ('' + num).split('');
for(var i = 0; i < arr_num.length - 1; i++) {
if(parseInt(arr_num[i]) >= parseInt(arr_num[i + 1])){
return false;
}
}
return true;
}

console.log(is_increasing_digits_Sequence(123)); // true
console.log(is_increasing_digits_Sequence(1223)); // false
console.log(is_increasing_digits_Sequence(45677)); // false
check_a_point = (a, b, x, y, r) => {
const dist_points = (a - x) * (a - x) + (a - y) * (a - y);
r *= r;
if (dist_points < r) {
return true;
}
return false;
}

console.log(check_a_point(0, 0, 2, 4, 6)); // true

console.log(check_a_point(0, 0, 6, 8, 6)); // false

lower_triangular_matrix = (user_matrix) => {

for (let i = 0; i < user_matrix.length; i++) {
for (let j = 0; j < user_matrix[0].length; j++) {
if (j > i && user_matrix[i][j] !== 0){
return false;
}
}
}
return true;
}
console.log(lower_triangular_matrix([[1,0,0],[2,0,0],[0,3,3]])); // true
console.log(lower_triangular_matrix([[1,0,1],[2,0,0],[0,3,3]])); // false
is_monotonous = (num) => {
if (num.length === 1) {
return true;
}
const num_direction = num[1] - num[0];
for (let i = 0; i < num.length - 1; i++) {
if (num_direction * (num[i + 1] - num[i]) <= 0) {
return false;
}
}
return true;
}
console.log(is_monotonous([1, 2, 3])); // true
console.log(is_monotonous([1, 2, 2])); // false
console.log(is_monotonous([-3, -2, -1])); // true

max_even = (arra) => {

arra.sort((x, y) => y - x);
for (let i = 0; i < arra.length; i++) {
if (arra[i] % 2 == 0)
return arra[i];
}
}

console.log(max_even([20, 40, 200])); // 200

console.log(max_even([20, 40, 200, 301])); // 200
mirror_bits = (n) => {
return parseInt(n.toString(2).split("").reverse().join(""), 2);
}

console.log(mirror_bits(56)); // 7
console.log(mirror_bits(234)); // 87
nearest_round_number = (num) => {
while (num % 10) {
num++;
}
return num;
}

console.log(nearest_round_number(56)); // 60
console.log(nearest_round_number(592)); // 600

next_Prime_num = (num) => {

for (let i = num + 1;; i++) {
let isPrime = true;
for (let d = 2; d * d <= i; d++) {
if (i % d === 0) {
isPrime = false;
break;
}
}
if (isPrime) {
return i;
}
}
}

console.log(next_Prime_num(3)); // 5
console.log(next_Prime_num(17)); // 19
even_digits = (num) => {
let ctr = 0;
while (num) {
ctr += num % 2 === 0;
num = Math.floor(num / 10);
}
return ctr;
}

console.log(even_digits(123)); // 1
console.log(even_digits(1020)); // 3
console.log(even_digits(102)); // 2
prefix_sums = (arr) => {
const new_arr = [];
for (let i = 0; i < arr.length; i++) {
new_arr[i] = 0;
for (let j = 0; j < i + 1; j++) {
new_arr[i] += arr[j];
}
}
return new_arr;
}
console.log(prefix_sums([1,2,3,4,5])); // [1,3,6,10,15]
console.log(prefix_sums([1,2,-3,4,5])); // [1,3,0,4,9]
prime_factors = (num) => {
function is_prime(num) {
for(let i = 2; i <= Math.sqrt(num); i++) {
if(num % i === 0) {
return false;
}
}
return true;
}
const result = [];
for(let i = 2; i <= num; i++) {
while(is_prime(i) && num % i === 0) {
if (!result.includes(i)) {
result.push(i);
}
num /= i;
}
}
return result;
}
console.log(prime_factors(100)); // [2,5]
console.log(prime_factors(101)); // [101]
console.log(prime_factors(103)); // [103]
console.log(prime_factors(104)); // [2,13]
console.log(prime_factors(105)); // [3,5,7]

function proper_improper_test(num) {
return Math.abs(num[0] / num[1]) < 1
? "Proper fraction."
: "Improper fraction.";
}

console.log(proper_improper_test([12, 300])); // Proper fraction.

console.log(proper_improper_test([2, 4])); // Proper fraction.
console.log(proper_improper_test([103, 3])); // Improper fraction.
console.log(proper_improper_test([104, 2])); // Improper fraction.
console.log(proper_improper_test([5, 40])); // Proper fraction.
function change_char(str1) {
const result = [];
for (let i = 0; i < str1.length; i++) {
const char_order = str1.charCodeAt(i) - 'a'.charCodeAt(0);
const change_char = 25 - char_order + 'a'.charCodeAt(0);
result.push(String.fromCharCode(change_char));
}
return result.join("");
}

console.log(change_char("abcxyz"));// zyxcba
console.log(change_char("python"));// kbgslm
remove_duplicate_cchars = (str) => {
const arr_char = str.split("");
const result_arr = [];
for (let i = 0; i < arr_char.length; i++) {
if (str.indexOf(arr_char[i]) === str.lastIndexOf(arr_char[i])){
result_arr.push(arr_char[i]);
}
}
return result_arr.join("");
}

console.log(remove_duplicate_cchars("abcdabc"));// d
console.log(remove_duplicate_cchars("python"));// python
console.log(remove_duplicate_cchars("abcabc"));//
console.log(remove_duplicate_cchars("1365451"));// 364
replace_first_digit = (input_str) => {
return input_str.replace(/[0-9]/g, '$');
}

console.log(replace_first_digit("abc1dabc"));// abc$dabc
console.log(replace_first_digit("p3ython"));// p$ython
console.log(replace_first_digit("ab1cabc")); // ab$cabc
test_fifteen = (num) => {
while(num<15){
num++;
}
return num;
}
console.log(test_fifteen("123"));// 123
console.log(test_fifteen("10"));// 15
console.log(test_fifteen("5"));// 15

sixteen_bits_reverse = (num) => {

let result = 0;
for (let i = 0; i < 16; i++) {
result = result * 2 + (num % 2);
num = Math.floor(num / 2);
}
return result;
}

console.log(sixteen_bits_reverse(12345)); // 39948
console.log(sixteen_bits_reverse(10)); // 20480
console.log(sixteen_bits_reverse(5)); // 40960
find_rightmost_round_number = (input_arr) => {
let result = 0;
for(let i = 0; i < input_arr.length; i++){
if(input_arr[i] % 10 === 0) {
result = i;
}
}
return result;
}

console.log(find_rightmost_round_number([1, 22, 30, 54, 56])); // 2

console.log(find_rightmost_round_number([1, 22, 32, 54, 56])); // 0
console.log(find_rightmost_round_number([1, 22, 32, 54, 50])); // 4
test_same_digit = (num) => {
const first = num % 10;
while (num) {
if (num % 10 !== first) {
return false;
}
num = Math.floor(num / 10);
}
return true
}

console.log(test_same_digit(1234)); // false
console.log(test_same_digit(1111)); // true
console.log(test_same_digit(22222222)); // true
test_same_elements_both_arrays = (arra1, arra2) => {
let result = 0;
for(let i = 0; i < arra1.length; i++) {
for(let j = 0; j < arra2.length; j++){
if(arra1[i] === arra2[j]) {
result++;
}
}
}
return result;
}

console.log(test_same_elements_both_arrays([1,2,3,4],[1,2,3,4])); // 4
console.log(test_same_elements_both_arrays([1,2,3,4],[1,2,3,5])); // 3
console.log(test_same_elements_both_arrays([1,2,3,4],[11,22,33,44])); // 0
simplify_path = (main_path) => {
const parts = main_path.split('/');
const new_path = [];
let length = 0;
for(var i = 0; i < parts.length; i++) {
const part = parts[i];
if (part === '.' || part === '' || part === '..') {
if (part === '..' && length > 0) {
length--;
}
continue;
}
new_path[length++] = part;
}

if (length === 0) {
return '/';
}

let result = '';

for (var i = 0; i < length; i++) {
result += `/${new_path[i]}` ;
}
return result;
}
console.log(simplify_path("/home/var/./www/../html//sql/"));// /home/var/html/sql
sort_by_string_length = (arra) => {
for (var i = 0; i < arra.length; i++) {
for (var j = i + 1; j < arra.length; j++) {
if (arra[i].length > arra[j].length) {
var m = arra[i];
arra[i] = arra[j];
arra[j] = m;
}
}
}
return arra;
}

var arra = ["xyz","acd","aa","bb","zzz","","a","b"];

console.log("Original array: "+ arra+"\n");

// Original array: xyz,acd,aa,bb,zzz,,a,b
console.log(sort_by_string_length(["xyz","acd","aa","bb","zzz","","a","b"]));
// ["","a","b","bb","aa","xyz","acd","zzz"]
break_address = (url_add) => {
let data = url_add.split("://");
const protocol = data[0];
data = data[1].split(".com");
const domain = data[0];
data = data[1].split("/");
if(data[1]){
return [protocol,domain,data[1]]
}
return [protocol,domain]
}

var url_add = "https://www.w3resource.com/javascript-exercises/"

console.log(`Original address: ${url_add}`);
// Original address: https://www.w3resource.com/javascript-exercises/
console.log(break_address(url_add));
// ["https","www.w3resource","javascript-exercises"]
sumn = (val) => {
let sn = 0;
let i = 0;
while (sn <= val) {
sn += i++;
}
return i - 2;
}
console.log(sumn(11)); // 4
console.log(sumn(15)); // 5

sum_Of_Cubes = (n) => {

let sumn = 0;
for(let i = 1; i <= n; i++) {
sumn += i ** 3;
}
return sumn;
}

console.log(sum_Of_Cubes(3)); // 36
console.log(sum_Of_Cubes(4)); // 100
function sum_digits_from_string(dstr) {
let dsum = 0;
for (let i = 0; i < dstr.length; i++) {
if (/[0-9]/.test(dstr[i])) {
dsum += parseInt(dstr[i])
}
}
return dsum;
}

console.log(sum_digits_from_string("abcd12efg9"));// 12
console.log(sum_digits_from_string("w3resource"));// 3
halv_array_swap = (iarra) => {
if(((iarra.length)%2)!=0) {
return false;
}
for(let i = 0; i < iarra.length / 2; i++) {
const tmp = iarra[i];
iarra[i] = iarra[i + iarra.length / 2];
iarra[i + iarra.length / 2] = tmp;
}
return iarra;
}

console.log(halv_array_swap([1,2,3,4,5,6])); // [4,5,6,1,2,3]
console.log(halv_array_swap([1,2,3,4,5,6,7])); // false

change_case = (txt) => {

let str1 = "";
for (let i = 0; i < txt.length; i++) {
if (/[A-Z]/.test(txt[i])) {
str1 += txt[i].toLowerCase();
} else {
str1 += txt[i].toUpperCase();
}
}
return str1;
}

console.log(change_case("w3resource"));// W3RESOURCE
console.log(change_case("Germany"));// gERMANY
swap_adjacent_digits = (n) => {
if(n%2!=0) {
return false;
}

let result = 0;
let x = 1;
while(n != 0) {
const dg1 = n % 10;
const dg2 = ((n - dg1) / 10) % 10;
result += x * (10 * dg1 + dg2);
n = Math.floor(n / 100);
x *= 100;
}
return result;
}

console.log(swap_adjacent_digits(1234)); // 2143
console.log(swap_adjacent_digits(123456)); // 214365
console.log(swap_adjacent_digits(12345)); // false

Amadeus Quick Reference Guide - Basic (QRG)
100% (1)
Amadeus Quick Reference Guide - Basic (QRG)
35 pages
Javascript Notes
No ratings yet
Javascript Notes
48 pages
CLG922LCⅡ 出国机201008000
100% (10)
CLG922LCⅡ 出国机201008000
410 pages
JavaScript (JS) Cheat Sheet Online
No ratings yet
JavaScript (JS) Cheat Sheet Online
12 pages
Problem Solving-2
31% (16)
Problem Solving-2
98 pages
A Video System Based
No ratings yet
A Video System Based
13 pages
All Algorithm Solutions
No ratings yet
All Algorithm Solutions
215 pages
JS Challenges
No ratings yet
JS Challenges
34 pages
Robotics RRL
No ratings yet
Robotics RRL
2 pages
JS CheatSheet
No ratings yet
JS CheatSheet
4 pages
Henry Prepcourse Solutions
No ratings yet
Henry Prepcourse Solutions
25 pages
Day 1 Problem Statements & Systematic Approaches
No ratings yet
Day 1 Problem Statements & Systematic Approaches
50 pages
Discrete Vs IC Opamps
No ratings yet
Discrete Vs IC Opamps
36 pages
PQC
No ratings yet
PQC
77 pages
Practice For Javascript
No ratings yet
Practice For Javascript
19 pages
Javascript Notes
No ratings yet
Javascript Notes
29 pages
Compressor Scroll PDF
No ratings yet
Compressor Scroll PDF
29 pages
JS Programs
No ratings yet
JS Programs
23 pages
Digital Marketing Plan Template Smart Insights
100% (1)
Digital Marketing Plan Template Smart Insights
13 pages
Javascript Assignment
No ratings yet
Javascript Assignment
4 pages
JavaScript Cheat Sheet & Quick Reference
No ratings yet
JavaScript Cheat Sheet & Quick Reference
33 pages
JavaScript Coding Challenges For Interview 1745586295
No ratings yet
JavaScript Coding Challenges For Interview 1745586295
17 pages
CSS Summer 24
No ratings yet
CSS Summer 24
22 pages
VC Cisco
No ratings yet
VC Cisco
70 pages
Assign 7
No ratings yet
Assign 7
17 pages
Javascript Programs
No ratings yet
Javascript Programs
14 pages
JavaScript Cheat Sheet & Quick Reference
No ratings yet
JavaScript Cheat Sheet & Quick Reference
29 pages
JS Print
No ratings yet
JS Print
20 pages
Js Practical (
No ratings yet
Js Practical (
10 pages
WEBshortnote
No ratings yet
WEBshortnote
16 pages
Interview Practice Q's JS
No ratings yet
Interview Practice Q's JS
14 pages
תשובות
No ratings yet
תשובות
15 pages
Experiment 9
No ratings yet
Experiment 9
7 pages
WA Gas Elect Distestbk PDF
No ratings yet
WA Gas Elect Distestbk PDF
83 pages
JS PRactical Op
No ratings yet
JS PRactical Op
31 pages
Javascript
No ratings yet
Javascript
7 pages
Laminar Turbulent Transition of A Non Newtonian Fluid Flow
No ratings yet
Laminar Turbulent Transition of A Non Newtonian Fluid Flow
16 pages
Arrays
No ratings yet
Arrays
9 pages
FSD Exp 8
No ratings yet
FSD Exp 8
6 pages
Javascript Code
No ratings yet
Javascript Code
7 pages
JavaScript Cheat Sheet - A Comprehensive List For Quick Reference - Clue Mediator
No ratings yet
JavaScript Cheat Sheet - A Comprehensive List For Quick Reference - Clue Mediator
11 pages
Programming Questions
No ratings yet
Programming Questions
4 pages
Handson Lab JavaScript Browser Console Edx
No ratings yet
Handson Lab JavaScript Browser Console Edx
8 pages
Javascript
No ratings yet
Javascript
14 pages
Webtechmini
No ratings yet
Webtechmini
4 pages
Assignment 1
No ratings yet
Assignment 1
10 pages
KDK Me Catalogue 2014
No ratings yet
KDK Me Catalogue 2014
30 pages
Uppalwebt
No ratings yet
Uppalwebt
14 pages
Week 8
No ratings yet
Week 8
11 pages
User Guide: Clsv-B4Ks Clsv-B4Bs
No ratings yet
User Guide: Clsv-B4Ks Clsv-B4Bs
13 pages
Basics: On Page Script
No ratings yet
Basics: On Page Script
12 pages
Practical ANS
No ratings yet
Practical ANS
27 pages
Js Exercise Programs
100% (1)
Js Exercise Programs
6 pages
Js Cheatsheet
No ratings yet
Js Cheatsheet
22 pages
Ups LGR 0150 - GB
No ratings yet
Ups LGR 0150 - GB
3 pages
CSS Imp Que
No ratings yet
CSS Imp Que
5 pages
Ece Assignment
No ratings yet
Ece Assignment
2 pages
Javascript (Exercice If Else)
No ratings yet
Javascript (Exercice If Else)
5 pages
Index Js
No ratings yet
Index Js
4 pages
546 Form PEL Line Check CAAV (2) 2015 - 1 Ap Dung 1.1.2018 PDF
No ratings yet
546 Form PEL Line Check CAAV (2) 2015 - 1 Ap Dung 1.1.2018 PDF
2 pages
Week 9
No ratings yet
Week 9
21 pages
JavaScript (JS) Cheat Sheet Online
No ratings yet
JavaScript (JS) Cheat Sheet Online
3 pages
Swinging-Type Fire Doors Certified For Canada - UL Product Iq
No ratings yet
Swinging-Type Fire Doors Certified For Canada - UL Product Iq
2 pages
MMQR Model Update
No ratings yet
MMQR Model Update
2 pages
M.Tech (CSE) : Lovely Professional University
No ratings yet
M.Tech (CSE) : Lovely Professional University
6 pages
Getting Started With JS Part ONE
No ratings yet
Getting Started With JS Part ONE
38 pages
Replacing The Cooling Fan
No ratings yet
Replacing The Cooling Fan
1 page
Multiplication Table
No ratings yet
Multiplication Table
4 pages
CSS Practicals 1 To 8
No ratings yet
CSS Practicals 1 To 8
19 pages
Basic JS Programs-1
No ratings yet
Basic JS Programs-1
4 pages
Integrating Reading and Writing 1
No ratings yet
Integrating Reading and Writing 1
4 pages
Exp 9
No ratings yet
Exp 9
5 pages
JavaScript CheatSheet 1746934285
No ratings yet
JavaScript CheatSheet 1746934285
4 pages
ProcessTap Temperature - Dualam - AC Plastic Pipe
No ratings yet
ProcessTap Temperature - Dualam - AC Plastic Pipe
2 pages
Integer Question
No ratings yet
Integer Question
6 pages
Microwave Generators
No ratings yet
Microwave Generators
45 pages
Js Code
No ratings yet
Js Code
25 pages
PM3 Owners Manual
No ratings yet
PM3 Owners Manual
4 pages
81-1060 Cabezal de Descarga Plano - Detalle
No ratings yet
81-1060 Cabezal de Descarga Plano - Detalle
1 page
JAVASCRIP Prog
No ratings yet
JAVASCRIP Prog
5 pages
Foundation Plan: Structural General Notes
No ratings yet
Foundation Plan: Structural General Notes
1 page
JavaScript (JS) Cheat Sheet Online
No ratings yet
JavaScript (JS) Cheat Sheet Online
3 pages
Filter Banks, Short-Time Fourier Analysis, and The Phase Vocoder
No ratings yet
Filter Banks, Short-Time Fourier Analysis, and The Phase Vocoder
7 pages
Natural Ventilation in Office Buildings
No ratings yet
Natural Ventilation in Office Buildings
6 pages
PMF 015 HSE 151 v1 Lifting Plan
No ratings yet
PMF 015 HSE 151 v1 Lifting Plan
8 pages
Js Cheatsheet: Basics Loops
No ratings yet
Js Cheatsheet: Basics Loops
23 pages
JS Basic Note
No ratings yet
JS Basic Note
6 pages
Log Book
0% (2)
Log Book
6 pages
No Ph.D. Game Design With Three.js
From Everand
No Ph.D. Game Design With Three.js
Nikiforos Kontopoulos
No ratings yet
Computer Engineering Laboratory Solution Primer
From Everand
Computer Engineering Laboratory Solution Primer
Karan Bhandari
No ratings yet

JS Basic Q's

Uploaded by

JS Basic Q's

Uploaded by

const today = new Date();

const day = today.getDay();

let hour = today.getHours();

hour = (hour >= 12)? hour - 12: hour;

var num = Math.ceil(Math.random() * 10);

fToC = (fahrenheit) => {

cToF(60); // 60°C is 140°F.

function sumTriple (x, y) {

testhundred = (x) => {

front_back = (str) => {

front = str.substring(0, 4);

let result_str = str;

if (x1 < y1){

sortaSum = (x, y) => {

number_order = (x, y, z ) => {

console.log(test_nmuber(15, 9));// true

valCheck = (a, b) => {

console.log(capital_letter("Write a JavaScript program to

time_convert = (num) => {

vowel_Count = (str) => {

division_string = (n1, n2) => {

if (div >= 1000){

concatenate = (str1, str2) => {

city_name = (str) => {

console.log(city_name("New York"));// New York

first_last_1 = (nums) => {

middle_elements = (a, b) => {

longest_string = (str_ara) => {

console.log(angle_Type(47)); // Acute angle.

array_max_diff = (arr) => {

change_case = (new_str) => {

for(let i = 0; i < Math.max(first_set.length, second_set.length); i++) {

check_common_element = (arra1, arra2) => {

const is_upper_case = symbol => {

const is_first_char_lower = is_lower_case(input_str[0]);

for (let i = 1; i < input_str.length; i++) {

different_values = (ara, n) => {

arr_pairs = (arr) => {

sort_prime = (num) => {

trailing_zeros_factorial = (n) => {

console.log(is_correct_Sentence("This tool will help you write

is_diagonal_matrix = (user_matrix) => {

console.log(is_diagonal_matrix([[1, 0, 0], [0, 2, 0], [0, 0, 3] ])); // true

for(var i = 0; i < mask_data.length; i++) {

for (var i = 0; i < 10; i++) {

console.log(is_identity_Matrix([[1, 0, 0],[0, 1, 0],[0, 0, 1]])); // true

console.log(check_a_point(0, 0, 2, 4, 6)); // true

lower_triangular_matrix = (user_matrix) => {

max_even = (arra) => {

console.log(max_even([20, 40, 200])); // 200

next_Prime_num = (num) => {

console.log(proper_improper_test([12, 300])); // Proper fraction.

sixteen_bits_reverse = (num) => {

console.log(find_rightmost_round_number([1, 22, 30, 54, 56])); // 2

let result = '';

var arra = ["xyz","acd","aa","bb","zzz","","a","b"];

console.log("Original array: "+ arra+"\n");

var url_add = "https://www.w3resource.com/javascript-exercises/"

sum_Of_Cubes = (n) => {

change_case = (txt) => {

You might also like