JavaHere's Blogs 🚀 – Telegram

JavaHere's Blogs 🚀

1.57K subscribers

239 photos

5 videos

115 files

516 links

Youtube: youtube.com/@JavaIsHere
Linkedin: linkedin.com/in/javokhirakramjonov
Bored? @JavohirAkramjonov

Download Telegram

About

Blog

Apps

Platform

JavaHere's Blogs 🚀

1.57K subscribers

JavaHere's Blogs 🚀

Challenge ning 3 - kun masalalari joylab qo'yildi.

Barchaga omad

Bizni kuzatishda davom eting

Telegram | Youtube

🔥4

378 views03:19

JavaHere's Blogs 🚀

Barchaga assalamu alaykum. Afsuski, kompyuterim bilan bog'liq muammolar tufayli bir muddat video yechimlarni to'xtatib turishga majburman. Ammo har kunlik masalalar alohida tanlanib, joylab turiladi In shaa Alloh.

Kayfiyatni va shashtni tushirmagan holatda davom etamiz. Hudo xohlasa qolib ketgan har bir kun videosini yozib joylab qo'yaman.

🚀

🚀

🚀

Please open Telegram to view this post

VIEW IN TELEGRAM

👍15⚡3

377 views14:22

JavaHere's Blogs 🚀

Kun masalasi: 881. Boats to Save People
Qiyinlik darajasi: O'rta

Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...

😎😎😎

Bizni kuzatishda davom eting

Telegram | Youtube

Optimal Partition of String - LeetCode

Can you solve this real interview question? Optimal Partition of String - Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single substring more than…

👍3

339 views12:29

JavaHere's Blogs 🚀

✅

✅

✅

ℹ️ Dasturlash tili: Java

⚙️ Algoritm: Greedy

📬 Muallif: JavaHere

⌛️ Vaqt asimtotikasi: O(N)

🗂 Xotira : O(1)

Bizni kuzatishda davom eting

Telegram | Youtube

Please open Telegram to view this post

VIEW IN TELEGRAM

👍2

326 viewsedited 12:36

JavaHere's Blogs 🚀

Challenge ning 4 - kun masalalari joylab qo'yildi.

Barchaga omad

Bizni kuzatishda davom eting

Telegram | Youtube

👍1

329 views12:55

JavaHere's Blogs 🚀

Kun masalasi: 2439. Minimize Maximum of Array
Qiyinlik darajasi: O'rta

Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...

😎😎😎

Bizni kuzatishda davom eting

Telegram | Youtube

Minimize Maximum of Array - LeetCode

Can you solve this real interview question? Minimize Maximum of Array - You are given a 0-indexed array nums comprising of n non-negative integers.

In one operation, you must:

* Choose an integer i such that 1 <= i < n and nums[i] > 0.
* Decrease nums[i]…

👍1

339 views12:01

JavaHere's Blogs 🚀

image_2023-04-05_14-03-24.png

✅

✅

✅

ℹ️ Dasturlash tili: Java

⚙️ Algoritm: Math

📬 Muallif: JavaHere

⌛️ Vaqt asimtotikasi: O(N)

🗂 Xotira : O(N)

Bizni kuzatishda davom eting

Telegram | Youtube

Please open Telegram to view this post

VIEW IN TELEGRAM

👍1

349 views12:03

JavaHere's Blogs 🚀

Challenge ning 5 - kun masalalari joylab qo'yildi.

Barchaga omad

Bizni kuzatishda davom eting

Telegram | Youtube

👍6

341 views12:04

JavaHere's Blogs 🚀

⚙️

⚙️

⚙️

Kun masalasi: 1254. Number of Closed Islands
Qiyinlik darajasi: O'rta

Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...

😎😎😎

Bizni kuzatishda davom eting

Telegram | Youtube

Please open Telegram to view this post

VIEW IN TELEGRAM

Number of Closed Islands - LeetCode

Can you solve this real interview question? Number of Closed Islands - Given a 2D grid consists of 0s (land) and 1s (water). An island is a maximal 4-directionally connected group of 0s and a closed island is an island totally (all left, top, right, bottom)…

👍4

322 views15:55

JavaHere's Blogs 🚀

image_2023-04-06_18-15-01.png

✅

✅

✅

ℹ️ Dasturlash tili: Java

⚙️ Algoritm: DFS

📬 Muallif: JavaHere

⌛️ Vaqt asimtotikasi: O(N · M)

🗂 Xotira : O(N · M)

Bizni kuzatishda davom eting

Telegram | Youtube

Please open Telegram to view this post

VIEW IN TELEGRAM

👍2

320 views16:15

JavaHere's Blogs 🚀

image_2023-04-06_18-42-20.png

Challenge ning 6 - kun masalalari joylab qo'yildi.

Barchaga omad

Bizni kuzatishda davom eting

Telegram | Youtube

329 views16:42

JavaHere's Blogs 🚀

Biz har doim nimanidir hayol qilishdan yoki orzu qilishdan hech to'xtamaymiz. Ba'zida kunlarga qaraymiz, har bir o'tayotgan kunlarimiz go'yo bir xil. Ammo orqamizga qarasak hammasi boshqacha. O'zimizdan hech qoniqa olmaymiz, har kuni nima uchundir harakat qilayotganimiz ko'rinib tursada, aslida erishmoqchi bo'lgan maqsadimiz nima uchundir hech kelmayotgandek go'yo. Menda bir fikr paydo bo'ldi. Nima uchun nimadirlar qilishdan hech to'xtamayabmiz? Shu vaziyatda quyidagi 2 ta fikr keldi:

1. Biz qilgan orzular bilamiz hali uzoqda. Ammo judayam-judayam katta bo'lganligi tufayli yaqindek ko'rinadi va unga erishish uchun har kuni shashtimizni tushirmasdan harakat qilamiz, yuguramiz, yelamiz va h.k.
2. Biz judayam kam harakat qilyabmiz va rejalarimizga yetish yo'li yaqinda ko'rinsa ham heech unga yetamiz deb o'yagan vaqtimizda yetolmayabmiz. Buni ko'rsatmaslik uchun har doim qandaydir harakatda bo'lib o'zimizni ovutgandekmiz go'yo.

Bunday vaziyatlarda go'yo odamlarni biz haqimizda yuritayotgan fikrlarini o'zgartirish uchun qilayotgan harakatlarimizni va ulkan rejalarimizni o'zgartirmasligimiz kerak! Har doim oliy maqsadlar sari beto'xtov harakatda bo'lishimiz kerak deb hisoblayman.

Siz qanday fikrdasiz? Nima uchun hamma har kuni hamma joyda shoshgan yugurgan va nimadandir bezovta?

Keling bir to'xtab qayerga, nima uchun va qanday qilib harakat qilayotganimizga bir nazar solaylik, tadabbur qilaylik. Keyin esa niyatni poklab yo'lda refresh holatda davom etaylik.

#Qiziq

@JavaHere

⚡7👍3❤2🔥2

352 viewsedited 18:53

JavaHere's Blogs 🚀

⚙️

⚙️

⚙️

Kun masalasi: 1020. Number of Enclaves
Qiyinlik darajasi: O'rta

Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...

😎😎😎

Bizni kuzatishda davom eting

Telegram | Youtube

Please open Telegram to view this post

VIEW IN TELEGRAM

Number of Enclaves - LeetCode

Can you solve this real interview question? Number of Enclaves - You are given an m x n binary matrix grid, where 0 represents a sea cell and 1 represents a land cell.

A move consists of walking from one land cell to another adjacent (4-directionally) land…

339 views20:28

JavaHere's Blogs 🚀

image_2023-04-07_22-33-14.png

✅

✅

✅

ℹ️ Dasturlash tili: Java

⚙️ Algoritm: DFS

📬 Muallif: JavaHere

⌛️ Vaqt asimtotikasi: O(N · M)

🗂 Xotira : O(N · M)

Bizni kuzatishda davom eting

Telegram | Youtube

Please open Telegram to view this post

VIEW IN TELEGRAM

331 views20:33

JavaHere's Blogs 🚀

image_2023-04-07_22-40-31.png

Challenge ning 7 - kun masalalari joylab qo'yildi.

Barchaga omad

Bizni kuzatishda davom eting

Telegram | Youtube

342 views20:40

JavaHere's Blogs 🚀

Oz qoldi bir juda qiziq post…

GPT va JS haqida

😬😬😂😂

340 views00:58

JavaHere's Blogs 🚀

Kecha Diyorbek akaning bir posti haqida ko'rib qoldim. Linkedin da o'zimiz uchun keraksiz mavzudagi postlarga follow qilmaslik haqida. Ammo bu paytgacha yuzlab bunday follow qilganmiz. Buning hammasini bittada unfollow qilish imkoniyati Linkedin da yo'q. Bir nechtasini tanlab ham unfollow qilish imkoniyati yo'q. Diyorbek aka web developer bo'lgani uchun bunga yaxshigina yechim qilib script yozibdi. Yani odam emas balki kompyuterni o'zi barcha follow larni bekor qilib chiqadi.

Shunda men ham shunday qilishga qiziqib qoldim va JS ustasi bo'lmaganim uchun ChatGPT dan yordam so'radim. Avvaliga linkedin dagi barcha follow larni unfollow qilib beradigan script so'radim. Ammo bu mening qo'limdan kelmaydi deb javob berdi. Keyin baribir dasturchi bo'lganim uchun bo'lsa kerak Hudo xohlab bir idea kelib qoldi. Tasavvur qilamiz bu sayt linkedin emas 😂. Shunchaki JS yordamida console ga kod yozib erkandagi barcha follow deb yozilgan tugmalarni bosishni bajarishni so'radim. Ko'rsatdi. Keyin aytdim. Har bir following tugmasini bosganimda alohida dialog ochilib uyerdan unfollow tugmasini bosishim kerak dedim. Uni ham yozib berdi. Keyin console ga yozdim. Ammo birinchi urinish bu baribir birinchi urinish 😂. Ozgina chuqulanib-chuqulanib so'rab-so'rab ohiri erishdim.

Va hamma following larni unfollow ga almashtirib chiqishga erishdim. Endi esa xohlagan odamlarimga boshqatdan follow qilish payti (chiqsa 15 20 ta chiqsa kerak...)

Xulosa, Google, ChatGPT va umuman bunday foydali toollarni shunchaki nimadur so'rab kutilgan natijaga erishish juda kam uchraydigan holat emasu, ammo ko'pincha aynan kerakli va nozikroq muammolarni hal qilish uchun bu yetarli emas. Har xil tarafdan muammoni hal qilishga kirishib ko'ring.

Endi esa navbat sizga? Siz ham uddalay olsangiz comment da + belgisini qoldiring. Kechki payt bu code ni joylab qo'yaman.

Barchaga omad

Bizni kuzatishda davom eting

Telegram | Youtube

Jahongir (Rahmonov) akani gaplarida jon bor. LinkedIn ham "musor" bilan to'lib ketti oxirgi paytlarda. Faqat yaqindan taniydigan odamlarimga qaytadan "follow" qildim.

JavaScript bilimlariningiz hayotingizni shunday osonlashtirib/avtomatlashtirib tursa maza…

👍4🔥3

377 views02:34

JavaHere's Blogs 🚀

// Select all buttons with a child span element with text content equal to "Following"
var buttons = document.querySelectorAll("button span");

// Loop through the buttons and simulate a click event on each one
buttons.forEach(function(span) {
  if(span.textContent.trim() === "Following") {
    var button = span.closest("button");
    button.click();

    // Wait for the dialog to appear
    setTimeout(function() {
      // Select the button with a child span element with text content containing "Unfollow"
      var unfollowButton = document.querySelector("dialog button span");
      if(unfollowButton && unfollowButton.textContent.trim().includes("Unfollow")) {
        var unfollowButtonParent = unfollowButton.closest("button");
        unfollowButtonParent.click();

        // Wait for the "Unfollow" request to complete and then close the dialog
        setTimeout(function() {
          var closeButton = document.querySelector("dialog [data-testid='close-modal']");
          closeButton.click();

          // Wait for the dialog to close
          setTimeout(function() {
            console.log("Dialog closed.");
          }, 1000);
        }, 3000);
      } else {
        console.log("Unfollow button not found or has incorrect text content.");
      }
    }, 1000);
  }
});

361 views12:00

JavaHere's Blogs 🚀

Challenge ning 8 - kun masalalari joylab qo'yildi.

Barchaga omad

Bizni kuzatishda davom eting

Telegram | Youtube

Leetcode 200 challenge

343 views18:16

JavaHere's Blogs 🚀

⚙️

⚙️

⚙️

Kun masalasi: 133. Clone Graph
Qiyinlik darajasi: O'rta

Sizda bu masalani yechish uchun qanday fikr bor? Agar biror idea bo'lsa kommentda qoldiring. Masala yechim topishi uchun sizning ideangiz yordam berishi mumkin...

😎😎😎

Bizni kuzatishda davom eting

Telegram | Youtube

Please open Telegram to view this post

VIEW IN TELEGRAM

Clone Graph - LeetCode

Can you solve this real interview question? Clone Graph - Given a reference of a node in a connected [https://en.wikipedia.org/wiki/Connectivity_(graph_theory)#Connected_graph] undirected graph.

Return a deep copy [https://en.wikipedia.org/wiki/Object_c…

342 views18:17