console.log(Math.round(4.5)); // 5
console.log(Math.round(4.4)); // 4
console.log(Math.floor(4.9)); // 4
console.log(Math.floor(-4.1)); // -5
console.log(Math.ceil(4.1)); //5
console.log(Math.ceil(-4.9)); // -4
console.log(Math.trunc(4.9)); // 4
console.log(Math.trunc(-4.9)); // -4
π5π₯3π2β‘1
JavaScript || DSA
console.log(Math.round(4.5)); // 5 console.log(Math.round(4.4)); // 4 console.log(Math.floor(4.9)); // 4 console.log(Math.floor(-4.1)); // -5 console.log(Math.ceil(4.1)); //5 console.log(Math.ceil(-4.9)); // -4 console.log(Math.trunc(4.9)); // 4 coβ¦
Math.round()
raqamni eng yaqin butun songa yaxlitlaydi. Agar kasr qismi >= 0,5 bo'lsa, raqam yaxlitlanadi. Aks holda, raqam pastga yaxlitlanadi.
Math.floor()
raqamni eng yaqin butun songacha yaxlitlaydi. Bu musbat sonlar uchun kasr qismini kesish kabi ishlaydi, lekin salbiy sonlar uchun u "pastga", ya'ni kichikroq raqamga yaxlitlanadi.
Math.ceil()
raqamni eng yaqin butun songacha yaxlitlaydi.
Math.trunc()JavaScript funksiyasi sonning butun qismini qaytaradi. Ya'ni, u sonning kasr qismini tashlab yuboradi va faqat butun qismini qoldiradi. Natija har doim butun son bo'ladi.
@JavaScriptQuiiz
Please open Telegram to view this post
VIEW IN TELEGRAM
β‘3π₯3π1π€―1π1
JavaScript || DSA
console.log([..."salom"]); @JavaScriptQuiiz
π5π2π1
Arraydagi eng uzun ketma-ketlik.
Array berilgan, Siz ketma-ket elementlarni o'z ichiga olgan eng uzun ketma-ketlikning uzunligini topishingiz kerak.
Agar savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!
Leetcode dagi shu misol uchun shunga o'xshash link : click me
@JavaScriptQuiiz
Array berilgan, Siz ketma-ket elementlarni o'z ichiga olgan eng uzun ketma-ketlikning uzunligini topishingiz kerak.
Input: Arr =[100, 200, 1, 3, 2, 4]
output: 4
Tarif: Eng uzun ketma-ket ketma-ketlik 1, 2, 3 va 4.
Input: ARR = [3, 8, 5, 7, 6]
Output: 4
Tarif: Eng uzun ketma-ketlik 5, 6, 7, va 8.Agar savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!
Leetcode dagi shu misol uchun shunga o'xshash link : click me
Commentariyada boshqalar bilan muhokama qiling, juda muhim!
@JavaScriptQuiiz
π4π₯3β‘1π€―1
Please open Telegram to view this post
VIEW IN TELEGRAM
Yigindi K ga teng bo'lgan eng uzun sub-array(ichidagi bolalaridan tashkil topgan array) toping va uning uzunligini qaytaring.
Agar savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!
Commentariyada boshqalar bilan muhokama qiling, juda muhim.
βοΈ Uchun rahmat!!!
@JavaScriptQuiiz
input: arr = [2,3,5] k=5
output: 2 : 2 va 3 larning yi'gindisi 5 ga teng , shunda bizda ikkita element k ga teng
Input: arr = [2,3,5,1,9] k = 10
output: 3 -> [2, 3, 5] yokie [1, 9] bizga eng uzuni kerak shuning uchun birinchisi javob bo'ladi.
Agar savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!
Leetcode dagi shu misol uchun o'xshash link : click meCommentariyada boshqalar bilan muhokama qiling, juda muhim.
@JavaScriptQuiiz
LeetCode
Subarray Sum Equals K - LeetCode
Can you solve this real interview question? Subarray Sum Equals K - Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.
A subarray is a contiguous non-empty sequence of elements within an array.
β¦
A subarray is a contiguous non-empty sequence of elements within an array.
β¦
π3π₯1π1
Matritsa berilgan, shu matritsani spiral tartib bilan qaytaring.
Agar savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!
Commentariyada boshqalar bilan muhokama qiling, juda muhim!
@JavaScriptQuiiz
Input: matrix=[
[1, 2, 3, 4],
[5, 6, 7, 8],
[9, 10, 11, 12],
[13, 14, 15, 16]
];
output: [1, 2, 3, 4, 8, 12, 16, 15, 14, 13, 9, 5, 6, 7, 11, 10]
Input: matrix=[
[1, 2, 3],
[4, 5, 6],
[7, 8, 9]
];
Output: [1, 2, 3, 6, 9, 8, 7, 4, 5]
Agar savol qiyinlik qilsa, internetdan izlab ko'rib javobini ko'rib, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!
Leetcode dagi shu misol uchun shunga o'xshash link : click meCommentariyada boshqalar bilan muhokama qiling, juda muhim!
@JavaScriptQuiiz
LeetCode
Spiral Matrix - LeetCode
Can you solve this real interview question? Spiral Matrix - Given an m x n matrix, return all elements of the matrix in spiral order.
Example 1:
[https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg]
Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]β¦
Example 1:
[https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg]
Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]β¦
π5π₯1π1
Inna lillahi va inna ilayhi rojiun.
π€² Shukrullo Turgunov (@vodiylik).
OΚ»zbek IT olamida koΚ»p foydalari tekkan inson.
Duo qilib qoΚ»ysangiz.
π€² Shukrullo Turgunov (@vodiylik).
OΚ»zbek IT olamida koΚ»p foydalari tekkan inson.
Duo qilib qoΚ»ysangiz.
π’10π₯4π1
Bizda array berilgan, va u faqat 0, 1, 2, lardan tashkil topgan, shunday programma yozingki u shu berilgan arrayni sort() metodidan foydalanmagan holda tartiblasin, va [ kutiladi: bitta iteration-O(n) va constant space -O(1)]
Leetcode dagi shu misol uchun muqobil link : click me
Commentariyada boshqalar bilan muhokama qiling, juda muhim.
@JavaScriptQuiiz
input: arr = [2,0,2,1,1,0]
output: [0,0,1,1,2,2]
Input: arr = [2,0,1]
output: [0, 1, 2]
Leetcode dagi shu misol uchun muqobil link : click me
Savol qiyinlik qilsa, internetdan search qiling, algorithmni qanday ishlashini tushunishga harakat qiling va shuni o'zingiz takroran ishlab ko'ring!!!
Commentariyada boshqalar bilan muhokama qiling, juda muhim.
@JavaScriptQuiiz
LeetCode
Sort Colors - LeetCode
Can you solve this real interview question? Sort Colors - Given an array nums with n objects colored red, white, or blue, sort them in-place [https://en.wikipedia.org/wiki/In-place_algorithm] so that objects of the same color are adjacent, with the colorsβ¦
π5π₯1
Assalomu alaykum hammaga, soat 20:00 da sizni JavaScriptga oid qiziqali/murakkab/oson viktorina savollari kutmoqda.
Tayyormisiz ?
@JavaScriptQuiiz
@JavaScriptQuiiz
π6
function greet() {
return "Hello" || "Hi";
}
function greet2() {
return "Hello" && "Hi";
}
console.log(greet());
console.log(greet2());Forwarded from content
let obj = {
1: "one",
0: "zero",
true: "truthy",
false: "falsy",
};
console.log(obj[1]);
console.log(obj["1"]);
console.log(obj[true]);Forwarded from content