Khusanboy Sobirjonov | IT Blog

#leetcode       649. Dota2 Senate masalasining yechimi:

class Solution {
public:
    string predictPartyVictory(string senate) {
        for (int i = 0; i < senate.length(); i++) {
        int r_cnt = 0;
        int d_cnt = 0;
        if (senate[i] == 'N') continue;
        for (int j = i; j < senate.length(); j++) {
            if (senate[j] == 'R') {
            r_cnt++;
            }
            if (senate[j] == 'D') {
            d_cnt++;
            }
            if (senate[i] == 'D' && senate[j] == 'R') {
            senate += 'D';
            senate[j] = 'N';
            break;
            } 
            if (senate[i] == 'R' && senate[j] == 'D') {
            senate += 'R';
            senate[j] = 'N';
            break;
            }
        }
        if (r_cnt == 0 && d_cnt != 0) {
            return "Dire";
        }
        if (r_cnt != 0 && d_cnt == 0) {
            return "Radiant";
        }
        }
        return "";
    }
};

Link : https://leetcode.com/problems/dota2-senate/ ❇️Telegram 🛑You tube  🤖 Robot

#foydali | #Python | #tuple Tuple (Kortej) ⁍ Kortej ro'yxat kabi, faqat kortej elementlari o'zgarmas hisoblanadi. ⁍ Kortejni e'lon qilish uchun () belgisidan yoki tuple() funksiyasidan foydalaniladi. Agarda kortej bir elementdan tashkil topsa, ',' belgisi qo'yilishi ham lozim. Misol : tuple_1 = (1, 2, 3) print(tuple_1) tuple_2 = (1, ) print(tuple_2) tuple_3 = (2) # xato e'lon qilish print(tuple_3) Natija : (1, 2, 3) (1,) 2 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Kod : print(tuple_1 + tuple_2) print(tuple_1 * 3) print(tuple(i for i in range(10))) Natija : (1, 2, 3, 1) (1, 2, 3, 1, 2, 3, 1, 2, 3) (0, 1, 2, 3, 4, 5, 6, 7, 8, 9) ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ tuple_1 = (1, 2, 3) tuple_1[1] = 2 Natija : TypeError beradi sabab biz kortej elementi qiymatini endi o'zgartira olmasligimizda. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Kortejni ro'yxatdan farqi

⁍ Kortejni ro'yxatdan yana bir farqi, kortej uchun xotiradan kam joy ajratiladi ro'yxatga nisbatan. ⁍ Kortejda ro'yxat ustida bajarib bo'ladigan amallardan ro'yxatni o'zgartirmaydigan amallarni ishlatish mumkin. Kod : tuple_1 = (1, 2, 3, 4) list_1 = [1, 2, 3, 4] print(tuple_1.__sizeof__()) print(list_1.__sizeof__()) Natija : 56 104 ©️cpython.uz dan olingan ma'lumotlar asosida tayyorlandi. Davomi bor... ❇️Telegram 🛑You tube  🤖 Robot

#hikmat Kelajakni bashorat qilishning eng yaxshi usuli - uni yaratish. ©️Piter Druker ❇️Telegram 🛑You tube  🤖 Robot

#leetcode       2367. Number of Arithmetic Triplets masalasining yechimi dart dasturlash tilida: 1-usul:

class Solution {
  int arithmeticTriplets(List<int> nums, int diff) {
    var cnt = 0;
    for (int i = 0; i < nums.length; i++) {
      if(nums.contains(nums[i] + diff) && nums.contains(nums[i] + 2 * diff)) {
        cnt++;
      }
    }
    return cnt;
  }
}

2-usul:

class Solution {
  int arithmeticTriplets(List<int> nums, int diff) {
    var cnt = 0;
    var mp = {};
    for (int i = 0; i < nums.length; i++) {
      mp[nums[i]] = 1;
    }
    for (int i = 0; i < nums.length; i++) {
      if (mp[nums[i] + diff] == 1 && mp[nums[i] + 2 * diff] == 1) {
        cnt++;
      }
    }
    return cnt;
  }
}

Link : https://leetcode.com/problems/number-of-arithmetic-triplets/ ❇️Telegram 🛑You tube  🤖 Robot

#leetcode       1491. Average Salary Excluding the Minimum and Maximum Salary masalasining yechimi dart dasturlash tilida: 1-usulim:

class Solution {
  double average(List<int> salary) {
    var max_salary = 0, min_salary = 1000001, sum = 0;
    salary.forEach((element) { 
      if (max_salary < element) max_salary = element;
      if (min_salary > element) min_salary = element;
      sum += element;
    });
    dynamic avg = (sum - max_salary - min_salary) / (salary.length - 2);
    return avg;
  }
}

2-usulim:

class Solution {
  double average(List<int> salary) {
    var max_salary = salary[0], min_salary = salary[0], sum = salary[0];
    int len = salary.length;
    for (int i = 1; i < len; i++) {
      if (max_salary < salary[i]) {
        max_salary = salary[i];
      }
      if (min_salary > salary[i]) {
        min_salary = salary[i];
      }
      sum += salary[i];
    }
    return (sum - max_salary - min_salary) / (len - 2);
  }
}

forEach funksiyasidan ko'ra for nisbatan ancha optimal ya'ni tez ishlar ekan. Link : https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/ ❇️Telegram 🛑You tube  🤖 Robot

#leetcode       2215. Find the Difference of Two Arrays masalasining yechimi dart dasturlash tilida: 1-usulim : Agarda oson yo'lini topa olmasangiz shunday kod yozib chiqishga majbur ekansiz.

class Solution {
  List<List<int>> findDifference(List<int> nums1, List<int> nums2) {
    List<List<int>> intersection_lst = [];
    Set<int> lst = {}, lst1 = {};
    for (int i = 0; i < nums1.length; i++) {
      if (nums2.contains(nums1[i]) == false) {
        lst.add(nums1[i]);
      }
    }
    for (int i = 0; i < nums2.length; i++) {
      if (nums1.contains(nums2[i]) == false) {
        lst1.add(nums2[i]);
      }
    }
    intersection_lst.add(lst.toList());
    intersection_lst.add(lst1.toList());
    return intersection_lst;
  }
}

2-usulim: To'plamlarda kesishmasini topish orqali tayyor funksiya bilan.

class Solution {
  List<List<int>> findDifference(List<int> nums1, List<int> nums2) {
    Set<int> st = nums1.toSet(), st1 = nums2.toSet();
    return [st.difference(st1).toList(), st1.difference(st).toList()];
  }
}

Link : https://leetcode.com/problems/find-the-difference-of-two-arrays/ ❇️Telegram 🛑You tube  🤖 Robot

#foydali Vektor elementlarini ekranga chiqarish operatorlarni qayta yuklashdan foydalanib: #include <bits/stdc++.h> using namespace std; int main() { vector<int> vc = {1,2,3,4,5,6,7,8,9,0}; auto print = [](int &n) {cout << n << " ";}; for_each(vc.begin(), vc.end(), print); } ❇️Telegram 🛑You tube  🤖 Robot

#hikmat Texnologiya sohasidagi yagona doimiy narsa - bu o'zgarish. ©️Bill Geyts ❇️Telegram 🛑You tube  🤖 Robot

#leetcode       1822. Sign of the Product of an Array masalasining yechimi dart dasturlash tilida:

class Solution {
  int arraySign(List<int> nums) {
    var positive_count = 0, negative_count = 0, equal = false;
    nums.forEach((element) {
      if (element == 0) {
        equal = true;
      } else if (element < 0) {
        negative_count++;
      } else {
        positive_count++;
      }
    });
    if (equal) {
      return 0;
    } 
    if (negative_count & 1 == 1) {
      return -1;
    }
    return 1;
  }
}

Link : https://leetcode.com/problems/sign-of-the-product-of-an-array/ ❇️Telegram 🛑You tube  🤖 Robot

#leetcode       20. Valid Parentheses masalasining yechimi dart dasturlash tilida:

class Solution {
  bool isValid(String s) {
    var lst = <String>[];
    for (int i = 0; i < s.length; i ++) {
      var j = s[i];
      if (j == '(' || j == '[' || j == '{') {
        lst.add(j);
      }
      if (j == ')') {
        if (lst.length == 0) {
          return false;
        }
        if (lst.last == '{' || lst.last == '[') {
          return false;
        }
        lst.removeLast();
      }
      if (j == '}') {
        if (lst.length == 0) {
          return false;
        }
        if (lst.last == '(' || lst.last == '[') {
          return false;
        }
        lst.removeLast();
      }
      if (j == ']') {
        if (lst.length == 0) {
          return false;
        }
        if (lst.last == '{' || lst.last == '(') {
          return false;
        }
        lst.removeLast();
      }
    }
    if (lst.length > 0) {
        return false;
    }
    return true;
  }
}

Link : https://leetcode.com/problems/valid-parentheses/ ❇️Telegram 🛑You tube  🤖 Robot

#leetcode       14. Longest Common Prefix masalasining yechimi dart dasturlash tilida:

class Solution {
  String longestCommonPrefix(List<String> strs) {
    var min_str = strs.fold("", (min_len, e) => min_len = min_len.toString().length < e.length ? e : min_len).toString();
    var max_prefix = "", cnt = 0, prefix = "";

    for (int i = 0; i < min_str.length; i++) {
      prefix += min_str[i];
      for (int j = 0; j < strs.length; j++) {
        if (strs[j].indexOf(prefix) == 0) {
          cnt++;
        } 
      }
      if (cnt == strs.length && max_prefix.length < prefix.length) {
        max_prefix = prefix;
      }
      cnt = 0;
    }
    return max_prefix;
  }
}

Link : https://leetcode.com/problems/longest-common-prefix/ ❇️Telegram 🛑You tube  🤖 Robot

#hikmat Eng yaxshi ish bu yuqori haq to'lanadigan xobbidir. ©️Henry Ford ❇️Telegram 🛑You tube  🤖 Robot

#hikmat Qo'rqoq faqat xiyonat qilishdagina qo'rqmaydi. ©️Shuhrat ❇️Telegram 🛑You tube  🤖 Robot

#leetcode       11. Container With Most Water masalasining yechimi dart dasturlash tilida:

class Solution {
  int maxArea(List<int> height) {
      var len = height.length - 1, i = 0;
      var max = 0;
      while (len > i) {
        dynamic l = (len - i) * min(height[i], height[len]);
        if (max < l) {
          max = l;
        }
        (height[len] > height[i]) ? i++ : len--;
      }
      return max;
  }
}

Link : https://leetcode.com/problems/container-with-most-water/description/ ❇️Telegram 🛑You tube  🤖 Robot

Ommaviy rivojlanish

Tez yuradigan yo’lda sekin ketayotgan mashinani eslang, asabingizni buzadi. Germaniya avtobanlari, Dubay trassalarida buning uchun jarima ham qilishadi. O’zini o’ylab sekin yurayotgan, to’xtagan mashina boshqalarni xavfli holatga qo’yadi, tirbandlikka olib boradi. Shaxsiy rivojlanishingiz bilan ham shunday. Sizni rivojlanmasligingiz nafaqat sizga, yoningizdagilar uchun ham zarar. Sizdan o’rnak olishi mumkin bo’lgan farzandlaringiz uchun zarar. Sizni katta qilib, katta umidlar bog’lagan ota-onangiz uchun zarar. Sizga havas qilib hayotini o’zgartirmoqchi bo’lganlar uchun zarar. Shaxsiy rivojlanishga shaxsiy rivojlanish deb qaramang. Ommaviy rivojlanish deb qarang. Shunda dangasaligingiz kamayadi. ©️azizrakhimov_blog ❇️Telegram 🛑You tube  🤖 Robot

#contest Contest vaqti 30.04.2023 sanasidan 31.05.2023 sanasigacha uzaytirildi. Keyingi haftadan yangi masalalar qo'shilishni boshlaydi. Hozircha noutbuksiz ishlayotganim uchun. Yangi taklif contestni bir qancha mavzulashtirilgan contestlarga bo'lib yuboraymi ? Masalalar soni ko'payib ketsa murakkab bo'lib ketmasligi uchun biror masalani topish. Fikringizni qoldiring. Manzil hali qo'shilmagan bo'lsangiz : Link ❇️Telegram 🛑You tube  🤖 Robot

#hikmat Inson o'z aqli bilan erishishi va qabul qilishi mumkin bo'lgan barchasiga erisha oladi. ©Napoleon Xill ❇️Telegram 🛑You tube  🤖 Robot

#leetcode       1. Two Sum masalasining yechimi dart dasturlash tilida: class Solution { List<int> twoSum(List<int> nums, int target) { var mp = {}; List<int> lst = []; for (int i = 0; i < nums.length; i++) { if (mp.containsKey(target-nums[i]) == true) { lst.add(nums[i]); lst.add(mp[target-nums[i]]); return lst; } mp[nums[i]] = i; } return lst; } } Link : https://leetcode.com/problems/two-sum/ ❇️Telegram 🛑You tube  🤖 Robot